Copertina

Asynchronous Decentralized SGD under Non-Convexity: A Block-Coordinate Descent Framework

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhou, Yijie, Pu, Shi
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Accelerating Decentralized Optimization via Overlapping Local Steps
di: Zhou, Yijie, et al.
Pubblicazione: (2026)

Asynchronous Distributed Reinforcement Learning for LQR Control via Zeroth-Order Block Coordinate Descent
di: Jing, Gangshan, et al.
Pubblicazione: (2021)

Heavy-Tail Phenomenon in Decentralized SGD
di: Gurbuzbalaban, Mert, et al.
Pubblicazione: (2022)

Dual-Delayed Asynchronous SGD for Arbitrarily Heterogeneous Data
di: Wang, Xiaolu, et al.
Pubblicazione: (2024)

Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization
di: Armacki, Aleksandar, et al.
Pubblicazione: (2026)

Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
di: Tyurin, Alexander, et al.
Pubblicazione: (2024)

A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints
di: Yuan, Ganzhao
Pubblicazione: (2023)

SLowcal-SGD: Slow Query Points Improve Local-SGD for Stochastic Convex Optimization
di: Dahan, Tehila, et al.
Pubblicazione: (2023)

Differentially Private Random Block Coordinate Descent
di: Maranjyan, Artavazd, et al.
Pubblicazione: (2024)

Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance
di: Fazla, Arda, et al.
Pubblicazione: (2026)

Birch SGD: A Tree Graph Framework for Local and Asynchronous SGD Methods
di: Tyurin, Alexander, et al.
Pubblicazione: (2025)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
di: Jiang, Ruichen, et al.
Pubblicazione: (2024)

Compressed Proximal Federated Learning for Non-Convex Composite Optimization on Heterogeneous Data
di: Qiu, Pu, et al.
Pubblicazione: (2026)

More Optimal Fractional-Order Stochastic Gradient Descent for Non-Convex Optimization Problems
di: Partohaghighi, Mohammad, et al.
Pubblicazione: (2025)

AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent
di: Surjanovic, Nikola, et al.
Pubblicazione: (2025)

High-Probability Convergence Guarantees of Decentralized SGD
di: Armacki, Aleksandar, et al.
Pubblicazione: (2025)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
di: Livni, Roi
Pubblicazione: (2024)

Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential
di: Zheng, Yuping, et al.
Pubblicazione: (2025)

Convergence of Steepest Descent and Adam under Non-Uniform Smoothness
di: Vaswani, Sharan, et al.
Pubblicazione: (2026)

Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity
di: Mahran, Ammar, et al.
Pubblicazione: (2026)

Leveraging Coordinate Momentum in SignSGD and Muon: Memory-Optimized Zero-Order
di: Petrov, Egor, et al.
Pubblicazione: (2025)

RESIST: Resilient Decentralized Learning Using Consensus Gradient Descent
di: Fang, Cheng, et al.
Pubblicazione: (2025)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
di: Kovalev, Dmitry, et al.
Pubblicazione: (2024)

Learning-Augmented Decentralized Online Convex Optimization in Networks
di: Li, Pengfei, et al.
Pubblicazione: (2023)

Fast and Accurate Estimation of Low-Rank Matrices from Noisy Measurements via Preconditioned Non-Convex Gradient Descent
di: Zhang, Gavin, et al.
Pubblicazione: (2023)

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

Ringleader ASGD: The First Asynchronous SGD with Optimal Time Complexity under Data Heterogeneity
di: Maranjyan, Artavazd, et al.
Pubblicazione: (2025)

Random Coordinate Descent on the Wasserstein Space of Probability Measures
di: Xu, Yewei, et al.
Pubblicazione: (2026)

Decentralized Stochastic Gradient Descent Ascent for Finite-Sum Minimax Problems
di: Gao, Hongchang
Pubblicazione: (2022)

Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
di: Bao, Lingchan, et al.
Pubblicazione: (2025)

Classical and Quantum Speedups for Non-Convex Optimization via Energy Conserving Descent
di: Sun, Yihang, et al.
Pubblicazione: (2026)

Non-Convex Federated Optimization under Cost-Aware Client Selection
di: Jiang, Xiaowen, et al.
Pubblicazione: (2025)

A Comprehensive Framework for Analyzing the Convergence of Adam: Bridging the Gap with SGD
di: Jin, Ruinan, et al.
Pubblicazione: (2024)

Proactive DP: A Multple Target Optimization Framework for DP-SGD
di: van Dijk, Marten, et al.
Pubblicazione: (2021)

Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization
di: Vansover-Hager, Shira, et al.
Pubblicazione: (2025)

FedSUM Family: Efficient Federated Learning Methods under Arbitrary Client Participation
di: You, Runze, et al.
Pubblicazione: (2025)

Non-Euclidean SGD for Structured Optimization: Unified Analysis and Improved Rates
di: Kovalev, Dmitry, et al.
Pubblicazione: (2025)

Stochastic Approximation with Block Coordinate Optimal Stepsizes
di: Jiang, Tao, et al.
Pubblicazione: (2025)

Implicit Bias of Gradient Descent for Non-Homogeneous Deep Networks
di: Cai, Yuhang, et al.
Pubblicazione: (2025)

Effective Dimension Aware Fractional-Order Stochastic Gradient Descent for Convex Optimization Problems
di: Partohaghighi, Mohammad, et al.
Pubblicazione: (2025)