sparsenet

R package SparseNet: coordinate descent with nonconvex penalties. We address the problem of sparse selection in linear models. A number of nonconvex penalties have been proposed in the literature for this purpose, along with a variety of convex-relaxation algorithms for finding good solutions. We pursue a coordinate-descent approach for optimization, and study its convergence properties. We characterize the properties of penalties suitable for this approach, study their corresponding threshold functions, and describe a df-standardizing reparametrization that assists our pathwise algorithm. The MC+ penalty is ideally suited to this task, and we use it to demonstrate the performance of our algorithm. Certain technical derivations and experiments related to this article are included in the supplementary materials section.


References in zbMATH (referenced in 80 articles , 1 standard article )

Showing results 21 to 40 of 80.
Sorted by year (citations)
  1. Piotr Pokarowski, Wojciech Rejchel, Agnieszka Soltys, Michal Frej, Jan Mielniczuk: Improving Lasso for model selection and prediction (2019) arXiv
  2. Shi, Yueyong; Xu, Deyi; Cao, Yongxiu; Jiao, Yuling: Variable selection via generalized SELO-penalized Cox regression models (2019)
  3. Umezu, Yuta; Shimizu, Yusuke; Masuda, Hiroki; Ninomiya, Yoshiyuki: AIC for the non-concave penalized likelihood method (2019)
  4. Adachi, Kohei; Trendafilov, Nickolay T.: Sparsest factor analysis for clustering variables: a matrix decomposition approach (2018)
  5. Choiruddin, Achmad; Coeurjolly, Jean-François; Letué, Frédérique: Convex and non-convex regularization methods for spatial point processes intensity estimation (2018)
  6. Hirose, Kei; Imada, Miyuki: Sparse factor regression via penalized maximum likelihood estimation (2018)
  7. Huang, Jian; Jiao, Yuling; Liu, Yanyan; Lu, Xiliang: A constructive approach to (L_0) penalized regression (2018)
  8. Jin, Shaobo; Moustaki, Irini; Yang-Wallentin, Fan: Approximated penalized maximum likelihood for exploratory factor analysis: an orthogonal case (2018)
  9. Li, Xingguo; Zhao, Tuo; Arora, Raman; Liu, Han; Hong, Mingyi: On faster convergence of cyclic block coordinate descent-type methods for strongly convex minimization (2018)
  10. Ročková, Veronika; George, Edward I.: The spike-and-slab LASSO (2018)
  11. Shi, Yue-Yong; Cao, Yong-Xiu; Yu, Ji-Chang; Jiao, Yu-Ling: Variable selection via generalized SELO-penalized linear regression models (2018)
  12. Shi, Yue Yong; Jiao, Yu Ling; Cao, Yong Xiu; Liu, Yan Yan: An alternating direction method of multipliers for MCP-penalized regression with high-dimensional data (2018)
  13. Shi, Yueyong; Wu, Yuanshan; Xu, Deyi; Jiao, Yuling: An ADMM with continuation algorithm for non-convex SICA-penalized regression in high dimensions (2018)
  14. Tansey, Wesley; Koyejo, Oluwasanmi; Poldrack, Russell A.; Scott, James G.: False discovery rate smoothing (2018)
  15. Wu, C. F. Jeff: A fresh look at effect aliasing and interactions: some new wine in old bottles (2018)
  16. Zhang, Shuai; Xin, Jack: Minimization of transformed (L_1) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (2018)
  17. Zhao, Tuo; Liu, Han; Zhang, Tong: Pathwise coordinate optimization for sparse learning: algorithm and theory (2018)
  18. Ahn, Miju; Pang, Jong-Shi; Xin, Jack: Difference-of-convex learning: directional stationarity, optimality, and sparsity (2017)
  19. Bryon Aragam, Jiaying Gu, Qing Zhou: Learning Large-Scale Bayesian Networks with the sparsebn Package (2017) arXiv
  20. Giuzio, Margherita: Genetic algorithm versus classical methods in sparse index tracking (2017)