Regularized Linear Programming Discriminant Rule with Folded Concave Penalty for Ultrahigh-Dimensional Data
From MaRDI portal
Publication:6180737
Cites work
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A direct estimation approach to sparse linear discriminant analysis
- Communication-efficient algorithms for statistical optimization
- Communication-efficient sparse regression
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
- High-dimensional classification using features annealed independence rules
- Nearly unbiased variable selection under minimax concave penalty
- One-step sparse estimates in nonconcave penalized likelihood models
- Some theory for Fisher's linear discriminant function, `naive Bayes', and some alternatives when there are many more variables than observations
- Sparse linear discriminant analysis by thresholding for high dimensional data
- Statistical foundations of data science
- Strong oracle optimality of folded concave penalized estimation
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Regularized Linear Programming Discriminant Rule with Folded Concave Penalty for Ultrahigh-Dimensional Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180737)
