arXiv (All)
open access
FlexGrad: a root-free approach to adaptive step sizes
We introduce the FlexGrad optimizer, an adaptive gradient method that addresses a key limitation of classical AdaGrad-type methods: their inability to exploit correlations between gradients. By scaling steps using both cumulative gradients and cumulative squared gradients, FlexGrad preserves AdaGrad
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
- Long-Run Dynamics of AdaGrad-Norm: Trajectory Stability and Asymptotic Stationarity#793541
- Long-Run Dynamics of AdaGrad-Norm: Trajectory Stability and Asymptotic Stationarity#789537
- The Best Optimizer Depends on Batch Size#1233014
- Optimal Two-Step Stepsize Schedule for Stochastic Gradient Methods#612466
- Optimal Two-Step Stepsize Schedule for Stochastic Gradient Methods#610989
Record · ID 1233242
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