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

影响图的连接树多面体的整数规划

Integer programming on the junction tree polytope for influence diagrams

Axel Parmentier, Victor Cohen, Vincent Leclère, Guillaume Obozinski, Joseph Salmon

摘要:

影响图(ID)是表示离散随机最优化问题的灵活工具,包括作为标准示例的马尔可夫决策过程(MDP)和部分可观测MDP。更确切地说,给定随机变量被认为是无环有向图的顶点,概率图模型通过给定其父节点的顶点的条件分布来定义联合分布。在ID中,随机变量由概率图模型表示,其顶点被划分为三种类型:机会,决策和效用顶点。用户有条件地选择决策顶点到其父节点的分布,以最大化期望效用。利用有根连接树的概念,我们提出了一个混合整数线性制定解决的ID,以及有效的不等式,从而导致计算效率的算法。我们还表明,线性松弛产生一个最佳的整数解的情况下,可以解决的“单一的政策更新”,解决ID的默认算法。

英文摘要:

Influence Diagrams (ID) are a flexible tool to represent discrete stochastic optimization problems, including Markov Decision Process (MDP) and Partially Observable MDP as standard examples. More precisely, given random variables considered as vertices of an acyclic digraph, a probabilistic graphical model defines a joint distribution via the conditional distributions of vertices given their parents. In ID, the random variables are represented by a probabilistic graphical model whose vertices are partitioned into three types : chance, decision and utility vertices. The user chooses the distribution of the decision vertices conditionally to their parents in order to maximize the expected utility. Leveraging the notion of rooted junction tree, we present a mixed integer linear formulation for solving an ID, as well as valid inequalities, which lead to a computationally efficient algorithm. We also show that the linear relaxation yields an optimal integer solution for instances that can be solved by the "single policy update", the default algorithm for addressing IDs.

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

↑