The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Variable selection using MM algorithms
Open accessAbstract
Variable selection is fundamental to high-dimensional statistical modeling. Many variable selection techniques may be implemented by maximum penalized likelihood using various penalty functions. Optimizing the penalized likelihood function is often challenging because it may be nondifferentiable and/or nonconcave. This article proposes a new class of algorithms for finding a maximizer of the penalized likelihood for a broad class of penalty functions. These algorithms operate by perturbing the penalty function slightly to render it differentiable, then optimizing this differentiable function using a minorize-maximize (MM) algorithm. MM algorithms are useful extensions of the well-known class of EM algorithms, a fact that allows us to analyze the local and global convergence of the proposed algorithm using some of the techniques employed for EM algorithms. In particular, we prove that when our MM algorithms converge, they must converge to a desirable point; we also discuss conditions under which this convergence may be guaranteed. We exploit the Newton-Raphson-like aspect of these algorithms to propose a sandwich estimator for the standard errors of the estimators. Our method performs well in numerical tests.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Fan, J., & Li, R. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753382273 · Cited by 8,900
Self-citationCraven, P., & Wahba, G. (1978) · Numerische Mathematik · doi:10.1007/bf01404567 · Cited by 3,388
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
COX, D. R. (1975) · Biometrika · doi:10.1093/biomet/62.2.269 · Cited by 2,292
A Statistical View of Some Chemometrics Regression Tools
Frank, L. E., & Friedman, J. H. (1993) · Technometrics · doi:10.1080/00401706.1993.10485033 · Cited by 2,213
Nonconcave penalized likelihood with a diverging number of parameters
Fan, J., & Peng, H. (2004) · The Annals of Statistics · doi:10.1214/009053604000000256 · Cited by 1,002
Subset Selection in Regression
Miller, A. (2002) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035933 · Cited by 929
Optimization Transfer Using Surrogate Objective Functions
Lange, K., Hunter, D. R., & Yang, I. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474858 · Cited by 808
Self-citation
Cited by
Nearly unbiased variable selection under minimax concave penalty
Zhang, C.-H. (2010) · The Annals of Statistics · doi:10.1214/09-aos729 · Cited by 3,835
Sure Independence Screening for Ultrahigh Dimensional Feature Space
Fan, J., & Lv, J. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2008.00674.x · Cited by 2,711
Challenges of Big Data analysis
Fan, J., Han, F., & Liu, H. (2014) · National Science Review · doi:10.1093/nsr/nwt032 · Cited by 1,482
One-step sparse estimates in nonconcave penalized likelihood models
Zou, H., & Li, R. (2008) · The Annals of Statistics · doi:10.1214/009053607000000802 · Cited by 683
Self-citationSparse permutation invariant covariance estimation
Rothman, A. J., Bickel, P. J., Levina, E., & Zhu, J. (2008) · Electronic Journal of Statistics · doi:10.1214/08-ejs176 · Cited by 560
Asymptotic properties of bridge estimators in sparse high-dimensional regression models
Huang, J., Horowitz, J. L., & Ma, S. (2008) · The Annals of Statistics · doi:10.1214/009053607000000875 · Cited by 482
Hanif, M. F., Ding, Z., Ratnarajah, T., & Karagiannidis, G. K. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2480042 · Cited by 403
Network exploration via the adaptive LASSO and SCAD penalties
Fan, J., Feng, Y., & Wu, Y. (2009) · The Annals of Applied Statistics · doi:10.1214/08-aoas215 · Cited by 397
Forward Regression for Ultra-High Dimensional Variable Screening
Wang, H. (2009) · Journal of the American Statistical Association · doi:10.1198/jasa.2008.tm08516 · Cited by 366
Sparse estimation of a covariance matrix
Bien, J., & Tibshirani, R. J. (2011) · Biometrika · doi:10.1093/biomet/asr054 · Cited by 342
A group bridge approach for variable selection
Huang, J., Ma, S., Xie, H., & Zhang, C.-H. (2009) · Biometrika · doi:10.1093/biomet/asp020 · Cited by 324
Strong oracle optimality of folded concave penalized estimation
Fan, J., Xue, L., & Zou, H. (2014) · The Annals of Statistics · doi:10.1214/13-aos1198 · Cited by 313
Kai, B., Li, R., & Zou, H. (2011) · The Annals of Statistics · doi:10.1214/10-aos842 · Cited by 301
Self-citationVariable selection in semiparametric regression modeling
Li, R., & Liang, H. (2008) · The Annals of Statistics · doi:10.1214/009053607000000604 · Cited by 296
Self-citationA General Theory of Concave Regularization for High-Dimensional Sparse Estimation Problems
Zhang, C.-H., & Zhang, T. (2012) · Statistical Science · doi:10.1214/12-sts399 · Cited by 296
Regularization Parameter Selections via Generalized Information Criterion
Zhang, Y., Li, R., & Tsai, C.-L. (2010) · Journal of the American Statistical Association · doi:10.1198/jasa.2009.tm08013 · Cited by 293
Self-citationShrinkage Estimation of the Varying Coefficient Model
Wang, H., & Xia, Y. (2009) · Journal of the American Statistical Association · doi:10.1198/jasa.2009.0138 · Cited by 261
A unified approach to model selection and sparse recovery using regularized least squares
Lv, J., & Fan, Y. (2009) · The Annals of Statistics · doi:10.1214/09-aos683 · Cited by 252
Yang, S., Kim, J. K., & Song, R. (2020) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12354 · Cited by 73
Metadata
- Authors
- Hunter, D. R., & Li, R.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2005-08-01
- Volume
- 33
- Issue
- 4
- Pages
- 1617-1642
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2155628440
- Cited by
- 338
- References
- 21
- FWCI
- 6.24
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.