Bregman meets Lévy: Stochastic Mirror Descent with Heavy-Tailed Noise in Continuous and Discrete Time
Pierre-Louis Cauvin, Panayotis Mertikopoulos
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper23
- Why are Adaptive Methods Good for Attention Models?Jingzhao Zhang, Sai Praneeth Karimireddy, Andreas Veit, Seungyeon Kim 等NeurIPS 2020 · 被引用 397 次
- Towards Theoretically Understanding Why Sgd Generalizes Better Than Adam in Deep LearningPan Zhou, Jiashi Feng, Chao Ma, Caiming Xiong 等NeurIPS 2020 · 被引用 309 次
- The Heavy-Tail Phenomenon in SGDMert Gürbüzbalaban, Umut Simsekli, Lingjiong ZhuICML 2021 · 被引用 165 次
- A Diffusion Theory For Deep Learning Dynamics: Stochastic Gradient Descent Exponentially Favors Flat MinimaZeke Xie, Issei Sato, Masashi SugiyamaICLR 2021 · 被引用 165 次
- High-probability Bounds for Non-Convex Stochastic Optimization with Heavy TailsAshok Cutkosky, Harsh MehtaNeurIPS 2021 · 被引用 119 次
相关 Paper
- Convergence Rates of Stochastic Gradient Descent under Infinite Noise VarianceHongjian Wang, Mert Gürbüzbalaban, Lingjiong Zhu, Umut Simsekli 等NeurIPS 2021 · 被引用 57 次
- Robustness Analysis of Non-Convex Stochastic Gradient Descent using Biased ExpectationsKevin Scaman, Cédric MalherbeNeurIPS 2020 · 被引用 37 次
- 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 次
- Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity LimitsAbdurakhmon Sadiev, Peter Richtárik, Ilyas FatkhullinNeurIPS 2025 · 被引用 4 次
