Online Orthogonal Matching Pursuit - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

Online Orthogonal Matching Pursuit

Résumé

Greedy algorithms for feature selection are widely used for recovering sparse high-dimensional vectors in linear models. In classical procedures, the main emphasis was put on the sample complexity, with little or no consideration of the computation resources required. We present a novel online algorithm: Online Orthogonal Matching Pursuit (OOMP) for online support recovery in the random design setting of sparse linear regression. Our procedure selects features sequentially, alternating between allocation of samples only as needed to candidate features, and optimization over the selected set of variables to estimate the regression coefficients. Theoretical guarantees about the output of this algorithm are proven and its computational complexity is analysed.

Dates et versions

hal-03141061 , version 1 (14-02-2021)

Identifiants

Citer

El Mehdi Saad, Gilles Blanchard, Sylvain Arlot. Online Orthogonal Matching Pursuit. 2021. ⟨hal-03141061⟩
133 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More