arXiv (All)
open access
Rank-One Signal Recovery in Sparse Wishart Noise
We study the high-dimensional recovery of a signal vector $\mathbf{x}$ in the presence of sparse Wishart-like noise. We define an $N \times N$ matrix $A = J+(θ/N)\mathbf{xx}^{\top}$, where $\mathbf{xx}^{\top}$ is the rank-one deformation of the random noise matrix $J$. We consider a Wishart-like mat
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 Exact Tail Condition for the Largest Error in Estimating a Rank-One Direction#972182
- Recovering linear images of sparse signals from indirect observations#973782
- Low Rank Based Subspace Inference for the Laplace Approximation of Bayesian Neural Networks#131285
- Algorithmic threshold for high-dimensional projection pursuit I: general theory#794206
- Algorithmic threshold for high-dimensional projection pursuit I: general theory#790187
Record · ID 1064707
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