Abstract:
The mathematical problem addressed is minimising the expectation of a random variable over a set of feasible distributions P ∊ Γ, given as a level set of a convex integra...Show MoreMetadata
Abstract:
The mathematical problem addressed is minimising the expectation of a random variable over a set of feasible distributions P ∊ Γ, given as a level set of a convex integral functional. As special cases, Γ may be an f-divergence or f-divergence ball or a Bregman ball around a default distribution. Our approach is motivated by geometric intuition and relies upon the theory of minimising convex integral functionals subject to moment constraints. One main result is that all “almost minimisers” P ∊ Γ belong to a small Bregman ball around a specified distribution or defective distribution P, equal to the strict minimiser if that exists but well defined also otherwise.
Published in: 2013 IEEE International Symposium on Information Theory
Date of Conference: 07-12 July 2013
Date Added to IEEE Xplore: 07 October 2013
Electronic ISBN:978-1-4799-0446-4
ISSN Information:
Related Articles are not available for this document.