arXiv (All)
open access
Adaptive two-points zero-order accelerated methods for stochastic convex optimization problems
We study stochastic convex optimization, where each sampled function can be evaluated at two arbitrary points. Our accelerated method chooses step sizes, batch sizes and smoothing radii from function values. A forward difference between smoothing scales controls the radius; we account for changes in
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
- Stochastic Gradient Methods with Online Scaling#999915
- A Solvable Model of Adaptive Learning Rate Rescaling: Acceleration, Stability & Scaling#1215789
- When the Preconditioning Exponent Turns Negative: Learning-Rate Coupling and Cross-Environment Generalization#1104470
- LSOS: Line-search second-order stochastic optimization methods for nonconvex finite sums#628836
- Communication-Efficient Zero-Order and First-Order Federated Learning Methods over Wireless Networks#231503
Record · ID 1326452
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