Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
From MaRDI portal
Publication:2185626
DOI10.1016/j.neunet.2019.05.011zbMath1441.62073OpenAlexW2954920938WikidataQ91992574 ScholiaQ91992574MaRDI QIDQ2185626
Publication date: 5 June 2020
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2019.05.011
DCADC programmingoptimal scoring\(\ell_{p,0}\) regularizationDC (Difference of Convex functions) approximation
Applications of statistics to biology and medical sciences; meta analysis (62P10) Optimal stochastic control (93E20) Statistical ranking and selection procedures (62F07)
Related Items (7)
Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation ⋮ Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems ⋮ Open issues and recent advances in DC programming and DCA ⋮ Online Learning Based on Online DCA and Application to Online Classification ⋮ DCA-based algorithms for DC fitting ⋮ Iteratively Reweighted Group Lasso Based on Log-Composite Regularization ⋮ Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression
Cites Work
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- DC approximation approaches for sparse optimization
- Block coordinate descent algorithms for large-scale sparse multiclass classification
- Group coordinate descent algorithms for nonconvex penalized regression
- Consistent group selection in high-dimensional linear regression
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- A bilinear formulation for vector sparsity optimization
- Sparse optimal scoring for multiclass cancer diagnosis and biomarker detection using microarray data
- Convex multi-task feature learning
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA: thirty years of developments
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Penalized discriminant analysis
- Variable selection for multicategory SVM via adaptive sup-norm regularization
- A DC programming approach for feature selection in support vector machines learning
- Pathwise coordinate optimization
- Group sparse RLS algorithms
- Learning sparse classifiers with difference of convex functions algorithms
- Flexible Discriminant Analysis by Optimal Scoring
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Joint Group Sparse PCA for Compressed Hyperspectral Imaging
- Joint Sparse Representation and Robust Feature-Level Fusion for Multi-Cue Visual Tracking
- The Joint Graphical Lasso for Inverse Covariance Estimation Across Multiple Classes
- Sparse optimization for nonconvex group penalized estimation
- Sparse solutions to linear inverse problems with multiple measurement vectors
- Model Selection and Estimation in Regression with Grouped Variables
This page was built for publication: Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring