Best subset selection for high-dimensional non-smooth models using iterative hard thresholding

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Nearly unbiased variable selection under minimax concave penalty
Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
Pegasos: primal estimated sub-gradient solver for SVM
Lectures on convex optimization
Fast global convergence of gradient methods for high-dimensional statistical recovery
One-step sparse estimates in nonconcave penalized likelihood models
Support-vector networks
Weak convergence and empirical processes. With applications to statistics
Least squares after model selection in high-dimensional sparse models
\(\ell_1\)-penalized quantile regression in high-dimensional sparse models
The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
Atomic Decomposition by Basis Pursuit
Estimation of Extreme Conditional Quantiles Through Power Transformation
Regression Quantiles
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
High-Dimensional Statistics
Sparse Approximate Solutions to Linear Systems
Estimation of High Conditional Quantiles for Heavy-Tailed Distributions
Likelihood-Based Selection and Sharp Parameter Estimation
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima
Variable Selection for Support Vector Machines in Moderately High Dimensions
Joint tracking of multiple quantiles through conditional quantiles

This page was built for publication: Best subset selection for high-dimensional non-smooth models using iterative hard thresholding