arXiv (All)
open access
A Local Geometric Analysis of Maximal Coding Rate Reduction via Error Bounds
While the maximal coding rate reduction (MCR$^2$) objective has become a useful principle for learning compact and discriminative representations, a theoretical understanding of its optimization geometry remains limited, especially regarding why first-order methods often exhibit fast convergence nea
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
- Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion#670305
- Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion#668240
- Structure from rank: Rank-order coding as a bridge from sequence to structure#304499
- Nondyadic and nonlinear multiresolution image approximations#454314
- Geometric and Information Compression of Representations in Deep Learning#316829
Record · ID 1201085
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