arXiv · 0712.1654
Smoothing $\ell_1$-penalized estimators for high-dimensional time-course data
Abstract
When a series of (related) linear models has to be estimated it is often appropriate to combine the different data-sets to construct more efficient estimators. We use $\ell_1$-penalized estimators like the Lasso or the Adaptive Lasso which can simultaneously do parameter estimation and model selection. We show that for a time-course of high-dimensional linear models the convergence rates of the Lasso and of the Adaptive Lasso can be improved by combining the different time-points in a suitable way. Moreover, the Adaptive Lasso still enjoys oracle properties and consistent variable selection. The finite sample properties of the proposed methods are illustrated on simulated data and on a real problem of motif finding in DNA sequences.
Explore related subjects
Keep this discovery
Lukas Meier, Peter Bühlmann. 2007-12-11. Smoothing $\ell_1$-penalized estimators for high-dimensional time-course data. https://doi.org/10.1214/07-ejs103
Cite the original work for its findings. Save a collection to share your selection of sources.