arXiv (All)
open access
Accelerated Algorithms for Stochastic Monotone Inclusions with Fixed Queries
We study acceleration of stochastic first-order methods for monotone Lipschitz inclusions with a fixed number of oracle queries per iteration, measured by the expected squared residual. Existing methods either have suboptimal oracle complexity, require an increasing number of oracle queries per iter
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
- Unbiased and Biased Variance-Reduced Forward-Reflected-Backward Splitting Methods for Stochastic Composite Inclusions#996889
- Spectral Initialization and Scheduled Graph Smoothness for Uncertain Knowledge Graph Completion#632856
- Property Testing for Recursive Query Languages#926776
- High-Magnetization Sampling at Low Temperatures: Ising Models and Bayesian Sparse Linear Regression#986498
- Improved KKT Complexity for First-Order Bilevel Optimization under Weak Lower-Level Convexity#1144903
Record · ID 1130285
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