Sharp detection of smooth signals in a high-dimensional sparse matrix with indirect observations
Cristina Butucea, Ghislaine Gayraud

TL;DR
This paper establishes sharp detection rates for sparse, smooth signals in high-dimensional Gaussian matrices with indirect, heteroscedastic observations, advancing understanding of signal detectability in complex data models.
Contribution
It provides the first sharp asymptotic detection rates for sparse, smooth signals in high-dimensional matrices with indirect Gaussian observations, including minimax lower bounds.
Findings
Derived sharp detection rates for sparse submatrix signals.
Established asymptotic minimax risk tending to zero under certain conditions.
Proved lower bounds showing no test can outperform the established rates.
Abstract
We consider a matrix-valued Gaussian sequence model, that is, we observe a sequence of high-dimensional matrices of heterogeneous Gaussian random variables for , and . The standard deviation of our observations is for some and . We give sharp rates for the detection of a sparse submatrix of size with active components. A component is said active if the sequence have mean within a Sobolev ellipsoid of smoothness and total energy larger than some . Our rates involve relationships between and tending to infinity such that , and tend to 0, such that a test procedure that we construct has asymptotic minimax risk tending to 0. We prove…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Random Matrices and Applications · Mathematical Approximation and Integration
