Predictive low-rank decomposition for kernel methods
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black boxes---the decomposition of the kernel matrix that they deliver is independent of the specific learning task at hand---and this is a potentially significant source of inefficiency. In this paper, we present an algorithm that can exploit side information (e.g., classification labels, regression responses) in the computation of low-rank decompositions for kernel matrices. Our algorithm has the same favorable scaling as state-of-the-art methods such as incomplete Cholesky decomposition---it is linear in the number of data points and quadratic in the rank of the approximation. We present simulation results that show that our algorithm yields decompositions of significantly smaller rank than those found by incomplete Cholesky decomposition.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703 · cited 2×
“Kernel methods provide a unifying framework for the design and analysis of machine learning algorithms (Schölkopf and Smola, 2001, Shawe-Taylor and Cristianini, 2004).”
MethodLeast Squares Support Vector Machine Classifiers
Suykens, J. A. K., & Vandewalle, J. (1999) · Neural Processing Letters · doi:10.1023/a:1018628609742 · Cited by 9,362 · cited 5×
“This is a classical penalized least-squares problem, whose estimating equations are obtained by setting the derivatives to zero: Expressed in terms of G, the estimating Predictive low-rank decomposition for kernel methods tions for the LS-SVM become: G(G Π n G + nτ Id m )G α = GG Π n Y (11) b = 1 n (−1 n GG α + 1 n Y…”
MethodInfluentialKernel Methods for Pattern Analysis
Shawe-Taylor, J., & Cristianini, N. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809682 · Cited by 6,587 · cited 3×
“Kernel methods provide a unifying framework for the design and analysis of machine learning algorithms (Schölkopf and Smola, 2001, Shawe-Taylor and Cristianini, 2004).”
BackgroundMethodEfficient svm training using low-rank kernel representations
Fine, S., & Scheinberg, K. (2002) · Journal of Machine Learning Research · doi:10.5555/944790.944812 · Cited by 699
Sparse Greedy Matrix Approximation for Machine Learning
Smola, A. J., & Schökopf, B. (2000) · doi:10.5555/645529.657980 · Cited by 574
The Effect of the Input Density Distribution on Kernel-based Classifiers
Williams, C. K. I., & Seeger, M. (2000) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 177
Cited by
Kernel methods in system identification, machine learning and function estimation: A survey
Pillonetto, G., Dinuzzo, F., Chen, T., De Nicolao, G., & Ljung, L. (2014) · Automatica · doi:10.1016/j.automatica.2014.01.001 · Cited by 741
Efficient Additive Kernels via Explicit Feature Maps
Vedaldi, A., & Zisserman, A. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.153 · Cited by 688
An, S., Liu, W., & Venkatesh, S. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2006.12.015 · Cited by 301
Randomized numerical linear algebra: Foundations and algorithms
Martinsson, P.-G., & Tropp, J. A. (2020) · Acta Numerica · doi:10.1017/s0962492920000021 · Cited by 300
Improved Nyström low-rank approximation and error analysis
Zhang, K., Tsang, I. W., & Kwok, J. T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390311 · Cited by 299
Metadata
- Authors
- Bach, F. R., & Jordan, M. I.
- Venue
- Proceedings of the 22nd international conference on Machine learning - ICML '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 33-40
- OpenAlex
- W2105608756
- Cited by
- 238
- References
- 8
- FWCI
- 6.92
- Type
- conference paper
- 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.