Feature screening strategy for non-convex sparse logistic regression with log sum penalty
From MaRDI portal
Publication:6494636
DOI10.1016/J.INS.2022.12.105MaRDI QIDQ6494636
Publication date: 30 April 2024
Published in: Information Sciences (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- MLSLR: multilabel learning via sparse logistic regression
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A coordinate gradient descent method for nonsmooth separable minimization
- On Fréchet subdifferentials
- A factor graph model for unsupervised feature selection
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Detection of Cooperative Interactions in Logistic Regression Models
- Nonconvex Sparse Logistic Regression With Weakly Convex Regularization
- Gap Safe screening rules for sparsity enforcing penalties
- Safe Feature Elimination in Sparse Supervised Learning
- A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization
- Strong Rules for Discarding Predictors in Lasso-Type Problems
- Survival analysis. A self-learning text.
This page was built for publication: Feature screening strategy for non-convex sparse logistic regression with log sum penalty
