arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1911.02111math.OC
收藏

基于类牛顿神经网络动力学的分布式资源分配

Distributed Resource Allocation with Binary Decisions via Newton-like Neural Network Dynamics

Tor Anderson, Sonia Martinez

摘要:

本文旨在解决一个具有二元局部约束的分布式资源分配问题。该问题被制定为一个二进制程序的费用函数定义的总和代理成本加上全球失配/惩罚条款。我们提出了一种修改的Hopfield神经网络(HNN)动力学,以解决这个问题,同时将一个新的牛顿样的权重因子。这种添加有助于快速避免鞍点,这是梯度类HNN容易受到的。转向多代理设置,我们重新制定的问题,并开发一个分布式实现的牛顿式的动态。我们表明,如果一个本地解决方案的分布式重组获得,它也是一个本地解决方案的集中式问题。这项工作的一个主要贡献是表明,收敛到一个适当定义的能量函数的鞍点的概率在集中式和分布式的设置是零下轻的假设。最后,我们扩大我们的算法与退火技术,逐步学习一个可行的二进制解决方案。仿真结果表明,所提出的方法与集中式贪婪和SDP松弛方法的解决方案的质量方面的竞争力,而我们的方法的主要优点是一个显着的改善,在运行时间比SDP松弛法和分布式质量的实施。

英文摘要:

This paper aims to solve a distributed resource allocation problem with binary local constraints. The problem is formulated as a binary program with a cost function defined by the summation of agent costs plus a global mismatch/penalty term. We propose a modification of the Hopfield Neural Network (HNN) dynamics in order to solve this problem while incorporating a novel Newton-like weighting factor. This addition lends itself to fast avoidance of saddle points, which the gradient-like HNN is susceptible to. Turning to a multi-agent setting, we reformulate the problem and develop a distributed implementation of the Newton-like dynamics. We show that if a local solution to the distributed reformulation is obtained, it is also a local solution to the centralized problem. A main contribution of this work is to show that the probability of converging to a saddle point of an appropriately defined energy function in both the centralized and distributed settings is zero under light assumptions. Finally, we enlarge our algorithm with an annealing technique which gradually learns a feasible binary solution. Simulation results demonstrate that the proposed methods are competitive with centralized greedy and SDP relaxation approaches in terms of solution quality, while the main advantage of our approach is a significant improvement in runtime over the SDP relaxation method and the distributed quality of implementation.

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

↑