作者: Constantine Caramanis , Yudong Chen
DOI:
关键词:
摘要: Many models for sparse regression typically assume that the covariates are known completely, and without noise. Particularly in high-dimensional applications, this is often not case. Worse yet, even estimating statistics of noise (the covariance) can be a central challenge. In paper we develop simple variant orthogonal matching pursuit (OMP) precisely setting. We show knowledge covariance, our algorithm recovers support, provide lower bounds performs at minimax optimal rate. While simple, first (provably) support noise-distribution-oblivious manner. When noise-covariance available, matches best-known l2-recovery available. these too min-max optimal. Along way, also obtain improved performance guarantees OMP standard problem with Gaussian