Reconstruction and subgaussian processes

From MaRDI portal
Publication:2484539

DOI10.1016/J.CRMA.2005.04.032zbMATH Open1081.46013arXivmath/0506239OpenAlexW1975596825MaRDI QIDQ2484539FDOQ2484539


Authors: Shahar Mendelson, Alain Pajor, Nicole Tomczak-Jaegermann Edit this on Wikidata


Publication date: 1 August 2005

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Abstract: We present a randomized method to approximate any vector v from some set TsubsetRn. The data one is given is the set T, and k scalar products (inrXi,v)i=1k, where (Xi)i=1k are i.i.d. isotropic subgaussian random vectors in Rn, and klln. We show that with high probability, any yinT for which (inrXi,y)i=1k is close to the data vector (inrXi,v)i=1k will be a good approximation of v, and that the degree of approximation is determined by a natural geometric parameter associated with the set T. 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 1,1-valued vectors with i.i.d, symmetric entries, yields new information on the geometry of faces of random 1,1-polytope; we show that a k-dimensional random 1,1-polytope with n vertices is m-neighborly for very large mleck/log(cn/k). The proofs are based on new estimates on the behavior of the empirical process supfinF|k1sumi=1kf2(Xi)Ef2| when F is a subset of the L2 sphere. The estimates are given in terms of the gamma2 functional with respect to the psi2 metric on F, and hold both in exponential probability and in expectation.


Full work available at URL: https://arxiv.org/abs/math/0506239




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Reconstruction and subgaussian processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484539)