The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Abstract
A primary computational problem in kernel regression is solution of a dense linear system with the N × N kernel matrix.Because a direct solution has an O(N 3 ) cost, iterative Krylov methods are often used with fast matrix-vector products.For poorly conditioned problems, convergence of the iteration is slow and preconditioning becomes necessary.We investigate preconditioning from the viewpoint of scalability and efficiency.The problems that conventional preconditioners face when applied to kernel methods are demonstrated.A novel flexible preconditioner that not only improves convergence but also allows utilization of fast kernel matrixvector products is introduced.The performance of this preconditioner is first illustrated on synthetic data, and subsequently on a suite of test problems in kernel regression and geostatistical kriging.
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
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
(2006) · Springer eBooks · Cited by 8,123
Gaussian Processes in Machine Learning
Rasmussen, C. E. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28650-9_4 · Cited by 5,397
Numerical Methods for Large Eigenvalue Problems: Revised Edition
Saad, Y. (2011) · doi:10.1137/1.9781611970739 · Cited by 2,364
(1990) · Choice Reviews Online · doi:10.5860/choice.28-0304 · Cited by 1,495
A Flexible Inner-Outer Preconditioned GMRES Algorithm
Saad, Y. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914028 · Cited by 1,445
Sparse Gaussian Processes using Pseudo-inputs
Snelson, E., & Ghahramani, Z. (2005) · Cited by 1,415
Gaussian Processes for Regression
Williams, C. K. I., & Rasmussen, C. E. (1995) · Aston Publications Explorer (Aston University) · Cited by 1,246
Fast Forward Selection to Speed Up Sparse Gaussian Process Regression
Seeger, M., Williams, C. K. I., & Lawrence, N. D. (2003) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 386
Local and global sparse Gaussian process approximations.
Snelson, E., & Zoubin Ghahramani, A. (2007) · Cited by 236
Notay, Y. (2000) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827599362314 · Cited by 229
Automatic online tuning for fast Gaussian summation
Morariu, V. I., Srinivasan, B. V., Raykar, V. C., Ramani Duraiswami, B., & Davis, L. S. (2008) · Cited by 189
Efficient implementation of gaussian processes
Gibbs, M. (1997) · Cited by 151
Efficient Kernel Machines Using the Improved Fast Gauss Transform
Yang, C., Ramani Duraiswami, B., & Davis, L. S. (2004) · Cited by 123
Fast Radial Basis Function Interpolation via Preconditioned Krylov Iteration
Gumerov, N. A., & Ramani Duraiswami, B. (2007) · SIAM Journal on Scientific Computing · doi:10.1137/060662083 · Cited by 81
Gaussian processes and fast matrix-vector multiplies
Murray, I. (2009) · ERA · Cited by 14
Cited by
Unsupervised Learning of Human Action Categories Using Spatial-Temporal Words
Niebles, J. C., Wang, H., & Fei-Fei, L. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0122-4 · Cited by 1,475
A programmable diffractive deep neural network based on a digital-coding metasurface array
Liu, C., Ma, Q., Luo, Z. J., Hong, Q. R., Xiao, Q., Zhang, H. C., Miao, L., Yu, W. M., Cheng, Q., Li, L., et al. (2022) · Nature Electronics · doi:10.1038/s41928-022-00719-9 · Cited by 633
A review of object detection based on deep learning
Xiao, Y., Tian, Z., Yu, J., Zhang, Y., Liu, S., Du, S., & Lan, X. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-08976-6 · Cited by 584
Past, Present, and Future of Face Recognition: A Review
Adjabi, I., Ouahabi, A., Benzaoui, A., & Taleb-Ahmed, A. (2020) · Electronics · doi:10.3390/electronics9081188 · Cited by 560
Color realism and color science
Byrne, A., & Hilbert, D. R. (2003) · Behavioral and Brain Sciences · doi:10.1017/s0140525x03000013 · Cited by 517
Metadata
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2004-03
- Volume
- 26
- Issue
- 3
- Pages
- 02-02
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W1676314349
- Cited by
- 3,721
- References
- 16
- FWCI
- 31.97
- 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.