The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Sparse On-Line Gaussian Processes
Open accessAbstract
We develop an approach for sparse representations of gaussian process (GP) models (which are Bayesian types of kernel machines) in order to overcome their limitations for large data sets. The method is based on a combination of a Bayesian on-line algorithm, together with a sequential construction of a relevant subsample of the data that fully specifies the prediction of the GP model. By using an appealing parameterization and projection techniques in a reproducing kernel Hilbert space, recursions for the effective parameters and a sparse gaussian approximation of the posterior process are obtained. This allows for both a propagation of predictions and Bayesian error measures. The significance and robustness of our approach are demonstrated on a variety of experiments.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Multivariate Adaptive Regression Splines
Friedman, J. H. (1991) · The Annals of Statistics · doi:10.1214/aos/1176347963 · Cited by 8,000
(1998) · Springer eBooks · doi:10.1007/978-94-011-5014-9 · Cited by 2,418
Using the Nyström Method to Speed Up Kernel Machines
Williams, C. K. I., & Seeger, M. (2000) · Cited by 1,646
Expectation Propagation for approximate Bayesian inference
Minka, T. P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2294 · Cited by 1,392
Incremental and Decremental Support Vector Machine Learning
Cauwenberghs, G., & Poggio, T. (2000) · neural information processing systems · Cited by 1,377
A Resource-Allocating Network for Function Interpolation
Platt, J. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.213 · Cited by 1,354
Some results on Tchebycheffian spline functions
Kimeldorf, G., & Wahba, G. (1971) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(71)90184-3 · Cited by 1,254
Gaussian Processes for Regression
Williams, C. K. I., & Rasmussen, C. E. (1995) · Aston Publications Explorer (Aston University) · Cited by 1,246
Input space versus feature space in kernel-based methods
Scholkopf, B., Mika, S., Burges, C. J. C., Knirsch, P., Muller, K.-R., Ratsch, G., & Smola, A. J. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.788641 · Cited by 1,164
Tipping, M. E. (1999) · neural information processing systems · Cited by 1,063
Bayesian classification with Gaussian processes
Williams, C. K. I., & Barber, D. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.735807 · Cited by 766
Sparse Greedy Matrix Approximation for Machine Learning
Smola, A. J., & Schökopf, B. (2000) · doi:10.5555/645529.657980 · Cited by 574
On-line Learning and Stochastic Approximations
Bottou, L. (1999) · On-Line Learning in Neural Networks · doi:10.1017/cbo9780511569920.003 · Cited by 564
Tresp, V. (2000) · Neural Computation · doi:10.1162/089976600300014908 · Cited by 402
On-Line Learning in Neural Networks
MTW, & Saad, D. (2000) · Journal of the American Statistical Association · doi:10.2307/2669811 · Cited by 260
Probabilistic Kernel Regression Models
Jaakkola, T., & Haussler, D. H. (1999) · Cited by 208
Long-Lead Prediction of Pacific SSTs via Bayesian Dynamic Modeling
Berliner, L. M., Wikle, C. K., & Cressie, N. (2000) · Journal of Climate · doi:10.1175/1520-0442(2001)013<3953:llpops>2.0.co;2 · Cited by 167
Efficient implementation of gaussian processes
Gibbs, M. (1997) · Cited by 151
On Different Facets of Regularization Theory
Chen, Z., & Haykin, S. (2002) · Neural Computation · doi:10.1162/089976602760805296 · Cited by 148
Seeger, M. (1999) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 104
Bayesian Analysis of the Scatterometer Wind Retrieval Inverse Problem: Some New Approaches
Cornford, D., Csató, L., Evans, D. J., & Opper, M. (2004) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.1467-9868.2004.02054.x · Cited by 37
Self-citationFinite-Dimensional Approximation of Gaussian Processes
Ferrari‐Trecate, G., Williams, C. K. I., & Opper, M. (1998) · neural information processing systems · Cited by 34
Self-citationRKHS-based functional analysis for exact incremental learning
Vijayakumar, S., & Ogawa, H. (1999) · Neurocomputing · doi:10.1016/s0925-2312(99)00112-5 · Cited by 32
Bayesian Approach to Inverse Quantum Statistics
Lemm, J. C., Uhlig, J., & Weiguny, A. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.2068 · Cited by 22
Cited by
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
“Tanko, Identifikacija mo delov črne skrinjice na podlagi Gaussovih procesov, IJS de lovno poročilo, 2010 [3] L.”
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
A Unifying View of Sparse Approximate Gaussian Process Regression
Quiñonero-Candela, J., & Rasmussen, C. E. (2005) · doi:10.5555/1046920.1194909 · Cited by 1,671
GAUSSIAN PROCESSES FOR MACHINE LEARNING
SEEGER, M. (2004) · International Journal of Neural Systems · doi:10.1142/s0129065704001899 · Cited by 1,488
The Kernel Recursive Least-Squares Algorithm
Engel, Y., Mannor, S., & Meir, R. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.830985 · Cited by 1,104
Metadata
- Authors
- Csató, L., & Opper, M.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2002-03-01
- Volume
- 14
- Issue
- 3
- Pages
- 641-668
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2129564505
- Cited by
- 749
- References
- 25
- FWCI
- 15.06
- 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.