Optimal Value of Information in Graphical Models

01/15/2014
by   Andreas Krause, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/04/2012

Near-optimal Nonmyopic Value of Information in Graphical Models

A fundamental issue in real-world systems, such as sensor networks, is t...
research
09/18/2019

Value of Information in Probabilistic Logic Programs

In medical decision making, we have to choose among several expensive di...
research
04/30/2022

Approximating Permutations with Neural Network Components for Travelling Photographer Problem

Many of current inference techniques rely upon Bayesian inference on Pro...
research
03/27/2013

The Compilation of Decision Models

We introduce and analyze the problem of the compilation of decision mode...
research
03/20/2013

An Approximate Nonmyopic Computation for Value of Information

Value-of-information analyses provide a straightforward means for select...
research
01/20/2012

Dynamic Decision Making for Graphical Models Applied to Oil Exploration

This paper has been withdrawn by the authors. We present a framework for...
research
02/20/2021

Necessary and sufficient conditions for optimal adjustment sets in causal graphical models with hidden variables

The problem of selecting optimal valid backdoor adjustment sets to estim...

Please sign up or login with your details

Forgot password? Click here to reset