Adaptive Social Learning

被引:31
作者
Bordignon, Virginia [1 ]
Matta, Vincenzo [2 ,3 ]
Sayed, Ali H. [1 ]
机构
[1] Ecole Polytech Fed Lausanne EPFL, Sch Engn, CH-1015 Lausanne, Switzerland
[2] Univ Salerno, Dept Informat & Elect Engn & Appl Math DIEM, Fisciano, SA, Italy
[3] Natl Interuniv Consortium Telecommun CNIT, Parma, Italy
基金
瑞士国家科学基金会;
关键词
Error probability; Convergence; Adaptation models; Data models; Cloud computing; Transient analysis; Steady-state; Social learning; adaptation; diffusion strategies; large deviations; DIFFUSION; NETWORKS; BELIEFS;
D O I
10.1109/TIT.2021.3094633
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This work proposes a novel strategy for social learning by introducing the critical feature of adaptation. In social learning, several distributed agents update continually their belief about a phenomenon of interest through: i) direct observation of streaming data that they gather locally; and ii) diffusion of their beliefs through local cooperation with their neighbors. Traditional social learning implementations are known to learn well the underlying hypothesis (which means that the belief of every individual agent peaks at the true hypothesis), achieving steady improvement in the learning accuracy under stationary conditions. However, these algorithms do not perform well under nonstationary conditions commonly encountered in online learning, exhibiting a significant inertia to track drifts in the streaming data. In order to address this gap, we propose an Adaptive Social Learning (ASL) strategy, which relies on a small step-size parameter to tune the adaptation degree. First, we provide a detailed characterization of the learning performance by means of a steady-state analysis. Focusing on the small step-size regime, we establish that the ASL strategy achieves consistent learning under standard global identifiability assumptions. We derive reliable Gaussian approximations for the probability of error (i.e., of choosing a wrong hypothesis) at each individual agent. We carry out a large deviations analysis revealing the universal behavior of adaptive social learning: the error probabilities decrease exponentially fast with the inverse of the step-size, and we characterize the resulting exponential learning rate. Second, we characterize the adaptation performance by means of a detailed transient analysis, which allows us to obtain useful analytical formulas relating the adaptation time to the step-size. The revealed dependence of the adaptation time and the error probabilities on the step-size highlights the fundamental trade-off between adaptation and learning emerging in adaptive social learning.
引用
收藏
页码:6053 / 6081
页数:29
相关论文
共 35 条
[31]   Adaptation, Learning, and Optimization over Networks [J].
Sayed, Ali H. .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2014, 7 (4-5) :I-+
[32]   Distributed Detection: Finite-Time Analysis and Impact of Network Topology [J].
Shahrampour, Shahin ;
Rakhlin, Alexander ;
Jadbabaie, Ali .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2016, 61 (11) :3256-3268
[33]  
Thomas J. A., 1991, ELEMENTS INFORM THEO
[34]  
Yildiz E., 2013, ACM Transactions on Economics and Computation (TEAC), V1, P1, DOI 10.1145/2538508
[35]  
Zhao XC, 2012, CONF REC ASILOMAR C, P709, DOI 10.1109/ACSSC.2012.6489103