arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.3474cs.AI
收藏

图模型中信息的最优值

Optimal Value of Information in Graphical Models

California Institute of Technology(加州理工学院);Carnegie Mellon University(卡内基梅隆大学)

Andreas Krause, Carlos Guestrin

摘要:

许多现实世界的决策任务要求我们在几个昂贵的观察中进行选择。例如,在传感器网络中,重要的是选择预期提供最强的不确定性降低的传感器子集。在医疗决策任务中,人们需要在决定最有效的治疗方法之前选择进行哪些测试。一般的做法是使用经验指导的程序来选择观测值。在本文中,我们提出了第一个有效的最优算法选择观测的一类概率图模型。例如,我们的算法允许最佳标记隐马尔可夫模型(HALGOT)中的隐藏变量。我们提供的结果选择最佳的观测子集,并获得最佳的条件观测计划。此外,我们证明了一个令人惊讶的结果:在大多数图形模型的任务,如果一个设计一个有效的算法链图,如HALTH,这个过程可以推广到多边形树图形模型。我们证明了信息的优化值是$NP^{PP}$ -困难的,即使是多树。从我们的结果还可以看出,即使在朴素贝叶斯模型(一个简单的特殊情况下的多叉树)上,仅仅计算信息目标函数的决策理论值(这是在实践中常用的)也是一个P-完全问题。此外,我们考虑几个扩展,如使用我们的算法调度多个传感器的观测选择。我们证明了我们的方法在几个现实世界的数据集,包括原型传感器网络部署的建筑物节能的有效性。

英文摘要:

Many real-world decision making tasks require us to choose among several expensive observations. In a sensor network, for example, it is important to select the subset of sensors that is expected to provide the strongest reduction in uncertainty. In medical decision making tasks, one needs to select which tests to administer before deciding on the most effective treatment. It has been general practice to use heuristic-guided procedures for selecting observations. In this paper, we present the first efficient optimal algorithms for selecting observations for a class of probabilistic graphical models. For example, our algorithms allow to optimally label hidden variables in Hidden Markov Models (HMMs). We provide results for both selecting the optimal subset of observations, and for obtaining an optimal conditional observation plan. Furthermore we prove a surprising result: In most graphical models tasks, if one designs an efficient algorithm for chain graphs, such as HMMs, this procedure can be generalized to polytree graphical models. We prove that the optimizing value of information is $NP^{PP}$-hard even for polytrees. It also follows from our results that just computing decision theoretic value of information objective functions, which are commonly used in practice, is a #P-complete problem even on Naive Bayes models (a simple special case of polytrees). In addition, we consider several extensions, such as using our algorithms for scheduling observation selection for multiple sensors. We demonstrate the effectiveness of our approach on several real-world datasets, including a prototype sensor network deployment for energy conservation in buildings.

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

↑