Name
Abstract | ||
|---|---|---|
In many application areas, prior subject matter knowledge can be formulated as constraints on parameters in order to get a more accurate fit. A generalized ℓ1-penalized quantile regression with linear constraints on parameters is considered, including either linear inequality or equality constraints or both. It allows a general form of penalization, including the usual lasso, the fused lasso and the adaptive lasso as special cases. The KKT conditions of the optimization problem are derived and the whole solution path is computed as a function of the tuning parameter. A formula for the number of degrees of freedom is derived, which is used to construct model selection criteria for selecting optimal tuning parameters. Finally, several simulation studies and two real data examples are presented to illustrate the proposed method. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.csda.2019.106819 | Computational Statistics & Data Analysis |
Keywords | Field | DocType |
Degrees of freedom,Generalized lasso,KKT conditions,Linear programming,Quantile regression | Econometrics,Applied mathematics,Optimal tuning,Lasso (statistics),Model selection,Karush–Kuhn–Tucker conditions,Linear inequality,Optimization problem,Mathematics,Quantile regression | Journal |
Volume | ISSN | Citations |
142 | 0167-9473 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongxin Liu | 1 | 0 | 0.34 |
| Peng Zeng | 2 | 25 | 5.33 |
| Lu Lin | 3 | 27 | 8.56 |