Image de couverture de livre

Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Attia, Amit, Gaash, Ofir, Koren, Tomer
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

How Free is Parameter-Free Stochastic Optimization?
par: Attia, Amit, et autres
Publié: (2024)

Learning Rate Annealing Improves Tuning Robustness in Stochastic Optimization
par: Attia, Amit, et autres
Publié: (2025)

Towards Fully Parameter-Free Stochastic Optimization: Grid Search with Self-Bounding Analysis
par: Zhao, Yuheng, et autres
Publié: (2026)

Fast Last-Iterate Convergence of SGD in the Smooth Interpolation Regime
par: Attia, Amit, et autres
Publié: (2025)

Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization
par: Vansover-Hager, Shira, et autres
Publié: (2025)

Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size
par: Oowada, Kanata, et autres
Publié: (2025)

Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
par: Sherman, Uri, et autres
Publié: (2025)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
par: Sherman, Uri, et autres
Publié: (2025)

Asynchronous Distributed Optimization with Delay-free Parameters
par: Wu, Xuyang, et autres
Publié: (2023)

Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
par: Bao, Lingchan, et autres
Publié: (2025)

Faster Gradient Methods for Highly-Smooth Stochastic Bilevel Optimization
par: Chen, Lesi, et autres
Publié: (2025)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
par: Chen, Lesi, et autres
Publié: (2023)

Convergence of Clipped SGD on Convex $(L_0,L_1)$-Smooth Functions
par: Gaash, Ofir, et autres
Publié: (2025)

Optimal Asynchronous Stochastic Nonconvex Optimization under Heavy-Tailed Noise
par: Wu, Yidong, et autres
Publié: (2026)

Faster Stochastic Algorithms for Minimax Optimization under Polyak--Łojasiewicz Conditions
par: Chen, Lesi, et autres
Publié: (2023)

Dual-Delayed Asynchronous SGD for Arbitrarily Heterogeneous Data
par: Wang, Xiaolu, et autres
Publié: (2024)

Asynchronous and Stochastic Distributed Resource Allocation
par: Li, Qiang, et autres
Publié: (2025)

Towards Faster Decentralized Stochastic Optimization with Communication Compression
par: Islamov, Rustem, et autres
Publié: (2024)

On the Role of Batch Size in Stochastic Conditional Gradient Methods
par: Islamov, Rustem, et autres
Publié: (2026)

A Mechanism Study of Delayed Loss Spikes in Batch-Normalized Linear Models
par: Gao, Peifeng, et autres
Publié: (2026)

Faster Algorithms for User-Level Private Stochastic Convex Optimization
par: Lowy, Andrew, et autres
Publié: (2024)

Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity
par: Tyurin, Alexander, et autres
Publié: (2024)

Faster Convergence of Stochastic Accelerated Gradient Descent under Interpolation
par: Mishkin, Aaron, et autres
Publié: (2024)

Private Online Learning via Lazy Algorithms
par: Asi, Hilal, et autres
Publié: (2024)

Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling
par: Li, Junyi, et autres
Publié: (2024)

The Effect of Mini-Batch Noise on the Implicit Bias of Adam
par: Cattaneo, Matias D., et autres
Publié: (2026)

Relationship between Batch Size and Number of Steps Needed for Nonconvex Optimization of Stochastic Gradient Descent using Armijo Line Search
par: Tsukada, Yuki, et autres
Publié: (2023)

Increasing Both Batch Size and Learning Rate Accelerates Stochastic Gradient Descent
par: Umeda, Hikaru, et autres
Publié: (2024)

Stochastic Variance-Reduced Newton: Accelerating Finite-Sum Minimization with Large Batches
par: Dereziński, Michał
Publié: (2022)

Optimization Trade-offs in Asynchronous Federated Learning: A Stochastic Networks Approach
par: Alahyane, Abdelkrim, et autres
Publié: (2026)

Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster
par: Vaswani, Sharan, et autres
Publié: (2025)

Adaptive Batch Size and Learning Rate Scheduler for Stochastic Gradient Descent Based on Minimization of Stochastic First-order Oracle Complexity
par: Umeda, Hikaru, et autres
Publié: (2025)

Lions and Muons: Optimization via Stochastic Frank-Wolfe
par: Sfyraki, Maria-Eleni, et autres
Publié: (2025)

RedEx: Beyond Fixed Representation Methods via Convex Optimization
par: Daniely, Amit, et autres
Publié: (2024)

Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models
par: Xie, Xingyu, et autres
Publié: (2022)

LORENZA: Enhancing Generalization in Low-Rank Gradient LLM Training via Efficient Zeroth-Order Adaptive SAM
par: Refael, Yehonathan, et autres
Publié: (2025)

Stochastic Compositional Optimization via Hybrid Momentum Frank--Wolfe
par: Chayti, El Mahdi
Publié: (2026)

Stochastic-Constrained Stochastic Optimization with Markovian Data
par: Kim, Yeongjong, et autres
Publié: (2023)

Finite-Time Bounds for Two-Time-Scale Stochastic Approximation with Arbitrary Norm Contractions and Markovian Noise
par: Chandak, Siddharth, et autres
Publié: (2025)

Drago: Primal-Dual Coupled Variance Reduction for Faster Distributionally Robust Optimization
par: Mehta, Ronak, et autres
Publié: (2024)