arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.01302eess.SYcs.GTcs.ITcs.LGcs.SYmath.IT
收藏

基于稀疏量化通信的分布式推理

Distributed Inference with Sparse and Quantized Communication

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

Aritra Mitra, John A. Richards, Saurabh Bagchi, Shreyas Sundaram

摘要:

我们考虑分布式推理的问题,在网络中的代理观察到一个未知状态产生的私人信号流,并旨在唯一地识别这种状态从一组有限的假设。我们专注于代理之间的通信是昂贵的,并发生在有限带宽的通道的情况下。为了减少通信的频率,我们开发了一种新的事件触发的分布式学习规则,该规则基于对每个错误假设扩散低信念的原则。基于这一原则,我们设计了一个触发条件下,代理广播只有那些组件的信念向量,有足够的创新,只有那些邻居,需要这样的信息。我们证明,我们的规则保证收敛到真实的状态几乎可以肯定,尽管稀疏的通信指数快速,它有可能显着减少信息流的信息代理。接下来,为了处理有限精度的通信信道,我们提出了一个分布式学习规则,利用自适应量化的思想。我们表明,通过顺序地细化量化器的范围,每个代理几乎可以肯定地以指数速度学习真相,同时仅使用$1$位来编码其对每个假设的信念。对于我们提出的算法,我们严格的通信效率和学习率之间的权衡。

英文摘要:

We consider the problem of distributed inference where agents in a network observe a stream of private signals generated by an unknown state, and aim to uniquely identify this state from a finite set of hypotheses. We focus on scenarios where communication between agents is costly, and takes place over channels with finite bandwidth. To reduce the frequency of communication, we develop a novel event-triggered distributed learning rule that is based on the principle of diffusing low beliefs on each false hypothesis. Building on this principle, we design a trigger condition under which an agent broadcasts only those components of its belief vector that have adequate innovation, to only those neighbors that require such information. We prove that our rule guarantees convergence to the true state exponentially fast almost surely despite sparse communication, and that it has the potential to significantly reduce information flow from uninformative agents to informative agents. Next, to deal with finite-precision communication channels, we propose a distributed learning rule that leverages the idea of adaptive quantization. We show that by sequentially refining the range of the quantizers, every agent can learn the truth exponentially fast almost surely, while using just $1$ bit to encode its belief on each hypothesis. For both our proposed algorithms, we rigorously characterize the trade-offs between communication-efficiency and the learning rate.

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

↑