Abstract
This paper investigates maximizers of the information divergence from an exponential family . It is shown that the -projection of a maximizer to is a convex combination of and a probability measure with disjoint support and the same value of the sufficient statistics . This observation can be used to transform the original problem of maximizing over the set of all probability measures into the maximization of a function $\Dbar$ over a convex subset of . The global maximizers of both problems correspond to each other. Furthermore, finding all local maximizers of $\Dbar$ yields all local maximizers of . This paper also proposes two algorithms to find the maximizers of $\Dbar$ and applies them to two examples, where the maximizers of were not known before.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.