arXiv (All)
open access
From Graphical Lasso to Atomic Norms: High-Dimensional Pattern Recovery
We study high-dimensional precision-matrix estimation with polyhedral atomic-norm penalties on the off-diagonal entries. This framework covers the graphical lasso, $\ell_\infty$-type penalties, SLOPE/OWL penalties, and penalties motivated by colored graphical models. We define the target pattern thr
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
- An Accurate Lanczos Method for the Matrix Product State Representation#1355895
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Machine Learning Methods Through the Lens of Infinite-Dimensional Lasso#634850
- 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
Record · ID 1328297
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