The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
High-dimensional additive modeling
Open accessAbstract
We propose a new sparsity-smoothness penalty for high-dimensional generalized additive models. The combination of sparsity and smoothness is crucial for mathematical theory as well as performance for finite-sample data. We present a computationally efficient algorithm, with provable numerical convergence properties, for optimizing the penalized likelihood. Furthermore, we provide oracle results which yield asymptotic optimality of our estimator for high dimensional but sparse additive models. Finally, an adaptive version of our sparsity-smoothness penalized approach yields large additional performance gains.
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
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470 · cited 2×
“Similar to the adaptive lasso [34], we can also use different penalties for the different components, that is, use a penalty of the form J (fj ) = λ1 √ w1,j‖fj‖2n + λ2w2,j I (2)(fj ), where the weights w1,j and w2,j are ideally chosen in a data-adaptive way.”
BackgroundMethodModel Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
Weak Convergence and Empirical Processes
van der Vaart, A. W., & Wellner, J. A. (1996) · Springer Series in Statistics · doi:10.1007/978-1-4757-2545-2 · Cited by 5,014
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
High dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · Cited by 2,539
Self-citationHigh-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521 · cited 1×
“The theoretical properties of penalization approaches like the lasso [28] are now well understood [3, 14, 23, 24, 33] and this knowledge has led to several extensions or alternative approaches like adaptive lasso [34], relaxed lasso [22], sure independence screening [12] and graphical model based methods [6].”
BackgroundSelf-citationSimultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
Nonparametric Regression and Generalized Linear Models
Green, P. J., & Silverman, B. W. (1994) · Springer eBooks · doi:10.1007/978-1-4899-4473-3 · Cited by 1,925
The Dantzig selector: Statistical estimation when p is much larger than n
Candes, E., & Tao, T. (2007) · The Annals of Statistics · doi:10.1214/009053606000001523 · Cited by 1,747
The Group Lasso for Logistic Regression
Meier, L., Van De Geer, S., & Bühlmann, P. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2007.00627.x · Cited by 1,674
Self-citationLectures on Elliptic Boundary Value Problems
Agmon, S. (2010) · American Mathematical Society eBooks · doi:10.1090/chel/369 · Cited by 1,351
Ledoux, M., & Talagrand, M. (1991) · doi:10.1007/978-3-642-20212-4 · Cited by 1,160
Empirical Processes in M-Estimation
van de Geer, S. (2000) · Cited by 1,108
Nonparametric and Semiparametric Models
Härdle, W., Werwatz, A., Müller, M., & Sperlich, S. (2004) · Springer Series in Statistics · doi:10.1007/978-3-642-17146-8 · Cited by 1,061
Boosting With the L2Loss: Regression and Classification
Bühlmann, P., & Yu, B. (2003) · Journal of the American Statistical Association · doi:10.1198/016214503000125 · Cited by 845
Self-citationLasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2006) · Cited by 744
Boosting Algorithms: Regularization, Prediction and Model Fitting
Bühlmann, P., & Hothorn, T. (2007) · Statistical Science · doi:10.1214/07-sts242 · Cited by 726
Self-citationBOOSTING ALGORITHMS: REGULARIZATION, PREDICTION AND MODEL FITTINGPreprint
Bühlmann, P., & Hothorn, T. (2007) · Cited by 705
Self-citationOsborne, M. R., Presnell, B., & Turlach, B. A. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474883 · Cited by 696
Liu, X. S., Brutlag, D. L., & Liu, J. S. (2002) · Nature Biotechnology · doi:10.1038/nbt717 · Cited by 667
Component selection and smoothing in multivariate nonparametric regression
Lin, Y., & Zhang, H. H. (2006) · The Annals of Statistics · doi:10.1214/009053606000000722 · Cited by 550
The sparsity and bias of the Lasso selection in high-dimensional linear regression
Zhang, C.-H., & Huang, J. (2008) · The Annals of Statistics · doi:10.1214/07-aos520 · Cited by 506
Meinshausen, N. (2007) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2006.12.019 · Cited by 492
Lasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2009) · The Annals of Statistics · doi:10.1214/07-aos582 · Cited by 489
High-dimensional generalized linear models and the lasso
van de Geer, S. A. (2008) · The Annals of Statistics · doi:10.1214/009053607000000929 · Cited by 414
Self-citationSparsity oracle inequalities for the Lasso
Bunea, F., Tsybakov, A. B., & Wegkamp, M. H. (2007) · HAL · Cited by 389
Persistence in high-dimensional linear predictor selection and the virtue of overparametrization
Greenshtein, E., & Ritov, Y. (2004) · Bernoulli · doi:10.3150/bj/1106314846 · Cited by 362
Integrating regulatory motif discovery and genome-wide expression analysis
Conlon, E. M., Liu, X. S., Lieb, J. D., & Liu, J. S. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0630591100 · Cited by 343 · cited 1×
“In motif regression problems [11], the aim is to predict gene expression levels or binding intensities based on information on the DNA sequence.”
BackgroundA Bennett concentration inequality and its application to suprema of empirical processes
Bousquet, O. (2002) · Comptes Rendus. Mathématique · doi:10.1016/s1631-073x(02)02292-6 · Cited by 262
Sparsity oracle inequalities for the Lasso
Bunea, F., Tsybakov, A., & Wegkamp, M. (2007) · Electronic Journal of Statistics · doi:10.1214/07-ejs008 · Cited by 253
Bühlmann, P., Kalisch, M., & Maathuis, M. H. (2010) · Biometrika · doi:10.1093/biomet/asq008 · Cited by 143
Self-citationModel selection for regression on a random design
Baraud, Y. (2002) · ESAIM Probability and Statistics · doi:10.1051/ps:2002007 · Cited by 121
Aggregation and Sparsity Via ℓ1 Penalized Least Squares
Bunea, F., Tsybakov, A. B., & Wegkamp, M. H. (2006) · Lecture notes in computer science · doi:10.1007/11776420_29 · Cited by 79
Sardy, S., & Tseng, P. (2004) · Journal of Computational and Graphical Statistics · doi:10.1198/1061860043434 · Cited by 38
Cited by
Interpretable machine learning: Fundamental principles and 10 grand challenges
Rudin, C., Chen, C., Chen, Z., Huang, H., Semenova, L., & Zhong, C. (2022) · Statistics Surveys · doi:10.1214/21-ss133 · Cited by 958
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
Nonparametric Independence Screening in Sparse Ultra-High-Dimensional Additive Models
Fan, J., Feng, Y., & Song, R. (2011) · Journal of the American Statistical Association · doi:10.1198/jasa.2011.tm09779 · Cited by 540
Variable selection in nonparametric additive models
Huang, J., Horowitz, J. L., & Wei, F. (2010) · The Annals of Statistics · doi:10.1214/09-aos781 · Cited by 537
Koltchinskii, V. (2011) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-22147-7 · Cited by 346
Metadata
- Authors
- Meier, L., van de Geer, S., & Bühlmann, P.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2009-12-01
- Volume
- 37
- Issue
- 6B
- Pages
- 3779-3821
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2093994886
- Cited by
- 458
- References
- 35
- FWCI
- 20.77
- Type
- journal article
- Language
- en
- Open access
- green
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.