Sparse Recovery Problems in High Dimensions: Statistical Inference and Learning Theory
Peter L. Bartlett, Vladimir I. Koltchinskii, Alexandre B. Tsybakov, Sara van de Geer · Oberwolfach Reports · 2009
The statistical analysis of high dimensional data requires new techniques, extending results from nonparametric statistics, analysis, probability, approximation theory, and theoretical computer science. The main problem is how to unveil, (or to mimic performance of) sparse models for the data. Sparsity is generally meant in terms of the number of variables included, but may also be described in terms of smoothness, entropy, or geometric structures. A key objective is to adapt to unknown sparsity, yet keeping computational feasibility.