Reconstruction and subgaussian operators
Shahar Mendelson, Alain Pajor, Nicole Tomczak-Jaegermann

TL;DR
This paper introduces a randomized subgaussian measurement method for approximating vectors in a set, analyzing geometric properties of random polytopes, and providing new empirical process estimates based on the b3_2 functional.
Contribution
It develops a novel approach for vector approximation and support identification using subgaussian measurements, with new geometric and empirical process insights.
Findings
High-probability approximation guarantees based on geometric parameters.
New bounds on empirical processes involving the b3_2 functional.
Results on the neighborliness of random b1-1,1-polytope faces.
Abstract
We present a randomized method to approximate any vector from some set . The data one is given is the set , and scalar products , where are i.i.d. isotropic subgaussian random vectors in , and . We show that with high probability, any for which is close to the data vector will be a good approximation of , and that the degree of approximation is determined by a natural geometric parameter associated with the set . We also investigate a random method to identify exactly any vector which has a relatively short support using linear subgaussian measurements as above. It turns out that our analysis, when applied to -valued vectors with i.i.d, symmetric entries, yields new information on the geometry of faces of random -polytope;…
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
TopicsSparse and Compressive Sensing Techniques · Point processes and geometric inequalities · Computational Geometry and Mesh Generation
