:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Harada, Hinata, Iiduka, Hideaki
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Optimization and Control
Accesso online:	https://arxiv.org/abs/2409.09984
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

Improved Convergence Rates of Muon Optimizer for Nonconvex Optimization
di: Nagashima, Shuntaro, et al.
Pubblicazione: (2026)

Mini-Batch Stochastic Halpern Algorithm for Nonexpansive Fixed point Problems
di: Iiduka, Hideaki
Pubblicazione: (2026)

Momentum Does Not Reduce Stochastic Noise in Stochastic Gradient Descent
di: Sato, Naoki, et al.
Pubblicazione: (2024)

Using Stochastic Gradient Descent to Smooth Nonconvex Functions: Analysis of Implicit Graduated Optimization
di: Sato, Naoki, et al.
Pubblicazione: (2023)

Increasing Batch Size Improves Convergence of Stochastic Gradient Descent with Momentum
di: Kamo, Keisuke, et al.
Pubblicazione: (2025)

Sharpness-Aware Minimization: General Analysis and Improved Rates
di: Oikonomou, Dimitris, et al.
Pubblicazione: (2025)

Mini-Batch Stochastic Krasnosel'ski\uı-Mann Algorithm for Nonexpansive Fixed Point Problems
di: Iiduka, Hideaki
Pubblicazione: (2026)

Adaptive Algorithms with Sharp Convergence Rates for Stochastic Hierarchical Optimization
di: Gong, Xiaochuan, et al.
Pubblicazione: (2025)

Sharpness-Aware Minimization Can Hallucinate Minimizers
di: Park, Chanwoong, et al.
Pubblicazione: (2025)

Seesaw: Accelerating Training by Balancing Learning Rate and Batch Size Scheduling
di: Meterez, Alexandru, et al.
Pubblicazione: (2025)

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

Accelerating SGDM via Learning Rate and Batch Size Schedules: A Lyapunov-Based Analysis
di: Kondo, Yuichi, et al.
Pubblicazione: (2025)

Convergence Bound and Critical Batch Size of Muon Optimizer
di: Sato, Naoki, et al.
Pubblicazione: (2025)

DGSAM: Domain Generalization via Individual Sharpness-Aware Minimization
di: Song, Youngjun, et al.
Pubblicazione: (2025)

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
di: Vaidyan, Kevin Kurian Thomas, et al.
Pubblicazione: (2026)

Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality
di: Yan, Yu-Hu, et al.
Pubblicazione: (2025)

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

Critical Influence of Overparameterization on Sharpness-aware Minimization
di: Shin, Sungbin, et al.
Pubblicazione: (2023)

Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler
di: Oikonomou, Dimitris, et al.
Pubblicazione: (2026)

On the Duality Between Sharpness-Aware Minimization and Adversarial Training
di: Zhang, Yihao, et al.
Pubblicazione: (2024)

Convergence Rate Analysis of LION
di: Dong, Yiming, et al.
Pubblicazione: (2024)

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

Communication-Efficient Adaptive Batch Size Strategies for Distributed Local Gradient Methods
di: Lau, Tim Tsz-Kit, et al.
Pubblicazione: (2024)

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

Iteration and Stochastic First-order Oracle Complexities of Stochastic Gradient Descent using Constant and Decaying Learning Rates
di: Imaizumi, Kento, et al.
Pubblicazione: (2024)

Theoretical Analysis on how Learning Rate Warmup Accelerates Convergence
di: Liu, Yuxing, et al.
Pubblicazione: (2025)

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

Fundamental Convergence Analysis of Sharpness-Aware Minimization
di: Khanh, Pham Duy, et al.
Pubblicazione: (2024)

Dynamic Regularized Sharpness Aware Minimization in Federated Learning: Approaching Global Consistency and Smooth Landscape
di: Sun, Yan, et al.
Pubblicazione: (2023)

MAP Estimation with Denoisers: Convergence Rates and Guarantees
di: Pesme, Scott, et al.
Pubblicazione: (2025)

Non-Parametric Learning of Stochastic Differential Equations with Non-asymptotic Fast Rates of Convergence
di: Bonalli, Riccardo, et al.
Pubblicazione: (2023)

How Does Critical Batch Size Scale in Pre-training?
di: Zhang, Hanlin, et al.
Pubblicazione: (2024)

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