AI & ML
On Minimum Divergence for Distribution Reconstruction
arXiv math.IT0 views
arXiv:2610.21872v1 Announce Type: cross Abstract: We study the possibility of generalizing maximum-entropy reconstruction, which approximately recovers a probability distribution from finitely many (generalized) moments by minimizing the Kullback--Leibler (KL) divergence to a reference measure. The reconstruction lies in an exponential family and is also the best KL approximation of the unknown distribution within that family: moment matching and information projection coincide. Replacing KL by a smooth f-divergence, the reconstruction still exists in an associated family, but the best approximation property does not. Specifically, a family is called entropy-adapted if the projection of any distribution matches its moments. We show that, up to equivalence, KL is the only $C^2$ f-divergence that is entropy-adapted, whatever the choice of the generalized moments. We illustrate the consequences of this failure numerically.
Source:https://arxiv.org/abs/2610.21872PreviousControlled-Memory Identification with Shared Generators: Dimension--Horizon Tradeoffs and Quantum--Classical SeparationNextOne generation of the Standard Model as a quantum error-correcting code
Related posts
Shutting the Door on the XCPE Botnet (Threat Intelligence)
0LWN.net

Canva Brings Free All-in-One Affinity App to iPad
0MacRumors
GPT-Rosalind-6 System Card Addendum
0Hacker News New
Mediroute: An open-source AI platform exposing global drug price disparities
0Hacker News New
An intuition for how neural nets can understand text
0Hacker News New
An open LLM read 291 retracted papers: 7.7% of passages mention the retraction
0Hacker News New