Stable recovery and the coordinate small-ball behaviour of random vectors
Shahar Mendelson, Grigoris Paouris

TL;DR
This paper introduces the coordinate small-ball condition to analyze stable recovery in data science, demonstrating that many random vectors exhibit stable point separation even under minimal assumptions, with applications to sub-sampled convolutions.
Contribution
The paper develops a new coordinate small-ball framework for understanding stable point separation in general sampling methods, extending beyond iid subgaussian vectors.
Findings
Many coordinates of the transformed vector are significantly large.
Stable point separation holds under minimal assumptions on the random vector.
Random sub-sampled convolutions satisfy stable point separation without restrictive conditions.
Abstract
Recovery procedures in various application in Data Science are based on \emph{stable point separation}. In its simplest form, stable point separation implies that if is "far away" from , and one is given a random sample where a proportional number of the sample points may be corrupted by noise, that information is still enough to exhibit that is far from . Stable point separation is well understood in the context of iid sampling, and to explore it for general sampling methods we introduce a new notion---the \emph{coordinate small-ball} of a random vector . Roughly put, this feature captures the number of "relatively large coordinates" of , where is an arbitrary linear operator and is any fixed orthonormal basis of . We show that under the bare-minimum assumptions…
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
TopicsPoint processes and geometric inequalities · Statistical and numerical algorithms · Statistical Methods and Inference
