arXiv (All)
open access
Breaking the Stochasticity Barrier: An Adaptive Variance-Reduced Method for Variational Inequalities
Stochastic non-convex non-concave optimization, formally characterized as Stochastic Variational Inequalities (SVIs), presents unique challenges due to rotational dynamics and the absence of a global merit function. While adaptive step-size methods (like Armijo line-search) have revolutionized conve
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
- Randomized Submanifold Subgradient Method for Optimization over Stiefel Manifolds#1116072
- A sequential smoothing majorant stochastic approximation method for nonconvex nonconcave minimax problems#998722
- Averaged proximal reflected gradient method for monotone variational inequalities#973988
- Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization#677345
- Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization#674148
Record · ID 1389185
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