Estimation of \(l_0\) norm penalized models: a statistical treatment
From MaRDI portal
Publication:6554254
DOI10.1016/j.csda.2023.107902zbMATH Open1543.62231MaRDI QIDQ6554254
Yuyuan Ouyang, Christopher S. McMahan, Yu-Bo Wang, Yuan Yang
Publication date: 12 June 2024
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Nearly unbiased variable selection under minimax concave penalty
- The Adaptive Lasso and Its Oracle Properties
- Best subset selection via a modern optimization lens
- DC approximation approaches for sparse optimization
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- A majorization-minimization approach to variable selection using spike and slab priors
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Double regularization methods for robust feature selection and SVM classification via DC programming
- On the distribution of penalized maximum likelihood estimators: the LASSO, SCAD, and thresholding
- Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
- Bayesian regularized quantile regression
- OR Forum—An Algorithmic Approach to Linear Regression
- Penalized Generalized Estimating Equations for High-Dimensional Longitudinal Data Analysis
- Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation
- Penalized Estimating Equations
- Regularized Estimation in the Accelerated Failure Time Model with High-Dimensional Covariates
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Complexity of penalized likelihood estimation
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- The Group Lasso for Logistic Regression
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparsity and Smoothness Via the Fused Lasso
- 10.1162/153244303322753751
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- Generalized double Pareto shrinkage
- Likelihood-Based Selection and Sharp Parameter Estimation
- Model selection procedure for high‐dimensional data
- Regularization and Variable Selection Via the Elastic Net
- Adaptive greedy approximations
- The Elements of Statistical Learning
This page was built for publication: Estimation of \(l_0\) norm penalized models: a statistical treatment