Imagen de Portada

Communication-Efficient Adaptive Batch Size Strategies for Distributed Local Gradient Methods

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lau, Tim Tsz-Kit, Li, Weijian, Xu, Chenwei, Liu, Han, Kolar, Mladen
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Adaptive Batch Size Schedules for Distributed Training of Language Models with Data and Model Parallelism
por: Lau, Tim Tsz-Kit, et al.
Publicado: (2024)

AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods
por: Lau, Tim Tsz-Kit, et al.
Publicado: (2024)

PolarGrad: A Class of Matrix-Gradient Optimizers from a Unifying Preconditioning Perspective
por: Lau, Tim Tsz-Kit, et al.
Publicado: (2025)

Symmetry-Compatible Principle for Optimizer Design: Embeddings, LM Heads, SwiGLU MLPs, and MoE Routers
por: Lau, Tim Tsz-Kit, et al.
Publicado: (2026)

Gradient Clipping Beyond Vector Norms: A Spectral Approach for Matrix-Valued Parameters
por: Yukhimchuk, Alexander, et al.
Publicado: (2026)

On the Role of Batch Size in Stochastic Conditional Gradient Methods
por: Islamov, Rustem, et al.
Publicado: (2026)

AdaBatchGrad: Combining Adaptive Batch Size and Adaptive Step Size
por: Ostroukhov, Petr, et al.
Publicado: (2024)

Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates
por: Zhang, Siqi, et al.
Publicado: (2023)

Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size
por: Oowada, Kanata, et al.
Publicado: (2025)

Increasing Both Batch Size and Learning Rate Accelerates Stochastic Gradient Descent
por: Umeda, Hikaru, et al.
Publicado: (2024)

Adaptive Batch Size and Learning Rate Scheduler for Stochastic Gradient Descent Based on Minimization of Stochastic First-order Oracle Complexity
por: Umeda, Hikaru, et al.
Publicado: (2025)

Muon with Nesterov Momentum: Heavy-Tailed Noise and (Randomized) Inexact Polar Decomposition
por: Choudhury, Sayantan, et al.
Publicado: (2026)

Fully Stochastic Trust-Region Sequential Quadratic Programming for Equality-Constrained Optimization Problems
por: Fang, Yuchen, et al.
Publicado: (2022)

Adaptive Step Sizes for Preconditioned Stochastic Gradient Descent
por: Köhne, Frederik, et al.
Publicado: (2023)

Relationship between Batch Size and Number of Steps Needed for Nonconvex Optimization of Stochastic Gradient Descent using Armijo Line Search
por: Tsukada, Yuki, et al.
Publicado: (2023)

Pessimism Meets Risk: Risk-Sensitive Offline Reinforcement Learning
por: Zhang, Dake, et al.
Publicado: (2024)

Trust-Region Sequential Quadratic Programming for Stochastic Optimization with Random Models
por: Fang, Yuchen, et al.
Publicado: (2024)

Towards Simple and Provable Parameter-Free Adaptive Gradient Methods
por: Tao, Yuanzhe, et al.
Publicado: (2024)

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
por: Zhou, Dongruo, et al.
Publicado: (2018)

Directional Smoothness and Gradient Methods: Convergence and Adaptivity
por: Mishkin, Aaron, et al.
Publicado: (2024)

A Weighted Gradient Tracking Privacy-Preserving Method for Distributed Optimization
por: Xie, Furan, et al.
Publicado: (2025)

Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes
por: Chakraborty, Abhishek, et al.
Publicado: (2026)

Convergence of Distributed Adaptive Optimization with Local Updates
por: Cheng, Ziheng, et al.
Publicado: (2024)

A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting
por: Tyurin, Alexander, et al.
Publicado: (2022)

Optimal Growth Schedules for Batch Size and Learning Rate in SGD that Reduce SFO Complexity
por: Umeda, Hikaru, et al.
Publicado: (2025)

Analysis of On-policy Policy Gradient Methods under the Distribution Mismatch
por: Wang, Weizhen, et al.
Publicado: (2025)

On Penalty-based Bilevel Gradient Descent Method
por: Shen, Han, et al.
Publicado: (2023)

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

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization
por: Borodich, Ekaterina, et al.
Publicado: (2025)

An Adaptive Stochastic Gradient Method with Non-negative Gauss-Newton Stepsizes
por: Orvieto, Antonio, et al.
Publicado: (2024)

Accelerated Stochastic ExtraGradient: Mixing Hessian and Gradient Similarity to Reduce Communication in Distributed and Federated Learning
por: Bylinkin, Dmitry, et al.
Publicado: (2024)

Convergence of Sharpness-Aware Minimization Algorithms using Increasing Batch Size and Decaying Learning Rate
por: Harada, Hinata, et al.
Publicado: (2024)

Both Asymptotic and Non-Asymptotic Convergence of Quasi-Hyperbolic Momentum using Increasing Batch Size
por: Imaizumi, Kento, et al.
Publicado: (2025)

Online Linear Programming with Batching
por: Xu, Haoran, et al.
Publicado: (2024)

Batched First-Order Methods for Parallel LP Solving in MIP
por: Blin, Nicolas, et al.
Publicado: (2026)

Interpreting Adaptive Gradient Methods by Parameter Scaling for Learning-Rate-Free Optimization
por: Suh, Min-Kook, et al.
Publicado: (2024)

Communication-Efficient Stochastic Distributed Learning
por: Ren, Xiaoxing, et al.
Publicado: (2025)

Fast Catch-Up, Late Switching: Optimal Batch Size Scheduling via Functional Scaling Laws
por: Wang, Jinbo, et al.
Publicado: (2026)

ASGO: Adaptive Structured Gradient Optimization
por: An, Kang, et al.
Publicado: (2025)

Elementary Analysis of Policy Gradient Methods
por: Liu, Jiacai, et al.
Publicado: (2024)