Online Learning and Adaptation Over Networks

Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=LguPG6sLLbA



Duration: 1:16:05
370 views
6


Adaptive networks consist of a collection of agents with local adaptation and learning abilities. The agents interact with each other on a local level and diffuse information across the network to solve inference or optimization tasks in a decentralized manner. Such networks are robust to node and link failures, and are particularly suitable for learning from large data sets by tapping into the power of cooperation among spatially-distributed agents. Nevertheless, some surprising phenomena arise when information is processed in a decentralized fashion over networked systems. For example, the addition of more informed agents does not necessarily lead to enhanced performance, and even minor variations in how information is processed by the agents can lead to failure. In this talk, we elaborate on such phenomena in the context of distributed stochastic-gradient learners. We consider two classes of distributed schemes for learning and adaptation involving consensus strategies and diffusion strategies. We quantify how the performance and the convergence rate of the network vary with the combination policy and with the proportion of informed agents, and explain how the performance of any arbitrary connected topology can be made to match the performance of centralized stochastic learners. Among other results, it will be seen that the performance of a network of learners does not always improve with a larger proportion of informed agents. A strategy to counter the degradation in performance is presented. It will also be seen how the order by which information is processed by the agents is critical: minor variations can lead to failure even in situations when the agents are able to solve the inference task individually on their own. To illustrate these effects, we will establish that diffusion protocols are mean-square stable regardless of the network topology. In contrast, consensus protocols can become unstable even if all individual agents are stable. These results indicate that information processing over networked systems gives rise to some revealing phenomena due to the coupling effect among the agents.




Other Videos By Microsoft Research


2016-07-26Decision Learning: Learning with Strategic Decision Making
2016-07-26The CUBE: examples and research challenges in large scale interaction space
2016-07-26The Promises and Pitfalls of Demographic Inference in Social Media
2016-07-26Probabilistic Elastic Part Model: A Pose-Invariant Representation for Real-world Face Recognition
2016-07-26Checking App Behavior Against App Descriptions
2016-07-26Scalable learning of Bayesian network classifiers
2016-07-26Everything you always wanted to know about web-based device fingerprinting (but were afraid to ask)
2016-07-26Making Reusable Hardware Design IPs Usable: an NoC perspective
2016-07-26Lessons from Megaprojects: The Creators and Destroyers of Capital
2016-07-26Unsupervised Transcription of Historical Documents
2016-07-26Online Learning and Adaptation Over Networks
2016-07-26Easy Generation and Efficient Verification of Unsatisfiability Proofs
2016-07-26Learning to Understand Natural Language in Physically-Grounded Environments
2016-07-26Frontiers of Accessibility: From the Body to the Mind, the Heart, and the Soul
2016-07-26Analyzing neurological disorders using functional and structural brain imaging data
2016-07-26Collaborative, Large-Scale Data Analytics and Visualization with Python
2016-07-26Gap Probabilities for Zeroes of Stationary Gaussian Functions
2016-07-26Random Walks on Groups and the Kaimanovich-Vershik Conjecture for Lamplighter Groups
2016-07-26Sensing without Sensors
2016-07-26Optimal Falsifications for Cyber-Physical Systems using Trajectory Splicing
2016-07-26A Sensor Fusion Approach towards Gesture Recognition on the Wearable Ring Form Factor



Tags:
microsoft research