A Bayesian Committee Machine
The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Abstract
The Bayesian committee machine (BCM) is a novel approach to combining estimators that were trained on different data sets. Although the BCM can be applied to the combination of any kind of estimators, the main foci are gaussian process regression and related systems such as regularization networks and smoothing splines for which the degrees of freedom increase with the number of training data. Somewhat surprisingly, we find that the performance of the BCM improves if several test points are queried at the same time and is optimal if the number of test points is at least as large as the degrees of freedom of the estimator. The BCM also provides a new solution for on-line learning with potential applications to data mining. We apply the BCM to systems with fixed basis functions and discuss its relationship to gaussian process regression. Finally, we show how the ideas behind the BCM can be applied in a non-Bayesian setting to extend the input-dependent combination of estimators.
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
(2005) · Technometrics · doi:10.1198/tech.2005.s303 · Cited by 17,923
Brown, R. A., Hastie, T. J., & Tibshirani, R. J. (1991) · Biometrics · doi:10.2307/2532174 · Cited by 8,176
Spline Models for Observational Data.
Muller, H.-G., & Wahba, G. (1991) · Journal of the American Statistical Association · doi:10.2307/2290434 · Cited by 4,928
Bayesian Learning for Neural Networks
Neal, R. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-0745-0 · Cited by 4,276
Networks for approximation and learning
Poggio, T., & Girosi, F. (1990) · Proceedings of the IEEE · doi:10.1109/5.58326 · Cited by 3,252
Graphical Models in Applied Multivariate Statistics
Goodall, C. R. (1991) · Technometrics · doi:10.1080/00401706.1991.10484880 · Cited by 1,849
Gaussian Processes for Regression
Williams, C. K. I., & Rasmussen, C. E. (1995) · Aston Publications Explorer (Aston University) · Cited by 1,246
Sparse On-Line Gaussian Processes
Csató, L., & Opper, M. (2002) · Neural Computation · doi:10.1162/089976602317250933 · Cited by 749
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
Bayesian “Confidence Intervals” for the Cross-Validated Smoothing Spline
Wahba, G. (1983) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1983.tb01239.x · Cited by 637
The connection between regularization operators and support vector kernels
Smola, A. J., Schölkopf, B., & Müller, K.-R. (1998) · Neural Networks · doi:10.1016/s0893-6080(98)00032-x · Cited by 625
An Equivalence Between Sparse Approximation and Support Vector Machines
Girosi, F. (1998) · Neural Computation · doi:10.1162/089976698300017269 · Cited by 506
Moody, J. E. (1991) · Cited by 437
Evaluation of gaussian processes and other methods for non-linear regression
Hinton, G. E., & Rasmussen, C. E. (1997) · Library and Archives Canada (Government of Canada) · Cited by 429
Monte Carlo Implementation of Gaussian Process Models for Bayesian Regression and Classification
Neal, R. M. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/9701026 · Cited by 375
Diaconis, P. (1988) · Statistical Decision Theory and Related Topics IV · doi:10.1007/978-1-4613-8768-8_20 · Cited by 238
Computing with Infinite Networks
Williams, C. K. I. (1996) · Aston Publications Explorer (Aston University) · Cited by 187
Efficient implementation of gaussian processes
Gibbs, M. (1997) · Cited by 151
Computation with Infinite Neural Networks
Williams, C. K. I. (1998) · Neural Computation · doi:10.1162/089976698300017412 · Cited by 149
Combining Estimators Using Non-Constant Weighting Functions
Tresp, V., & Taniguchi, M. (1994) · neural information processing systems · Cited by 120
Self-citationGaussian regression and optimal finite dimensional linear models
Zhu, H., Williams, C. K. I., Rohwer, R., & Morciniec, M. (1997) · Aston Publications Explorer (Aston University) · Cited by 89
A Sparse Representation for Function Approximation
Poggio, T., & Girosi, F. (1998) · Neural Computation · doi:10.1162/089976698300017250 · Cited by 81
Averaging Regularized Estimators
Taniguchi, M., & Tresp, V. (1997) · Neural Computation · doi:10.1162/neco.1997.9.5.1163 · Cited by 66
Self-citationSmoothing regularizers for projective basis function networks
Moody, J. E. (2018) · OHSU Digital Commons · doi:10.6083/vx021f42c · Cited by 35
Finite-Dimensional Approximation of Gaussian Processes
Ferrari‐Trecate, G., Williams, C. K. I., & Opper, M. (1998) · neural information processing systems · Cited by 34
Bayesian regression filters and the issue of priors
Zhu, H., & Rohwer, R. (1996) · Neural Computing and Applications · doi:10.1007/bf01414873 · Cited by 22
Cited by
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
A comprehensive survey on support vector machine classification: Applications, challenges and trends
Cervantes, J., Garcia-Lamont, F., Rodríguez-Mazahua, L., & Lopez, A. (2020) · Neurocomputing · doi:10.1016/j.neucom.2019.10.118 · Cited by 2,381
Recent advances in surrogate-based optimization
Forrester, A. I. J., & Keane, A. J. (2009) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2008.11.001 · Cited by 2,357
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
When Gaussian Process Meets Big Data: A Review of Scalable GPs
Liu, H., Ong, Y.-S., Shen, X., & Cai, J. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2957109 · Cited by 878
Metadata
- Authors
- Tresp, V.
- Venue
- Neural Computation
- Publisher
- MIT Press
- Published
- 2000-11-01
- Volume
- 12
- Issue
- 11
- Pages
- 2719-2741
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W1973310094
- Cited by
- 402
- References
- 27
- FWCI
- 9.16
- 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.