Image de couverture de livre

On the Batch Size Selection in Stochastic Gradient Methods Using No-Replacement Sampling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Boresta, Marco, De Santis, Alberto, Lucidi, Stefano
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction
par: Cristofari, Andrea, et autres
Publié: (2025)

A linesearch-based derivative-free method for noisy black-box problems
par: De Santis, Alberto, et autres
Publié: (2025)

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

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

Projected Gradient Methods with Momentum
par: Lapucci, Matteo, et autres
Publié: (2026)

A Globally Convergent Gradient Method with Momentum
par: Lapucci, Matteo, et autres
Publié: (2024)

AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods
par: Lau, Tim Tsz-Kit, et autres
Publié: (2024)

Communication-Efficient Adaptive Batch Size Strategies for Distributed Local Gradient Methods
par: Lau, Tim Tsz-Kit, et autres
Publié: (2024)

Computational issues in Optimization for Deep networks
par: Coppola, Corrado, et autres
Publié: (2024)

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)

Boosting Accelerated Proximal Gradient Method with Adaptive Sampling for Stochastic Composite Optimization
par: Zhu, Dongxuan, et autres
Publié: (2025)

Complexity results and active-set identification of a derivative-free method for bound-constrained problems
par: Brilli, Andrea, et autres
Publié: (2024)

Urgent Samples in Clinical Laboratories: Stochastic Batching to Minimize Patient Turnaround Time
par: Novak, Antonin, et autres
Publié: (2025)

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)

Method with Batching for Stochastic Finite-Sum Variational Inequalities in Non-Euclidean Setting
par: Pichugin, Alexander, et autres
Publié: (2024)

Optimal Analysis of Method with Batching for Monotone Stochastic Finite-Sum Variational Inequalities
par: Pichugin, Alexander, et autres
Publié: (2024)

AdaBatchGrad: Combining Adaptive Batch Size and Adaptive Step Size
par: Ostroukhov, Petr, et autres
Publié: (2024)

Convergence of the Iterates of the Stochastic Proximal Gradient Method
par: Madariaga, Javier I.
Publié: (2026)

Universal Gradient Methods for Stochastic Convex Optimization
par: Rodomanov, Anton, et autres
Publié: (2024)

Convergence of Riemannian Stochastic Gradient Descents: Varying Batch Sizes And Nonstandard Batch Forming
par: Wu, Hao
Publié: (2026)

Nonlinearly Preconditioned Gradient Methods: Momentum and Stochastic Analysis
par: Oikonomidis, Konstantinos, et autres
Publié: (2025)

Adaptive Step Sizes for Preconditioned Stochastic Gradient Descent
par: Köhne, Frederik, et autres
Publié: (2023)

A Zeroth-order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
par: Pougkakiotis, Spyridon, et autres
Publié: (2022)

Generalized Stochastic Gradient Descent with Momentum Methods for Smooth Optimization
par: Wang, Zimeng, et autres
Publié: (2026)

Stochastic Gradient Methods with Preconditioned Updates
par: Sadiev, Abdurakhmon, et autres
Publié: (2022)

Worst case complexity bounds for linesearch-type derivative-free algorithms
par: Brilli, Andrea, et autres
Publié: (2023)

Hinge-Proximal Stochastic Gradient Methods for Convex Optimization with Functional Constraints
par: Rajoriya, Vaibhav, et autres
Publié: (2025)

Convergence Analysis of Stochastic Accelerated Gradient Methods for Generalized Smooth Optimizations
par: Yu, Chenhao, et autres
Publié: (2025)

Conditional Gradient Methods with Standard LMO for Stochastic Simple Bilevel Optimization
par: Giang-Tran, Khanh-Hung, et autres
Publié: (2025)

Deterministic and Stochastic Accelerated Gradient Method for Convex Semi-Infinite Optimization
par: Yao, Yao, et autres
Publié: (2023)

Tighter Analysis for Decentralized Stochastic Gradient Method: Impact of Data Homogeneity
par: Li, Qiang, et autres
Publié: (2024)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
par: Lapucci, Matteo, et autres
Publié: (2024)

Batched First-Order Methods for Parallel LP Solving in MIP
par: Blin, Nicolas, et autres
Publié: (2026)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
par: Liuzzi, Giampaolo, et autres
Publié: (2025)

Multi-Fidelity Stochastic Trust Region Method with Adaptive Sampling
par: Ha, Yunsoo, et autres
Publié: (2025)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
par: Livni, Roi
Publié: (2024)

Mini-Batch Stochastic Halpern Algorithm for Nonexpansive Fixed point Problems
par: Iiduka, Hideaki
Publié: (2026)

On the Convergence and Complexity of the Stochastic Central Finite-Difference Based Gradient Estimation Methods
par: Bollapragada, Raghu, et autres
Publié: (2025)

Zeroth-order Gradient and Quasi-Newton Methods for Nonsmooth Nonconvex Stochastic Optimization
par: Marrinan, Luke, et autres
Publié: (2023)