The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Elastic-net regularization in learning theory
Open accessAbstract
Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie [H. Zou, T. Hastie, Regularization and variable selection via the elastic net, J. R. Stat. Soc. Ser. B, 67(2) (2005) 301-320] for the selection of groups of correlated variables. To investigate the statistical properties of this scheme and in particular its consistency properties, we set up a suitable mathematical framework. Our setting is random-design regression where we allow the response variable to be vector-valued and we consider prediction functions which are linear combinations of elements (features) in an infinite-dimensional dictionary. Under the assumption that the regression function admits a sparse representation on the dictionary, we prove that there exists a particular ''elastic-net representation'' of the regression function such that, if the number of data increases, the elastic-net estimator is consistent not only for prediction but also for variable/feature selection. Our results include finite-sample bounds and an adaptive scheme to select the regularization parameter. Moreover, using convex analysis tools, we derive an iterative thresholding algorithm for computing the elastic-net solution which is different from the optimization procedure originally proposed in the above-cited work.
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
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Model 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
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Self-citationThe 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
Asymptotics for lasso-type estimators
Fu, W., & Knight, K. (2000) · The Annals of Statistics · doi:10.1214/aos/1015957397 · Cited by 1,276
Penalized Regressions: The Bridge versus the Lasso
Fu, W. J. (1998) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1998.10474784 · Cited by 1,092
Learning Multiple Tasks with Kernel Methods
Evgeniou, T., Micchelli, C. A., & Pontil, M. (2005) · doi:10.5555/1046920.1088693 · Cited by 799
Optimal Rates for the Regularized Least-Squares Algorithm
Caponnetto, A., & De Vito, E. (2007) · Foundations of Computational Mathematics · doi:10.1007/s10208-006-0196-8 · Cited by 564
Self-citationLearning Theory Estimates via Integral Operators and Their Approximations
Smale, S., & Zhou, D. (2007) · Constructive Approximation · doi:10.1007/s00365-006-0659-y · Cited by 555
On a Problem of Adaptive Estimation in Gaussian White Noise
Lepski, O. (1991) · Theory of Probability and Its Applications · doi:10.1137/1135065 · Cited by 495
On Learning Vector-Valued Functions
Micchelli, C. A., & Pontil, M. (2005) · Neural Computation · doi:10.1162/0899766052530802 · Cited by 494
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
Approximation and learning by greedy algorithms
Barron, A. R., Cohen, A., Dahmen, W., & DeVore, R. A. (2008) · The Annals of Statistics · doi:10.1214/009053607000000631 · Cited by 305
On regularization algorithms in learning theory
Bauer, F., Pereverzev, S., & Rosasco, L. (2007) · Journal of Complexity · doi:10.1016/j.jco.2006.07.001 · Cited by 262
Self-citationRecovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
Fornasier, M., & Rauhut, H. (2008) · SIAM Journal on Numerical Analysis · doi:10.1137/0606668909 · Cited by 233
VECTOR VALUED REPRODUCING KERNEL HILBERT SPACES OF INTEGRABLE FUNCTIONS AND MERCER THEOREM
Carmeli, C., Vito, E. D., & Toigo, A. (2006) · Analysis and Applications · doi:10.1142/s0219530506000838 · Cited by 210
Feature selection for high-dimensional data
Destrero, A., Mosci, S., Mol, C. D., Verri, A., & Odone, F. (2008) · Computational Management Science · doi:10.1007/s10287-008-0070-7 · Cited by 84
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
Classifiers of support vector machine type with \ell1 complexity regularization
Tarigan, B., & van de Geer, S. (2006) · Bernoulli · doi:10.3150/bj/1165269150 · Cited by 47
A Sparsity-Enforcing Method for Learning Face Features
Destrero, A., Mol, C. D., Odone, F., & Verri, A. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2007610 · Cited by 38
Wavelet kernel penalized estimation for non-equispaced design regression
Amato, U., Antoniadis, A., & Pensky, M. (2006) · Statistics and Computing · doi:10.1007/s11222-006-5283-4 · Cited by 33
Adaptive estimation with soft thresholding penalties
Loubes, J., & van de Geer, S. A. (2002) · Statistica Neerlandica · doi:10.1111/1467-9574.00212 · Cited by 17
A Regularized Approach to Feature Selection for Face Detection
Destrero, A., Mol, C. D., Odone, F., & Verri, A. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-76390-1_86 · Cited by 16
Cited by
Digital twin: values, challenges and enablers from a modeling perspective
Rasheed, A., San, O., & Kvamsdal, T. (2020) · IEEE Access · doi:10.1109/access.2020.2970143 · Cited by 1,952
Empirical Asset Pricing via Machine Learning
Gu, S., Kelly, B., & Xiu, D. (2018) · National Bureau of Economic Research · doi:10.3386/w25398 · Cited by 378
Factors associated with healthy aging in Latin American populations
Santamaria-Garcia, H., Sainz-Ballesteros, A., Hernandez, H., Moguilner, S., Maito, M., Ochoa-Rosales, C., Corley, M., Valcour, V., Miranda, J. J., Lawlor, B., et al. (2023) · Nature Medicine · doi:10.1038/s41591-023-02495-1 · Cited by 141
Digital Twin: Values, Challenges and Enablers
Rasheed, A., San, O., & Kvamsdal, T. (2019) · arXiv · doi:10.48550/arxiv.1910.01719 · Cited by 81
Empirical Asset Pricing via Machine Learning
Gu, S., Kelly, B. T., & Xiu, D. (2018) · The Review of Financial Studies · doi:10.2139/ssrn.3159577 · Cited by 52
Metadata
- Authors
- De Mol, C., De Vito, E., & Rosasco, L.
- Venue
- Journal of Complexity
- Publisher
- Elsevier BV
- Published
- 2009-04
- Volume
- 25
- Issue
- 2
- Pages
- 201-230
- ISSN
- 0885-064X (ISSN-L)
- OpenAlex
- W1589987009
- Cited by
- 323
- References
- 26
- FWCI
- 11.75
- 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.