Random tilts to find stationary points in stochastic convex optimization

arXiv:2609.17798 · math.OC, stat.ML · Submitted 2026-09-15 · Read on arXiv

math.OC, stat.ML

Submitted: 2026-09-15

Updated: 2026-09-15

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

Terminology

• Differentially Private — 3× in this paper · explained in 3 episodes
• Generalization — 2× in this paper · explained in 13 episodes
• Hilbert Space — 2× in this paper · explained in 2 episodes
• Regularization — 2× in this paper · explained in 3 episodes
• Conformal Prediction — 1× in this paper · explained in 5 episodes
• Convergence Guarantees — 1× in this paper · explained in 3 episodes
• Differential Privacy — 1× in this paper · explained in 4 episodes
• Loss Function — 1× in this paper · explained in 2 episodes

Sources

• Online conformal prediction with decaying step sizes
• Finding a stationary point of a stochastic convex problem
• Failure of uniform laws of large numbers for subdifferentials and beyond

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
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
• Petrov-Galerkin operator inference with application to stability-encouraging identification