In this second lecture, we will focus on the problem of high dimensional linear regression under the sparsity assumption and discuss the three main statistical problems: denoising, prediction and model selection. We will prove that convex programming based predictors such as the lasso and the Dantzig selector are provably consistent as soon as the dictionary elements are normalized and an appropriate upper bound on the noise-level is available. We will also show that under additional assumptions on the dictionary elements, the aforementioned methods are rate-optimal and model-selection consistent.

本講演は,数物フロンティア・リーディング大学院のFMSPレクチャーズとして行います．