Variable selection in high-dimensional linear models: partially faithful distributions and the PC-simple algorithm

From MaRDI portal
Publication:96604

DOI10.1093/BIOMET/ASQ008zbMATH Open1233.62135arXiv0906.3204OpenAlexW2169847599WikidataQ57707425 ScholiaQ57707425MaRDI QIDQ96604FDOQ96604

Peter Bühlmann, P. Buhlmann, Markus Kalisch, Marloes H. Maathuis, Markus Kalisch, Marloes H. Maathuis

Publication date: 30 April 2010

Published in: Biometrika (Search for Journal in Brave)

Abstract: We consider variable selection in high-dimensional linear models where the number of covariates greatly exceeds the sample size. We introduce the new concept of partial faithfulness and use it to infer associations between the covariates and the response. Under partial faithfulness, we develop a simplified version of the PC algorithm (Spirtes et al., 2000), the PC-simple algorithm, which is computationally feasible even with thousands of covariates and provides consistent variable selection under conditions on the random design matrix that are of a different nature than coherence conditions for penalty-based approaches like the Lasso. Simulations and application to real data show that our method is competitive compared to penalty-based approaches. We provide an efficient implementation of the algorithm in the R-package pcalg.


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




Recommendations





Cited In (31)

Uses Software





This page was built for publication: Variable selection in high-dimensional linear models: partially faithful distributions and the PC-simple algorithm

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