Completely Monotone Outer Approximations of Lower Probabilities on Finite Possibility Spaces
Drawing inferences from general lower probabilities on finite possibility spaces usually involves solving linear programming problems. For some applications this may be too computationally demanding. Some special classes of lower probabilities allow for using computationally less demanding techniques. One such class is formed by the completely monotone lower probabilities, for which inferences can be drawn efficiently once their Möbius transform has been calculated. One option is therefore to draw approximate inferences by using a completely monotone approximation to a general lower probability; this must be an outer approximation to avoid drawing inferences that are not implied by the approximated lower probability. In this paper, we discuss existing and new algorithms for performing this approximation, discuss their relative strengths and weaknesses, and illustrate how each one works and performs.
Keywordslower probabilities Outer approximation Complete monotonicity Belief functions Möbius transform
Unable to display preview. Download preview PDF.
- 6.Quaeghebeur, E.: Learning from samples using coherent lower previsions. PhD thesis, Ghent University (2009), http://hdl.handle.net/1854/LU-495650
- 7.Quaeghebeur, E.: Characterizing the set of coherent lower previsions with a finite number of constraints or vertices. In: Spirtes, P., Grünwald, P. (eds.) Proceedings of UAI 2010, pp. 466–473. AUAI Press (2010), http://hdl.handle.net/1854/LU-984156