Copertina

Distributed Stochastic Optimization under Heavy-Tailed Noise: A Federated Mirror Descent Approach with High Probability Convergence

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Yu, Zhan, Liao, Lan, Yuan, Deming, Ho, Daniel W. C., Zhou, Ding-Xuan
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

High-Probability Convergence Theory for Distributed Composite Optimization with Sub-Weibull Noises
di: Yu, Zhan, et al.
Pubblicazione: (2025)

High Probability Convergence of Distributed Clipped Stochastic Gradient Descent with Heavy-tailed Noise
di: Yang, Yuchen, et al.
Pubblicazione: (2025)

Distributed Stochastic Optimization under Heavy-Tailed Noises
di: Sun, Chao, et al.
Pubblicazione: (2023)

High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise
di: Gorbunov, Eduard, et al.
Pubblicazione: (2023)

Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping
di: Liu, Zijian, et al.
Pubblicazione: (2024)

High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise
di: Gorbunov, Eduard, et al.
Pubblicazione: (2021)

In-Expectation Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise
di: Liu, Zijian
Pubblicazione: (2026)

Algorithmic Stability of Stochastic Gradient Descent with Momentum under Heavy-Tailed Noise
di: Dang, Thanh, et al.
Pubblicazione: (2025)

Distributed Stochastic Optimization for Non-Smooth and Weakly Convex Problems under Heavy-Tailed Noise
di: Hu, Jun, et al.
Pubblicazione: (2025)

Distributed Stochastic Block Coordinate Descent for Time-Varying Multi-Agent Optimization
di: Yu, Zhan, et al.
Pubblicazione: (2019)

High Probability Convergence Bounds for Non-convex Stochastic Gradient Descent with Sub-Weibull Noise
di: Madden, Liam, et al.
Pubblicazione: (2020)

Optimal Asynchronous Stochastic Nonconvex Optimization under Heavy-Tailed Noise
di: Wu, Yidong, et al.
Pubblicazione: (2026)

High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise
di: Parletta, Daniela A., et al.
Pubblicazione: (2022)

Stochastic Zeroth-Order Optimization Under Heavy-Tailed Noise
di: Bakkali, Taha El, et al.
Pubblicazione: (2026)

Decentralized Nonconvex Optimization under Heavy-Tailed Noise: Normalization and Optimal Convergence
di: Yu, Shuhua, et al.
Pubblicazione: (2025)

Sharp High-Probability Rates for Nonlinear SGD under Heavy-Tailed Noise via Symmetrization
di: Armacki, Aleksandar, et al.
Pubblicazione: (2025)

Generic Frameworks for Distributed Functional Optimization and Learning over Time-Varying Networks
di: Yu, Zhan, et al.
Pubblicazione: (2025)

Implicit Bias and Convergence of Matrix Stochastic Mirror Descent
di: Akhtiamov, Danil, et al.
Pubblicazione: (2026)

Stochastic Weakly Convex Optimization Under Heavy-Tailed Noises
di: Zhu, Tianxi, et al.
Pubblicazione: (2025)

High-probability Convergence Bounds for Nonlinear Stochastic Gradient Descent Under Heavy-tailed Noise
di: Armacki, Aleksandar, et al.
Pubblicazione: (2023)

Near-Optimal Decentralized Stochastic Nonconvex Optimization with Heavy-Tailed Noise
di: Wang, Menglian, et al.
Pubblicazione: (2026)

An Improved Analysis of the Clipped Stochastic subGradient Method under Heavy-Tailed Noise
di: Parletta, Daniela Angela, et al.
Pubblicazione: (2024)

High Probability Complexity Bounds of Trust-Region Stochastic Sequential Quadratic Programming with Heavy-Tailed Noise
di: Fang, Yuchen, et al.
Pubblicazione: (2025)

Can SGD Handle Heavy-Tailed Noise?
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2025)

Tight Lower Bounds and Optimal Algorithms for Stochastic Nonconvex Optimization with Heavy-Tailed Noise
di: Fradin, Adrien, et al.
Pubblicazione: (2025)

Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems
di: Puchkin, Nikita, et al.
Pubblicazione: (2023)

Almost Sure Convergence and Non-asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm
di: Paul, Anik Kumar, et al.
Pubblicazione: (2024)

Stochastic Mirror Descent under Iterate-Dependent Markov Noise: Analysis in the Asymptotic and Finite Time Regimes
di: Paul, Anik Kumar, et al.
Pubblicazione: (2026)

Muon Converges under Heavy-Tailed Noise: Nonconvex Hölder-Smooth Empirical Risk Minimization
di: Iiduka, Hideaki
Pubblicazione: (2026)

Accelerated Convergence of Stochastic Heavy Ball Method under Anisotropic Gradient Noise
di: Pan, Rui, et al.
Pubblicazione: (2023)

Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses under Single and Multiple Consensus Steps
di: Zhang, Wentao, et al.
Pubblicazione: (2025)

Convergence of Clipped-SGD for Convex $(L_0,L_1)$-Smooth Optimization with Heavy-Tailed Noise
di: Chezhegov, Savelii, et al.
Pubblicazione: (2025)

On the Convergence of Policy in Unregularized Policy Mirror Descent
di: Lin, Dachao, et al.
Pubblicazione: (2022)

Convergence Analysis of Stochastic Saddle Point Mirror Descent Algorithm -- A Projected Dynamical View Point
di: Paul, Anik Kumar, et al.
Pubblicazione: (2024)

Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad
di: Liu, Zijian
Pubblicazione: (2026)

Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness
di: Kornilov, Nikita, et al.
Pubblicazione: (2025)

Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise
di: Agrawal, Shubhada, et al.
Pubblicazione: (2026)

Value Mirror Descent for Reinforcement Learning
di: Jia, Zhichao, et al.
Pubblicazione: (2026)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
di: Yuan, Bowen, et al.
Pubblicazione: (2025)

High-Probability Guarantees for Random Zeroth-Order (Stochastic) Gradient Descent
di: Ye, Haishan
Pubblicazione: (2026)