arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.01505eess.SYcs.ITcs.LGcs.SYmath.IT
收藏

网络中指数快速非贝叶斯学习的通信有效算法

A Communication-Efficient Algorithm for Exponentially Fast Non-Bayesian Learning in Networks

Purdue University(普渡大学);Sandia National Laboratories(桑迪亚国家实验室)

Aritra Mitra, John A. Richards, Shreyas Sundaram

摘要:

我们引入了一个简单的时间触发协议,以实现通信效率的非贝叶斯网络学习。具体来说,我们考虑一个场景,其中一组代理在一个图上进行交互,目的是识别生成其联合观察配置文件的世界的真实状态。为了解决这个问题,我们提出了一种新的分布式学习规则,其中代理聚合相邻的信念的基础上最小的协议,和相互通信的时间间隔几何增长率$a \geq 1$。尽管这样稀疏的通信,我们表明,每个代理仍然能够排除每一个假假设指数快速概率$1$,只要$a$有限。对于通信在每个时间步发生的特殊情况,即,当采用$a=1$时,我们证明了由我们的算法得到的渐近学习率是与网络结构无关的,并且严格改进了文献中已有的渐近学习率。相比之下,当$a>1$,我们的分析表明,渐近学习率各不相同的代理,并表现出非平凡的依赖于网络拓扑加上代理的似然模型的相对熵。这促使我们考虑分配信号结构的代理,以最大限度地提高适当的性能指标的问题。在某些特殊情况下,我们表明,偏心率中心和基础图形的衰减中心有助于确定最优分配;对于更一般的情况下,我们绑定的偏差从最优分配作为一个函数的参数$a$,和直径的通信图。

英文摘要:

We introduce a simple time-triggered protocol to achieve communication-efficient non-Bayesian learning over a network. Specifically, we consider a scenario where a group of agents interact over a graph with the aim of discerning the true state of the world that generates their joint observation profiles. To address this problem, we propose a novel distributed learning rule wherein agents aggregate neighboring beliefs based on a min-protocol, and the inter-communication intervals grow geometrically at a rate $a \geq 1$. Despite such sparse communication, we show that each agent is still able to rule out every false hypothesis exponentially fast with probability $1$, as long as $a$ is finite. For the special case when communication occurs at every time-step, i.e., when $a=1$, we prove that the asymptotic learning rates resulting from our algorithm are network-structure independent, and a strict improvement upon those existing in the literature. In contrast, when $a>1$, our analysis reveals that the asymptotic learning rates vary across agents, and exhibit a non-trivial dependence on the network topology coupled with the relative entropies of the agents' likelihood models. This motivates us to consider the problem of allocating signal structures to agents to maximize appropriate performance metrics. In certain special cases, we show that the eccentricity centrality and the decay centrality of the underlying graph help identify optimal allocations; for more general scenarios, we bound the deviation from the optimal allocation as a function of the parameter $a$, and the diameter of the communication graph.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑