On the Computational and Statistical Efficiency of the Empirical Maximum Entropy on the Mean Method

arXiv:2608.27705 · math.OC, cs.LG, stat.ML · Submitted 2026-08-27 · Read on arXiv

math.OC, cs.LG, stat.ML

Submitted: 2026-08-27

Updated: 2026-08-27

Comments: 39 Pages, 7 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Inverse Problem — 3× in this paper · explained in 2 episodes
• Maximum Entropy on the Mean — 2× in this paper
• Fidelity — 1× in this paper · explained in 2 episodes
• Regularization — 1× in this paper · explained in 3 episodes

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Beyond Aggregate Drift: Optimal Client-Specific Windows in Federated Learning
• Lower Bounds for Randomized Linear-Oracle Optimization over Strongly Convex Sets
• Second-Order Optimization with Asynchronous Curvature