arXiv (All)
open access
Robust Latent Variable Graphical Models: Exact Recovery and Fundamental Limits
We study robust estimation of a Gaussian precision matrix that decomposes as a sparse matrix minus a symmetric, possibly indefinite, low-rank matrix, a structure that arises when latent-variable marginalization is combined with conditioning on linear measurements. The proposed convex estimator repla
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
- A Saddle Point Algorithm for Robust Data-Driven Factor Model Problems#131338
- Nonnegative Matrix Factorization in the Component-Wise L1 Norm for Sparse Data#1035445
- Robust covariance matrix estimation : 'HAC' estimates with long memory/antipersistence correction#452333
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Following a Unique Path: A Fast Certifier Applied to Outlier-Robust Pose Registration#925579
Record · ID 1402398
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