Variable selection in high-dimension with random designs and orthogonal matching pursuit

zbMATH Open1318.62062arXiv1109.0730MaRDI QIDQ2933865FDOQ2933865

Authors: Antony Joseph 

Publication date: 8 December 2014

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

Recommendations

• High-dimensional variable selection with sparse random projections: measurement sparsity and statistical efficiency
• Error estimates for orthogonal matching pursuit and random dictionaries
• Sparsity and incoherence in orthogonal matching pursuit
• Tight recovery guarantees for orthogonal matching pursuit under Gaussian noise
• A stepwise regression method and consistent model selection for highdimensional sparse linear models

zbMATH Keywords

Lassohigh-dimensional regressioncompressed sensinggreedy algorithms

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Statistical ranking and selection procedures (62F07)

Cited In (5)

• Optimality of Graphlet Screening in High Dimensional Variable Selection
• Model pursuit and variable selection in the additive accelerated failure time model
• High Dimensional Variable Selection via Tilting
• High-dimensional variable selection with sparse random projections: measurement sparsity and statistical efficiency
• Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix

This page was built for publication: Variable selection in high-dimension with random designs and orthogonal matching pursuit

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