Bregman meets Lévy: Stochastic Mirror Descent with Heavy-Tailed Noise in Continuous and Discrete Time
Pierre-Louis Cauvin, Panayotis Mertikopoulos
Abstract
We study the robustness of stochastic mirror descent (SMD) under heavy-tailed noise, focusing on whether the method retains its convergence guarantees when run with infinite-variance stochastic gradient input. To address this question in a principled manner, we begin by introducing a continuous-time model of SMD as a stochastic differential equation (SDE) driven by a centered Lévy noise process with finite -th order moments, . This scheme—which we call the Lévy mirror flow (LMF)—arises naturally as the scaling limit of SMD in the presence of heavy-tailed noise. In particular, when —the heavy noise regime—the trajectories of LMF generically exhibit jump discontinuities of arbitrary magnitude which, if frequent enough, lead to infinite variance. Nonetheless, despite this highly singular behavior, we show that LMF attains -optimality within time in the convex case, and within time for (relatively) strongly convex objectives. These guarantees provide a transparent characterization of the impact of frequent long jumps on the convergence of the process, and percolate to a series of matching discrete-time guarantees for several variants of SMD under heavy-tailed noise.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 94f00edb-25cd-4e1c-bb7d-7e5059243975Builds on23
- Why are Adaptive Methods Good for Attention Models?Jingzhao Zhang, Sai Praneeth Karimireddy, Andreas Veit, Seungyeon Kim et al.NeurIPS 2020 · 397 citations
- Towards Theoretically Understanding Why Sgd Generalizes Better Than Adam in Deep LearningPan Zhou, Jiashi Feng, Chao Ma, Caiming Xiong et al.NeurIPS 2020 · 309 citations
- The Heavy-Tail Phenomenon in SGDMert Gürbüzbalaban, Umut Simsekli, Lingjiong ZhuICML 2021 · 165 citations
- A Diffusion Theory For Deep Learning Dynamics: Stochastic Gradient Descent Exponentially Favors Flat MinimaZeke Xie, Issei Sato, Masashi SugiyamaICLR 2021 · 165 citations
- High-probability Bounds for Non-Convex Stochastic Optimization with Heavy TailsAshok Cutkosky, Harsh MehtaNeurIPS 2021 · 119 citations
Related papers
- Convergence Rates of Stochastic Gradient Descent under Infinite Noise VarianceHongjian Wang, Mert Gürbüzbalaban, Lingjiong Zhu, Umut Simsekli et al.NeurIPS 2021 · 57 citations
- Robustness Analysis of Non-Convex Stochastic Gradient Descent using Biased ExpectationsKevin Scaman, Cédric MalherbeNeurIPS 2020 · 37 citations
- Stochastic Gradient Methods under Heavy-Tailed Noises in Weakly Convex OptimizationTianxi Zhu, Yi Xu, Qi Wang, Xiangyang JiICML 2026
- Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tailed NoiseTa Duy Nguyen, Thien Hang Nguyen, Alina Ene, Huy L. NguyenNeurIPS 2023 · 65 citations
- Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity LimitsAbdurakhmon Sadiev, Peter Richtárik, Ilyas FatkhullinNeurIPS 2025 · 4 citations
