arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.6160cond-mat.stat-mechcs.DCcs.DS
收藏

消息传递随机优化

Stochastic optimization by message passing

Fabrizio Altarelli, Alfredo Braunstein, Abolfazl Ramezanpour, Riccardo Zecchina

摘要:

应用科学中的大多数优化问题实际上涉及定义成本函数的参数的不确定性,其中只有统计信息是已知的。在最近的工作中,我们介绍了一个消息传递算法的基础上统计物理的腔方法来解决两阶段匹配问题的独立分布的随机参数。在本文中,我们提供了一个深入的解释的一般方法和警告,显示细节的推导和由此产生的算法的匹配问题,并将其应用到一个随机版本的独立集问题,这是一个计算困难和相关的问题,在通信网络。我们将结果与一些贪婪算法进行了比较,并简要讨论了对更复杂的随机多阶段问题的扩展。

英文摘要:

Most optimization problems in applied sciences realistically involve uncertainty in the parameters defining the cost function, of which only statistical information is known beforehand. In a recent work we introduced a message passing algorithm based on the cavity method of statistical physics to solve the two-stage matching problem with independently distributed stochastic parameters. In this paper we provide an in-depth explanation of the general method and caveats, show the details of the derivation and resulting algorithm for the matching problem and apply it to a stochastic version of the independent set problem, which is a computationally hard and relevant problem in communication networks. We compare the results with some greedy algorithms and briefly discuss the extension to more complicated stochastic multi-stage problems.

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

↑