基于二叉决策图的0-1整数规划的有效消息传递
Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams
摘要：
提出了一种0-1整数线性规划的消息传递方法。我们的算法是基于分解成子问题，表示为二元决策图的原始问题。由此产生的拉格朗日对偶迭代求解一系列有效的块坐标上升步骤。我们的方法在分解的大小上具有线性迭代复杂度，并且可以有效地并行化。我们的方法的特点是可取的解决结构化预测中出现的更大的问题。我们目前的实验结果，从MAP推理马尔可夫随机场，二次分配，离散断层扫描和细胞跟踪发育生物学的组合问题，并表现出良好的性能。
英文摘要：
We present a message passing method for 0-1 integer linear programs. Our algorithm is based on a decomposition of the original problem into subproblems that are represented as binary decision diagrams. The resulting Lagrangean dual is solved iteratively by a series of efficient block coordinate ascent steps. Our method has linear iteration complexity in the size of the decomposition and can be effectively parallelized. The characteristics of our approach are desirable towards solving ever larger problems arising in structured prediction. We present experimental results on combinatorial problems from MAP inference for Markov Random Fields, quadratic assignment, discrete tomography and cell tracking for developmental biology and show promising performance.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
