Cover Image

Online Distributed Optimization with Clipped Stochastic Gradients: High Probability Bound of Regrets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Yuchen, Lu, Kaihong, Wang, Long
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Distributed Optimization Algorithm with Superlinear Convergence Rate
by: Xu, Yeming, et al.
Published: (2024)

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

Clipped Stochastic Gradient Tracking For Locally Smooth Functions
by: Mei, Leilei, et al.
Published: (2026)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

Improved Dynamic Regret of Distributed Online Multiple Frank-Wolfe Convex Optimization
by: Zhang, Wentao, et al.
Published: (2023)

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

Differentially Private Clipped-SGD: High-Probability Convergence with Arbitrary Clipping Level
by: Khah, Saleh Vatan, et al.
Published: (2025)

Revisiting Regret Benchmarks in Online Non-Stochastic Control
by: Hebbar, Vijeth, et al.
Published: (2025)

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

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

High-Probability Convergence in Decentralized Stochastic Optimization with Gradient Tracking
by: Armacki, Aleksandar, et al.
Published: (2026)

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

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

Robust Accelerated Adaptive Search: High-Probability Complexity Bounds under Bounded-Moment Stochastic Oracles
by: Zhang, Shunzhi, et al.
Published: (2026)

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

S-DIGing: A Stochastic Gradient Tracking Algorithm for Distributed Optimization
by: Li, Huaqing, et al.
Published: (2019)

Distributed Adaptive Gradient Algorithm with Gradient Tracking for Stochastic Non-Convex Optimization
by: Han, Dongyu, et al.
Published: (2024)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
by: Tarzanagh, Davoud Ataee, et al.
Published: (2022)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
by: Sahinoglu, Emre, et al.
Published: (2025)

Time-Varying Multi-Objective Optimization: Tradeoff Regret Bounds
by: Shafiei, Allahkaram, et al.
Published: (2022)

Online Mixed Discrete and Continuous Optimization: Algorithms, Regret Analysis and Applications
by: Ye, Lintao, et al.
Published: (2023)

Distributed Stochastic Optimization under Heavy-Tailed Noise: A Federated Mirror Descent Approach with High Probability Convergence
by: Yu, Zhan, et al.
Published: (2025)

A Communication-Efficient Stochastic Gradient Descent Algorithm for Distributed Nonconvex Optimization
by: Xie, Antai, et al.
Published: (2024)

Distributed Online Randomized Gradient-Free Optimization with Compressed Communication
by: Zhu, Longkang, et al.
Published: (2025)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)

Negative Curvature Methods with High-Probability Complexity Guarantees for Stochastic Nonconvex Optimization
by: Berahas, Albert S., et al.
Published: (2026)

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

A Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization
by: Zhu, Yuchen, et al.
Published: (2024)

A Sequential Quadratic Programming Method with High Probability Complexity Bounds for Nonlinear Equality Constrained Stochastic Optimization
by: Berahas, Albert S., et al.
Published: (2023)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
by: Hua, Youqing, et al.
Published: (2024)

A Fundamental Convergence Rate Bound for Gradient Based Online Optimization Algorithms with Exact Tracking
by: Wu, Alex Xinting, et al.
Published: (2025)

Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds
by: Gürbüzbalaban, Mert, et al.
Published: (2025)

Wasserstein Distributionally Robust Regret Optimization
by: Fiechtner, Lukas-Benedikt, et al.
Published: (2025)

Stochastic Adaptive Optimization with Unreliable Inputs: A Unified Framework for High-Probability Complexity Analysis
by: Scheinberg, Katya, et al.
Published: (2025)

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

Local Differential Privacy via Dynamic Quantization in Distributed Online Stochastic Optimization
by: Zhang, Zhiguo, et al.
Published: (2026)

Distributed Riemannian Stochastic Gradient Tracking Algorithm on the Stiefel Manifold
by: Zhao, Jishu, et al.
Published: (2024)

(Corrected Version) Push-LSVRG-UP: Distributed Stochastic Optimization over Unbalanced Directed Networks with Uncoordinated Triggered Probabilities
by: Hu, Jinhui, et al.
Published: (2023)