arXiv (All)
open access
Improved Convergence Rates for Stochastic Multi-Gradient Descent which Close the Gap: A Proof by AI
For smooth nonconvex stochastic multi-objective optimization, stochastic multi-gradient descent (SMG) computes an approximate steepest common descent direction of the objectives from stochastic gradients. Under standard assumptions, this note establishes a new convergence rate for SMG in terms of th
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
- Revisiting AdaGrad in Stochastic Convex Optimization: Last Iterates, High Probability, and Lower Bounds#1117060
- Near-Optimal Higher-Order Oracle Complexity for Convex--Concave Minimax Optimization#1064790
- Geometric convergence and state-space decompositions for stochastic gradient descent markov chains#669032
- Randomized Subspace Nesterov Accelerated Gradient#151726
- Learning to Optimize by Differentiable Programming#798738
Record · ID 974499
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