arXiv (All)
open access
The Root Finding Problem Revisited: Beyond the Robbins-Monro procedure
We introduce Sequential Probability Ratio Bisection (SPRB), a novel stochastic approximation algorithm that adapts to the local behavior of the (regression) function of interest around its root. We establish theoretical guarantees for SPRB's asymptotic performance, showing that it achieves the optim
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
- Uniform efficiency of the Ulrich-Wood sampler for the von Mises-Fisher distribution#1064428
- Hereditary Hsu-Robbins-Erdös Law of Large Numbers#179136
- Convergence rates of randomly pivoted methods for low-rank approximation#973874
- Towards discrete convex analysis over classical root systems#620506
- Towards discrete convex analysis over classical root systems#618827
Record · ID 1129105
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