arXiv (All)
open access
Unified Convergence Theory of Stochastic and Variance-Reduced Cubic Newton Methods
We study stochastic Cubic Newton methods for solving general possibly non-convex minimization problems. We propose a new framework, which we call the helper framework, that provides a unified view of the stochastic and variance-reduced second-order algorithms equipped with global complexity guarante
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
- On the Last-Iterate Convergence of Clipped Gradient Methods#1356362
- Multilevel Regularized Newton Methods with Fast Convergence Rates#1217243
- A Local Geometric Analysis of Maximal Coding Rate Reduction via Error Bounds#1201085
- A Rate Transfer Method: Convergence Rates in Stochastic Gradient Descent via Stochastic Calculus#1344236
- A Rate Transfer Method: Convergence Rates in Stochastic Gradient Descent via Stochastic Calculus#1319019
Record · ID 1297964
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