arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2311.01032cs.ITmath.IT
收藏

面向树状网络的去中心化广义近似消息传递

Decentralized Generalized Approximate Message-Passing for Tree-Structured Networks

Keigo Takeuchi

AI总结:

针对树状网络中的分布式压缩感知问题,提出了去中心化广义近似消息传递(GAMP),利用共识传播实现局部通信,并证明了其状态演化递归与集中式GAMP具有相同的贝叶斯最优固定点。

摘要:

针对树状网络中由分布式广义线性测量实现的压缩感知问题,提出了去中心化广义近似消息传递(GAMP)。通过相邻节点间的局部通信,利用共识传播实现了GAMP所需的平均共识。去中心化GAMP适用于所有树状网络,这些网络不一定具有连接所有其他节点的中心节点。对于零均值独立同分布高斯传感矩阵,使用状态演化分析了去中心化GAMP的渐近动态特性。当考虑所有节点具有相同维度的同质测量时,证明了去中心化GAMP的状态演化递归与集中式GAMP具有相同的固定点。此外,利用现有的长记忆证明策略,证明了带有贝叶斯最优去噪器的去中心化GAMP的状态演化递归收敛到一个固定点。这些结果意味着,当固定点唯一时,带有贝叶斯最优去噪器的去中心化GAMP的状态演化递归在处理同质测量时收敛到贝叶斯最优固定点。给出了线性测量和削波情况下去中心化GAMP的数值结果。作为树状网络的示例,考虑了一维链状网络和无中心节点的树状网络。

英文摘要:

Decentralized generalized approximate message-passing (GAMP) is proposed for compressed sensing from distributed generalized linear measurements in a tree-structured network. Consensus propagation is used to realize average consensus required in GAMP via local communications between adjacent nodes. Decentralized GAMP is applicable to all tree-structured networks that do not necessarily have central nodes connected to all other nodes. State evolution is used to analyze the asymptotic dynamics of decentralized GAMP for zero-mean independent and identically distributed Gaussian sensing matrices. The state evolution recursion for decentralized GAMP is proved to have the same fixed points as that for centralized GAMP when homogeneous measurements with an identical dimension in all nodes are considered. Furthermore, existing long-memory proof strategy is used to prove that the state evolution recursion for decentralized GAMP with the Bayes-optimal denoisers converges to a fixed point. These results imply that the state evolution recursion for decentralized GAMP with the Bayes-optimal denoisers converges to the Bayes-optimal fixed point for the homogeneous measurements when the fixed point is unique. Numerical results for decentralized GAMP are presented in the cases of linear measurements and clipping. As examples of tree-structured networks, a one-dimensional chain and a tree with no central nodes are considered.

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

↑