## Linear Programs for Hypotheses Selection in Probabilistic Inference Models

** Anders Bergkvist, Peter Damaschke, Marcel Lüthi**; 7(Jul):1339--1355, 2006.

### Abstract

We consider an optimization problem in probabilistic inference: Given*n*hypotheses

*H*,

_{j}*m*possible observations

*O*, their conditional probabilities

_{k}*p*, and a particular

_{kj}*O*, select a possibly small subset of hypotheses excluding the true target only with some error probability ε. After specifying the optimization goal we show that this problem can be solved through a linear program in

_{k}*mn*variables that indicate the probabilities to discard a hypothesis given an observation. Moreover, we can compute optimal strategies where only

*O(m+n)*of these variables get fractional values. The manageable size of the linear programs and the mostly deterministic shape of optimal strategies makes the method practicable. We interpret the dual variables as worst-case distributions of hypotheses, and we point out some counterintuitive nonmonotonic behaviour of the variables as a function of the error bound ε. One of the open problems is the existence of a purely combinatorial algorithm that is faster than generic linear programming.

[abs][pdf]