arXiv (All)
open access
A general recipe for data-adaptive anytime-valid envelopes for iterative algorithms
Most convergence guarantees for iterative stochastic algorithms are stated at a fixed iteration count and do not justify stopping at a data-dependent time. Recent work has constructed anytime-valid envelopes that do, but deterministic envelopes are typically too conservative for practical stopping,
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 general recipe for data-adaptive anytime-valid envelopes for iterative algorithms#1375051
- Recursive Gradient Retraction Methods for Stochastic Nonconvex Optimization on Stiefel Manifolds#1354626
- Convergence of Stochastic Gradient Methods under Heavy-Tailed Noise and Hölder Smoothness#1070253
- Non-Parametric Optimization for Scalable Learning in Stochastic Decision Problems#1387489
- Regularisation and Long-Time Behaviour of Random Systems#779315
Record · ID 1387836
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