Name
Abstract | ||
|---|---|---|
We consider new formulations and methods for sparse quantile regression in the high-dimensional setting. Quantile regression plays an important role in many data mining applications, including outlier-robust exploratory analysis in gene selection. In addition, the sparsity consideration in quantile regression enables the exploration of the entire conditional distribution of the response variable given the predictors and therefore yields a more comprehensive view of the important predictors. We propose a generalized Orthogonal Matching Pursuit algorithm for variable selection, taking the misfit loss to be either the traditional quantile loss or a smooth version we call quantile Huber, and compare the resulting greedy approaches with convex sparsity-regularized formulations. We apply a recently proposed interior point methodology to efficiently solve all formulations, provide theoretical guarantees of consistent estimation, and demonstrate the performance of our approach using empirical studies of simulated and genomic datasets. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ICDM.2014.134 | ICDM |
Keywords | Field | DocType |
convergence,sparse matrices,servers,vectors | Matching pursuit,Convergence (routing),Data mining,Conditional probability distribution,Feature selection,Computer science,Artificial intelligence,Sparse matrix,Mathematical optimization,Quantile,Interior point method,Machine learning,Quantile regression | Conference |
ISSN | Citations | PageRank |
1550-4786 | 4 | 0.42 |
References | Authors | |
13 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aleksandr Y. Aravkin | 1 | 252 | 32.68 |
| Aurelie C. Lozano | 2 | 145 | 20.21 |
| Ronny Luss | 3 | 102 | 10.30 |
| Prabhanjan Kambadur | 4 | 810 | 59.40 |