arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.16717cs.ITcs.NImath.IT
收藏

公共信息在计算函数中的应用

Applications of Common Information to Computing Functions

Derya Malak

摘要:

我们设计了一个低复杂度的分布式压缩方案,用于计算离散字母源的任意函数。我们使用一个基于助手的方法,扩展的定义的G{á}cs-K{<$}rner-Witsenhausen(GKW)的公共信息的功能性公共信息。该辅助器通过将联合源分布划分为由函数施加的嵌套来放松GKW的组合结构,这确保了源之间的分层合作,以有效地进行分布式计算。通过对比我们的方法的性能与现有的高效技术,我们证明了恢复功能和源数据的速率节省。置换不变函数广泛应用于学习和组合优化领域,最近被应用于图神经网络。我们考虑了在两个源和一个解码器的网络中计算置换不变函数的有效压缩。我们使用二分图表示,其中两个不相交的顶点集(部分)表示各个源图,边权重捕获联合源分布。我们通过创建由函数的分布确定的连接组件,考虑边缘对称性,并消除低概率边缘来压缩二分图。我们分别对这些边缘进行编码,并将其作为细化发送。我们的方法可以取代高复杂度的联合解码技术,并通知神经网络,以减少计算时间,降低复杂度。

英文摘要:

We design a low complexity distributed compression scheme for computing arbitrary functions of sources with discrete alphabets. We use a helper-based method that extends the definition of the G{á}cs-K{ö}rner-Witsenhausen (GKW) common information to functional common information. The helper relaxes the combinatorial structure of GKW by partitioning the joint source distribution into nests imposed by the function, which ensures hierarchical cooperation between the sources for effectively distributed computing. By contrasting our approach's performance with existing efficient techniques, we demonstrate the rate savings in recovering function and source data. Permutation invariant functions are prevalent in learning and combinatorial optimization fields and most recently applied to graph neural networks. We consider the efficient compression for computing permutation invariant functions in a network with two sources and one decoder. We use a bipartite graph representation, where two disjoint sets of vertices (parts) denote the individual source graphs and the edge weights capture the joint source distribution. We compress bipartite graphs by creating connected components determined by the function's distribution, accounting for the edge symmetries, and eliminating the low probability edges. We separately encode those edges and send them as refinements. Our approach can substitute high complexity joint decoding techniques and inform neural networks to reduce the computing time and reduce complexity.

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

↑