arXiv (All)
open access
On the convergence of doubly stochastic block gradient descent method for linear inverse problems
Stochastic gradient descent (SGD) and randomized block coordinate descent (RBCD) belong to two fundamentally different classes of stochastic iterative regularization methods, and are promising and popular for solving large-scale inverse problems, due to their excellent scalability with respect to da
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
- Generalization Guarantees of Randomized Block Coordinate Descent for Nonconvex Learning#1357868
- Generalization Guarantees of Randomized Block Coordinate Descent for Nonconvex Learning#1348855
- Early stopping of stochastic variance reduced gradient for linear inverse problems by the discrepancy principle#1000348
- Last-Iterate Convergence of Clipped SGD with Linear Decay#1344056
- Large-Step Last-Iterate Convergence of Random-Reshuffling Stochastic Gradient Descent#1345267
Record · ID 1326649
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