arXiv (All)
open access
Matching the Lower Bounds: Stochastic Contracting Cubic Newton and Its Optimal Acceleration
We study second-order methods for convex stochastic optimization, where gradients and Hessians are available only through stochastic estimates with variances $σ_1^2$ and $σ_2^2$, respectively. First, we propose the Stochastic Contracting Cubic Newton method. At each iteration, it minimizes a cubic m
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
- A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization#1187210
- A global stochastic maximum principle for forward-backward stochastic control systems with quadratic convex generator and unbounded terminal condition#1035853
- Stochastic Optimal Control Laws for Cellular Artificial Muscles#325104
- Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization#247018
- Value-Function Root-Finding Algorithms for Composite Convex Simple Bilevel Optimization#677336
Record · ID 1248973
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