2000 character limit reached
Convex Optimization on Functionals of Probability Densities
Published 16 Feb 2020 in cs.IT, cs.LG, and math.IT | (2002.06488v2)
Abstract: In information theory, some optimization problems result in convex optimization problems on strictly convex functionals of probability densities. In this note, we study these problems and show conditions of minimizers and the uniqueness of the minimizer if there exist a minimizer.
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.