The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
The Generalized LASSO
Abstract
In the last few years, the support vector machine (SVM) method has motivated new interest in kernel regression techniques. Although the SVM has been shown to exhibit excellent generalization properties in many experiments, it suffers from several drawbacks, both of a theoretical and a technical nature: the absence of probabilistic outputs, the restriction to Mercer kernels, and the steep growth of the number of support vectors with increasing size of the training set. In this paper, we present a different class of kernel regressors that effectively overcome the above problems. We call this approach generalized LASSO regression. It has a clear probabilistic interpretation, can handle learning sets that are corrupted by outliers, produces extremely sparse solutions, and is capable of dealing with large-scale problems. For regression functionals which can be modeled as iteratively reweighted least-squares (IRLS) problems, we present a highly efficient algorithm with guaranteed global convergence. This defies a unique framework for sparse regression models in the very rich class of IRLS models, including various types of robust regression models and logistic regression. Performance studies for many standard benchmark datasets effectively demonstrate the advantages of this model over related approaches.
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
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Ridge regression: Biased estimation for nonorthogonal problems
Hoerl, A. E., & Kennard, R. W. (1970) · Technometrics · doi:10.1080/00401706.1970.10488634 · Cited by 9,648
Multivariate Adaptive Regression Splines
Friedman, J. H. (1991) · The Annals of Statistics · doi:10.1214/aos/1176347963 · Cited by 8,000
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
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
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
Least Squares Support Vector Machines
Suykens, J. A. K., Van Gestel, T., De Brabanter, J., De Moor, B., & Vandewalle, J. (2002) · WORLD SCIENTIFIC eBooks · doi:10.1142/5089 · Cited by 3,642
An introduction to kernel-based learning algorithms
Muller, K.-R., Mika, S., Ratsch, G., Tsuda, K., & Scholkopf, B. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.914517 · Cited by 3,473
Ridge Regression: Applications to Nonorthogonal Problems
Hoerl, A. E., & Kennard, R. W. (1970) · Technometrics · doi:10.1080/00401706.1970.10488635 · Cited by 2,956
Ridge Regression: Biased Estimation for Nonorthogonal Problems
Hoerl, A. E., & Kennard, R. W. (1970) · Technometrics · doi:10.2307/1267351 · Cited by 1,955
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/15324430152748236 · Cited by 1,819
Weighted least squares support vector machines: robustness and sparse approximation
Suykens, J. A. K., De Brabanter, J., Lukas, L., & Vandewalle, J. (2002) · Neurocomputing · doi:10.1016/s0925-2312(01)00644-0 · Cited by 1,265
Least Squares Support Vector Machines
Suykens, J. A. K., Gestel, T. V., Brabanter, J. D., Moor, B. D., & Vandewalle, J. P. L. (2002) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812776655 · Cited by 1,166
Tipping, M. E. (1999) · Cited by 912
A new approach to variable selection in least squares problems
Osborne, M. (2000) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/20.3.389 · Cited by 859
Linear and Non Linear Programming
Nash, S. G. (1996) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 841
Ridge Regression Learning Algorithm in Dual Variables
Saunders, C. J., Gammerman, A., & Vovk, V. (1998) · ePrints Soton (University of Southampton) · Cited by 811
Ridge Regression: Biased Estimation for Nonorthogonal Problems
Hoerl, A. E., & Kennard, R. W. (2000) · Technometrics · doi:10.1080/00401706.2000.10485983 · Cited by 808
Linear and nonlinear programming
(2005) · Economists’ Mathematical Manual · doi:10.1007/3-540-28518-0_15 · Cited by 766
Osborne, M. R., Presnell, B., & Turlach, B. A. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474883 · Cited by 696
Prediction with Gaussian Processes: From Linear Regression to Linear Prediction and Beyond
Williams, C. K. I. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_23 · Cited by 659
Improving Regressors using Boosting Techniques
Drucker, H. (1997) · International Conference on Machine Learning · Cited by 650
Nonlinear Programming : Theory And Algorithms
Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (1979) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 356
Analysis of Sparse Bayesian Learning
Faul, A. C., & Tipping, M. E. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0054 · Cited by 287
Nonlinear Discriminant Analysis Using Kernel Functions
Röth, V., & Steinhage, V. (1999) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 227
Bayesian Non-Linear Modeling for the Prediction Competition
Mackay, D. (1996) · Springer eBooks · doi:10.1007/978-94-015-8729-7_18 · Cited by 143
A Probabilistic Framework for SVM Regression and Error Bar Estimation
Gao, J., Gunn, S. R., Harris, C. J., et al. (2002) · Machine Learning · doi:10.1023/a:1012494009640 · Cited by 135
Least Absolute Shrinkage is Equivalent to Quadratic Penalization
Grandvalet, Y. (1998) · Perspectives in neural computing · doi:10.1007/978-1-4471-1599-1_27 · Cited by 104
Efficient training of RBF networks for classification
Nabney, I. T. (1999) · International Conference on Artificial Neural Networks · doi:10.1049/cp:19991110 · Cited by 79
Navia-Vázquez, A., Pérez‐Cruz, F., Artés-Rodríguez, A., & Figueiras-Vidal, A. R. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.950134 · Cited by 79
Bayesian learning of sparse classifiers
Figueiredo, M. A. T., & Jain, A. K. (2005) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2001.990453 · Cited by 65
On the Noise Model of Support Vector Machines Regression
Pontil, M., Mukherjee, S., & Girosi, F. (2000) · Lecture notes in computer science · doi:10.1007/3-540-40992-0_24 · Cited by 59
Anisotropic noise injection for input variables relevance determination
Grandvalet, Y. (2000) · IEEE Trans. Neural Networks Learn. Syst. · doi:10.1109/72.883393 · Cited by 24
Bayesian prediction with adaptive ridge estimators
Denison, D. G. T., & George, E. I. (2012) · Institute of Mathematical Statistics collections · doi:10.1214/11-imscoll815 · Cited by 3
(1998)
Cited by
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
Graph Regularized Sparse Coding for Image Representation
Zheng, M., Bu, J., Chen, C., Wang, C., Zhang, L., Qiu, G., & Cai, D. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2090535 · Cited by 562
Hyperspectral Image Classification via Kernel Sparse Representation
Chen, Y., Nasrabadi, N. M., & Tran, T. D. (2013) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2012.2201730 · Cited by 514
Local-Learning-Based Feature Selection for High-Dimensional Data Analysis
Sun, Y., Todorovic, S., & Goodison, S. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.190 · Cited by 347
High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso
Yamada, M., Jitkrittum, W., Sigal, L., Xing, E. P., & Sugiyama, M. (2014) · Neural Computation · doi:10.1162/neco_a_00537 · Cited by 304
Metadata
- Authors
- Roth, V.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2004-01
- Volume
- 15
- Issue
- 1
- Pages
- 16-28
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2145473366
- Cited by
- 322
- References
- 38
- FWCI
- 7.22
- 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.