arXiv (All)
open access
Second-Moment Stochastic Approximation Methods
Classical stochastic approximation methods rely on estimators of the first moment (mean) of a random regression function. We study methods that employ estimators of both the first and the second moments, which include modern deep-learning optimizers such as Adam and Muon as special cases. We derive
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
- Optimal Sobolev Approximation by Deterministic and Random Shallow Sigmoidal Networks#658912
- Optimal Sobolev Approximation by Deterministic and Random Shallow Sigmoidal Networks#656776
- On the Convergence of Muon and Beyond#1143622
- Neural Approximation by Function Composition: Rigidity and Doubly Exponential Convergence#1061502
- InfoAtlas: A Foundation Model for Zero-Shot Statistical Dependence Estimate#1070839
Record · ID 1131801
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