2000 character limit reached
Maximizing the Bregman divergence from a Bregman family
Published 23 Jan 2020 in cs.IT and math.IT | (2001.08813v1)
Abstract: The problem to maximize the information divergence from an exponential family is generalized to the setting of Bregman divergences and suitably defined Bregman families.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.