The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
L 1-Regularization Path Algorithm for Generalized Linear Models
Abstract
Summary: We introduce a path following algorithm for L1-regularized generalized linear models. The L1-regularization procedure is useful especially because it, in effect, selects variables according to the amount of penalization on the L1-norm of the coefficients, in a manner that is less greedy than forward selection–backward deletion. The generalized linear model path algorithm efficiently computes solutions along the entire regularization path by using the predictor–corrector method of convex optimization. Selecting the step length of the regularization parameter is critical in controlling the overall accuracy of the paths; we suggest intuitive and flexible strategies for choosing appropriate values. We demonstrate the implementation with several simulated and real data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Regression Models and Life-Tables
Cox, D. R. (1972) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1972.tb00899.x · Cited by 39,793
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Self-citationMcCullagh, P., & Nelder, J. A. (1989) · doi:10.1007/978-1-4899-3242-6 · Cited by 16,836
A solution to the problem of separation in logistic regression
Heinze, G., & Schemper, M. (2002) · Statistics in Medicine · doi:10.1002/sim.1047 · Cited by 2,711
Cited by
Variable selection using random forests
Genuer, R., Poggi, J.-M., & Tuleau-Malot, C. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2010.03.014 · Cited by 2,619
Single subject prediction of brain disorders in neuroimaging: Promises and pitfalls
Arbabshirani, M. R., Plis, S., Sui, J., & Calhoun, V. D. (2017) · NeuroImage · doi:10.1016/j.neuroimage.2016.02.079 · Cited by 912
High-Dimensional Methods and Inference on Structural and Treatment Effects
Belloni, A., Chernozhukov, V., & Hansen, C. (2014) · Journal of Economic Perspectives · doi:10.1257/jep.28.2.29 · Cited by 722
A significance test for the lasso
Lockhart, R., Taylor, J., Tibshirani, R. J., & Tibshirani, R. (2014) · The Annals of Statistics · doi:10.1214/13-aos1175 · Cited by 541
Yao, J., Zhu, X., Jonnagaddala, J., Hawkins, N., & Huang, J. (2020) · Medical Image Analysis · doi:10.1016/j.media.2020.101789 · Cited by 522
Rosenthal, S. B., Twomey, C. R., Hartnett, A. T., Wu, H. S., & Couzin, I. D. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1420068112 · Cited by 474
Conditional random fields for activity recognition
Vail, D. L., Veloso, M. M., & Lafferty, J. D. (2007) · Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems · doi:10.1145/1329125.1329409 · Cited by 357
Muchlinski, D., Siroky, D., He, J., & Kocher, M. (2016) · Political Analysis · doi:10.1093/pan/mpv024 · Cited by 234
Kautzky, A., Dold, M., Bartova, L., Spies, M., Kranz, G. S., Souery, D., Montgomery, S., Mendlewicz, J., Zohar, J., Fabbri, C., et al. (2019) · Acta Psychiatrica Scandinavica · doi:10.1111/acps.12959 · Cited by 148
Association screening of common and rare genetic variants by penalized regression
Zhou, H., Sehl, M. E., Sinsheimer, J. S., & Lange, K. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq448 · Cited by 137
Time to recurrence and survival in serous ovarian tumors predicted from integrated genomic profiles
Mankoo, P. K., Shen, R., Schultz, N., Levine, D. A., & Sander, C. (2011) · PLoS ONE · doi:10.1371/journal.pone.0024709 · Cited by 104
A meta-learning approach for genomic survival analysis
Qiu, Y. L., Zheng, H., Devos, A., Selby, H., & Gevaert, O. (2020) · Nature Communications · doi:10.1038/s41467-020-20167-3 · Cited by 96
A generalized Dantzig selector with shrinkage tuning
James, G. M., & Radchenko, P. (2009) · Biometrika · doi:10.1093/biomet/asp013 · Cited by 67
Guo, W., & Lin, S. (2009) · Genetic Epidemiology · doi:10.1002/gepi.20382 · Cited by 51
A group lasso based sparse KNN classifier
Zheng, S., & Ding, C. (2020) · Pattern Recognition Letters · doi:10.1016/j.patrec.2019.12.020 · Cited by 22
Murtojärvi, M., Halkola, A. S., Airola, A., Laajala, T. D., Mirtti, T., Aittokallio, T., & Pahikkala, T. (2020) · International Journal of Medical Informatics · doi:10.1016/j.ijmedinf.2019.104014 · Cited by 14
Std-net: spatio-temporal decomposition network for video demoiréing with sparse transformers
Niu, Y., Xu, R., Lin, Z., & Liu, W. (2024) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2024.3386604 · Cited by 12
Multi-cohort machine learning identifies predictors of cognitive impairment in Parkinson’s disease
Loo, R. T. J., Pavelka, L., Mangone, G., Khoury, F., Vidailhet, M., Corvol, J.-C., Glaab, E., On behalf of the NCER-PD Consortium, Acharya, G., Aguayo, G., et al. (2025) · npj Digital Medicine · doi:10.1038/s41746-025-01862-1 · Cited by 9
Metadata
- Authors
- Park, M. Y., & Hastie, T.
- Venue
- Journal of the Royal Statistical Society Series B: Statistical Methodology
- Publisher
- Oxford University Press (OUP)
- Published
- 2007-08-07
- Volume
- 69
- Issue
- 4
- Pages
- 659-677
- ISSN
- 1369-7412 (ISSN-L)
- 1467-9868
- OpenAlex
- W2101095383
- Cited by
- 838
- References
- 5
- FWCI
- 55.56
- Type
- journal article
- Language
- en
- Open access
- closed
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.
