CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Ranking hypotheses to minimize the search cost in probabilistic inference models

Peter Damaschke (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers))
Discrete Applied Mathematics (0166-218X). Vol. 157 (2009), p. 1218-1228.
[Artikel, refereegranskad vetenskaplig]

Suppose that we are given n mutually exclusive hypotheses, m mutually exclusive possible observations, the conditional probabilities for each of these observations under each hypothesis, and a method to probe each hypothesis whether it is the true one. We consider the problem of efficient searching for the true (target) hypothesis given a particular observation. Our objective is to minimize the expected search cost for a large number of instances, and for the worst-case distribution of targets. More precisely, we wish to rank the hypotheses so that probing them in the chosen order is optimal in this sense. Costs grow monotonic with the number of probes. While it is straightforward to formulate this problem as a linear program, we can solve it in polynomial time only after a certain reformulation: We introduce so-called rank variables and arrive at another linear program whose solution can be translated afterwards into an optimal mixed strategy of low description complexity: For each observation, at most n rankings, i.e., permutations of hypotheses, appear with positive probabilities. Dimensionality arguments yield further combinatorial bounds. Possible applications of the optimization goal are discussed.

Nyckelord: probabilistic inference, searching, ranking, mixed strategy, linear programming, polytopes



Denna post skapades 2009-03-23. Senast ändrad 2015-02-11.
CPL Pubid: 91788