Method evidence record
MCP Penalized Regression
MCP (Minimax Concave Penalty) is a variable selection method developed by Zhang (2010) that uses a concave penalty function for automated feature selection. Like SCAD, MCP addresses bias in lasso by avoiding shrinkage of large coefficients, but uses a different penalty shape that is computationally simpler than SCAD.
Source record
Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.
Minimax Concave Penalty Penalized Regression
Taxonomic method record · latent-structure / psychometrics
- Zhang, C. H. (2010). Nearly unbiased variable selection under minimax concave penalty. Annals of Statistics, 38(2), 894-942. · DOI 10.1214/09-AOS729
- Breheny, P., & Huang, J. (2011). Coordinate descent algorithms for nonconvex penalized regression. Annals of Applied Statistics, 5(1), 232-253. · URL
- Zhang, C. H., & Zhang, T. (2012). A general theory of concave regularized M-estimators. Statistical Science, 27(4), 506-537. · URL
Curated claims
Claims persisted in the evidence ledger, each with its own assessment.
No curated claims yet
This view does not invent a claim assessment when the ledger has none.
Related methods
Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.