arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.6214cs.CEcs.LGmath.OC
收藏

鲁棒最大乘积置信传播

Robust Max-Product Belief Propagation

Stanford University(斯坦福大学)

Morteza Ibrahimi, Adel Javanmard, Yashodhan Kanoria, Andrea Montanari

摘要:

研究了图结构目标函数在\emph{adversarial}不确定性下的优化问题。这个问题可以被建模为工程师和自然之间的两人零和博弈。工程师控制变量的子集(图中的节点),并尝试分配它们的值以最大化目标函数。自然控制着变量的互补子集,并试图最小化同一目标。这种设置包括模型不确定性下的估计和优化问题,以及具有图结构的战略问题。冯·诺依曼的极大极小定理保证了一对随机策略的存在,为每个参与者提供了最佳的鲁棒性。在图结构支付函数的情况下,我们证明了这种策略对的几个结构性质。特别地,随机化极大极小策略(变量分配上的分布)可以以这样的方式选择,以满足关于图的马尔可夫性质。这大大降低了问题的维度。最后,我们引入了一个消息传递算法来解决这个极大极小问题。该算法将最大乘积置信传播推广到这个新的领域。

英文摘要:

We study the problem of optimizing a graph-structured objective function under \emph{adversarial} uncertainty. This problem can be modeled as a two-persons zero-sum game between an Engineer and Nature. The Engineer controls a subset of the variables (nodes in the graph), and tries to assign their values to maximize an objective function. Nature controls the complementary subset of variables and tries to minimize the same objective. This setting encompasses estimation and optimization problems under model uncertainty, and strategic problems with a graph structure. Von Neumann's minimax theorem guarantees the existence of a (minimax) pair of randomized strategies that provide optimal robustness for each player against its adversary. We prove several structural properties of this strategy pair in the case of graph-structured payoff function. In particular, the randomized minimax strategies (distributions over variable assignments) can be chosen in such a way to satisfy the Markov property with respect to the graph. This significantly reduces the problem dimensionality. Finally we introduce a message passing algorithm to solve this minimax problem. The algorithm generalizes max-product belief propagation to this new domain.

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

↑