arXiv (All)
open access
Generalization Guarantees of Randomized Block Coordinate Descent for Nonconvex Learning
Randomized block coordinate descent (RBCD) is a popular optimization algorithm for many large-scale machine learning problems. The existing theoretical analysis of RBCD mainly focuses on its convergence behavior from an optimization perspective, while its generalization behavior remains less underst
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#1348855
- On the convergence of doubly stochastic block gradient descent method for linear inverse problems#1326649
- Geometric convergence and state-space decompositions for stochastic gradient descent markov chains#669032
- A Framework for Loop-Free Convergence#501143
- High-Probability Guarantees for SGD under $β$-Heavy-Tailed Gradient Noise#1116526
Record · ID 1357868
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