Pathwise Coordinate Optimization for Sparse Learning: Algorithm and Theory

23 December 2014

Tong Zhang

Papers citing "Pathwise Coordinate Optimization for Sparse Learning: Algorithm and Theory"

25 / 25 papers shown

Title
Quantum Algorithms for the Pathwise Lasso J. F. Doriguello Debbie Lim Chi Seng Pun Patrick Rebentrost Tushar Vaidya 396 1 0 21 Dec 2023
The huge Package for High-dimensional Undirected Graph Estimation in R T. Zhao Han Liu Kathryn Roeder John D. Lafferty Larry A. Wasserman 43 481 0 26 Jun 2020
On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization Xingguo Li T. Zhao R. Arora Han Liu Mingyi Hong 53 15 0 10 Jul 2016
Calibrating nonconvex penalized regression in ultra-high dimension Lan Wang Yongdai Kim Runze Li 131 170 0 20 Nov 2013
Optimal computational and statistical rates of convergence for sparse nonconvex learning problems Zhaoran Wang Han Liu Tong Zhang 103 175 0 20 Jun 2013
On the Complexity Analysis of Randomized Block-Coordinate Descent Methods Zhaosong Lu Lin Xiao 83 254 0 21 May 2013
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima Po-Ling Loh Martin J. Wainwright 277 516 0 10 May 2013
Calibrated Multivariate Regression with Application to Neural Semantic Basis Discovery Han Liu Lie Wang Tuo Zhao 81 36 0 10 May 2013
Strong oracle optimality of folded concave penalized estimation Jianqing Fan Lingzhou Xue H. Zou 508 308 0 22 Oct 2012
Nonconcave penalized composite conditional likelihood estimation of sparse Ising models Lingzhou Xue H. Zou Tianxi Cai 106 88 0 17 Aug 2012
Fast and Adaptive Sparse Precision Matrix Estimation in High Dimensions Weidong Liu Xi Luo 85 83 0 17 Mar 2012
High Dimensional Semiparametric Gaussian Copula Graphical Models Han Liu Fang Han M. Yuan John D. Lafferty Larry A. Wasserman 84 407 0 10 Feb 2012
A General Theory of Concave Regularization for High Dimensional Sparse Estimation Problems Cun-Hui Zhang Tong Zhang 187 341 0 25 Aug 2011
Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function Peter Richtárik Martin Takáč 91 770 0 14 Jul 2011
Multi-stage Convex Relaxation for Feature Selection Tong Zhang 97 112 0 03 Jun 2011
Strong rules for discarding predictors in lasso-type problems Robert Tibshirani Jacob Bien J. Friedman Trevor Hastie N. Simon Jonathan E. Taylor Robert Tibshirani 180 640 0 09 Nov 2010
Variable selection in nonparametric additive models Jian Huang J. Horowitz Fengrong Wei 245 550 0 20 Oct 2010
A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers S. Negahban Pradeep Ravikumar Martin J. Wainwright Bin Yu 467 1,378 0 13 Oct 2010
Oracle Inequalities and Optimal Inference under Group Sparsity Karim Lounici Massimiliano Pontil Alexandre B. Tsybakov Sara van de Geer 280 382 0 11 Jul 2010
Nearly unbiased variable selection under minimax concave penalty Cun-Hui Zhang 332 3,562 0 25 Feb 2010
$Minimax rates of estimation for high-dimensional linear regression over $\ell_q$-balls$ Minimax rates of estimation for high-dimensional linear regression over $\ell_q$ -balls Garvesh Raskutti Martin J. Wainwright Bin Yu 220 575 0 11 Oct 2009
Rejoinder: One-step sparse estimates in nonconcave penalized likelihood models H. Zou Runze Li 273 1,234 0 07 Aug 2008
The sparsity and bias of the Lasso selection in high-dimensional linear regression Cun-Hui Zhang Jian Huang 466 869 0 07 Aug 2008
Simultaneous analysis of Lasso and Dantzig selector Peter J. Bickel Yaácov Ritov Alexandre B. Tsybakov 527 2,530 0 07 Jan 2008
Pathwise coordinate optimization J. Friedman Trevor Hastie Holger Hofling Robert Tibshirani 258 2,053 0 10 Aug 2007