arXiv (All)
open access
Sharp minimax risks and phase transitions in sparse submatrix detection
In this paper, we study the minimax risk of detecting a sparse, elevated-mean Gaussian submatrix planted in a larger noisy matrix. When the planted submatrix has size $n\times n$ and the ambient matrix has size $N\times N$ with $N=n^{1+α}$, the seminal work of Butucea and Ingster (2013) identifies t
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
- On the Robustness of Sparse Randomized Sketching to FP16 Rounding on GPUs#1343613
- Sparse plus low-rank matrix embedding with applications in cancer radiotherapy optimization#972746
- Don't Get Your Kroneckers in a Twist: Gaussian Processes on High-Dimensional Incomplete Grids#1247387
- OX-NeRF: 3D X-ray Tomography Reconstruction from Sparse Views Using Implicit Neural Representation#1248827
- Convergence Rates of Gaussian Process Thompson Sampling for Efficient Global Optimization#1354607
Record · ID 1456256
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