arXiv (All)
open access
The Best Optimizer Depends on Batch Size
A plethora of new adaptive optimizers are designed to efficiently estimate and use minibatch gradient statistics to shape parameter updates, but they are typically benchmarked at a single batch size. Hyperparameter scaling rules promise to preserve performance as batch size and gradient noise change
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- FlexGrad: a root-free approach to adaptive step sizes#1233242
- AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods#670271
- AdAdaGrad: Adaptive Batch Size Schemes for Adaptive Gradient Methods#668206
- Optimizer Memory Schedules for Outscaling the Overtraining Axis#927853
- Hybrid Adaptive Tuning for Tiered Memory Systems#13182
Record · ID 1233014
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive