arXiv (OAI Expanded)
open access
Optimal Two-Step Stepsize Schedule for Stochastic Gradient Methods
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 Two-Step Stepsize Schedule for Stochastic Gradient Methods#612466
- Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad#200482
- Runtime-Orchestrated Second-Order Optimization for Scalable LLM Training#194280
- A novel L-shaped refinement chain cuts method for two-stage stochastic programs#1123109
- Hybrid Algorithms for Two-Level Learning and Optimization: Theory and Applications#445366
Record · ID 610989
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