Ensemble learning in Bayesian neural networks.
In Christopher M. Bishop, editor, Neural Networks and Machine Learning, Proceedings of the NATO Advanced Study Institute on Generalization in Neural Networks and Machine Learning, Berlin, 1998. Springer-Verlag.
Long-lead prediction of Pacific SST via Bayesian dynamic modelling.
Journal of Climate, 13:3953-3968, 2000.
Bayesian Theory.
John Wiley & Sons, 1994.
Neural Networks for Pattern Recognition.
Oxford University Press, New York, N.Y., 1995.
A bayesian approach to model inadequacy for polynomial regression.
Biometrica, 62:79-88, 1975.
Online learning and stochastic approximations.
In On-Line Learning in Neural Networks [68], pages 9-42.
Multivariable functional interpolation and adaptive networks.
Complex Systems, 2:321-355, 1988.
A tutorial on support vector machines for pattern recognition.
Knowledge Discovery and Data Mining, 2(2):121-167, 1998.
Query learning with large margin classifiers.
In Proceedings of the 17th International Conference on Machine Learing, pages 111-118, 2000.
Incremental and decremental Support Vector Machine learning.
In Todd K. Leen, Thomas G. Diettrich, and Volker Tresp, editors, NIPS, volume 13. The MIT Press, 2001.
Atomic decomposition by basis pursuit.
Technical Report 479, Department of Statistics, Stanford University, 1995.
Basis Pursuit.
PhD thesis, Department of Statistics, Stanford University, November 1995.
Modelling frontal discontinuities in wind fields.
Nonparametric Statistics, 2002.
accepted.
Elements of Information Theory.
John Wiley & Sons, 1991.
Statistics for Spatial Data.
John Wiley and Sons, New York, 1993.
Online learning of wind-field models.
In International Conference on Artificial Neural Networks, pages 300-307, 2001.
Efficient approaches to Gaussian process classification.
In NIPS, volume 12, pages 251-257. The MIT Press, 2000.
Sparse representation for Gaussian process models.
In Todd K. Leen, Thomas G. Dietterich, and Volker Tresp, editors, NIPS, volume 13, pages 444-450. The MIT Press, 2001.
Sparse on-line Gaussian Processes.
Neural Computation, 14(3):641-669, 2002.
Hierarchical bayesian kalman models for regularisation and ARD in sequential learning.
Technical report, Cambridge University, Engineering Department, http://svr-www.eng.cam.ac.uk/reports/people/niranjan.html, 1998.
A Probabilistic Theory of Pattern Recognition.
Number 31 in Applications of mathematics. Springer, New York, 1996.
Structured neural network modelling of multi-valued functions for wind retrieval from scatterometer measurements.
Neurocomputing Letters, 30:23-30, 2000.
Multivariate adaptive regression splines.
Annals of Statistics, 19:1-141, 1991.
Applied Optimal Estimation.
The MIT press, Cambridge, MA, 1974.
Bayesian Data Analysis.
Chapman & Hall, 1995.
Efficient implementation of Gaussian processes.
Technical report, Department of Physics, Cavendish Laboratory, Cambridge University, 1997.
http://wol.ra.phy.cam.ac.uk/mackay.
Variational Gaussian process classifiers.
Technical report, Department of Physics, Cavendish Laboratory, Cambridge University, 1999.
http://wol.ra.phy.cam.ac.uk/mackay/abstracts/gpros.html.
Orthogonal series density estimation and the kernel eigenvalue problem.
Neural Computation, 14(3):669-688, 2002.
Analysis of the hidden units in layered networks trained to classify sonar targets.
Neural Networks, 1:75-89, 1988.
Table of integrals, series, and products.
Academic Press, New York, 1994.
Neural networks : a comprehensive foundation.
Macmillan, New York, 1994.
Bayes point machines.
Journal of Machine Learning Research, 1:245-279, 2001.
Keeping neural networks simple by minimising the description length.
In 6th Conference on Computational Learning Theory, pages 5-13, 1993.
The analysis of data from continuous probability distributions.
http://xxx.arXiv.org/ps/physics/9706015, pages 1-8, 1997.
Projection pursuit.
The Annals of Statistics, 13(2):435-475, 1985.
Probabilistic kernel regression.
In Online Proceedings of 7-th Int. Workshop on AI and Statistics. http://uncertainty99.microsoft.com/proceedings.htm, 1999.
Principal Component Analysis.
Springer Verlag, New York, 1986.
A new approach to linear filtering and prediction problems.
Trans ASME, Journal of Basic Engineering, Ser. D, 83:35-45, 1960.
New results in linear filtering and prediction theory.
Trans ASME, Journal of Basic Engineering, Ser. D, 83:95-108, 1961.
Some results on Tchebycheffian spline functions.
J. Math. Anal. Applic., 33:82-95, 1971.
Information Theory and Statistics.
Wiley, New York, 1959.
Comparison of approximate methods for handling hyperparameters.
Neural Computation, 11:1035-1068, 1999.
Multivariate Analysis.
Academic Press, London, 1979.
Generalized Linear Models.
Chapman & Hall, London, 1989.
Functions of positive and negative type and their connection with the theory of integral equations.
Philos. Trans. Roy. Soc. London, A 209:415-446, 1909.
Expectation Propagation for Approximate Bayesian Inference.
PhD thesis, Dep. of El. Eng. & Comp. Sci.; MIT, vismod.www.media.mit.edu/
tpminka, 2000.
Bayesian inference for wind field retrieval.
Neurocomputing Letters, 30:3-11, 2000.
Structured neural network modelling for multi-valued functions for wind vector retrieval from satellite scatterometer measurements.
Neurocomputing, 30:23-30, 2000.
Regression and classification using Gaussian process priors (with discussion).
In J. M. Bernerdo, J. O. Berger, A. P. Dawid, and A. F. M. Smith, editors, Bayesian Statistics, volume 6, pages 475-501. Oxford University Press, 1997.
ftp://ftp.cs.utoronto.ca/pub/radford/mc-gp.ps.Z.
Learning continuous distributions: Simulations with field theoretic priors.
In Todd K. Leen, Thomas G. Diettrich, and Volker Tresp, editors, NIPS, pages 287-293, 2001.
The calibration of ERS-1 satellite scatterometer winds.
Journal of Atmospheric and Oceanic Technology, 11:1002-1017, 1994.
Curve fitting and optimal design for prediction (with discussion).
J. Royal Statistical Socierty, Ser. B, 40:1-42, 1978.
Tractable approximations for probabilistic models: the adaptive Thouless-Anderson-Palmer mean field approach.
Physical Review Letters, 86(17):3695-3698, 2001.
Online versus offline learning from random examples: General results.
Phys. Rev. Lett., 77(22):4671-4674, 1996.
A Bayesian approach to online learning.
In On-Line Learning in Neural Networks [68], pages 363-378.
Advanced Mean Field Methods: Theory and Practice.
The MIT Press, 2001.
Gaussian processes and SVM: Mean field results and leave-one-out estimator.
In Smola et al. [77], pages 43-65.
Gaussian processes for classification: Mean-field algorithms.
Neural Computation, 12:2655-2684, 2000.
Reducing the run-time complexity in Support Vector Machines.
In Schölkopf et al. [71], pages 271-284.
Orthogonal matching pursuit: Recursive function approximations to wavelet decomposition.
In 27-th Annual Asilomar Conference on Signals Systems and Computers, citeseer.nj.nec.com/pati93orthogonal.html, November 1993.
Fast training of Support Vector Machines using sequential minimal optimisation.
In Schölkopf et al. [71], pages 185-208.
Probabilities for Support Vector Machines.
In Smola et al. [77], pages 61-74.
Networks for approximation and learning.
Proceedings of The IEEE, 78(9):1481-1497, 1990.
Numerical Recipes in C.
Cambridge University Press, Cambridge, second edition, 1992.
Infinite mixture of gaussian process experts.
In Thomas G. Dietterich, Suzanna Becker, and Zoubin Ghahramani, editors, NIPS, volume 14, http://nips.cc, 2002. The MIT Press.
Pattern Recogntion and Neural Networks.
Cambridge University Press, Cambridge, UK, 1996.
Em algorithms for pca and spca.
In Michael I. Jordan, Michael J. Kearns, and Sara A. Solla, editors, NIPS, volume 10. The MIT Press, 1998.
On-Line Learning in Neural Networks.
Cambridge Univ. Press, 1998.
Continuous probability distributions from finite data.
http://xxx.arXiv.org/ps/physics/9808005, pages 1-8, 1998.
Nonlinear component analysis as a kernel eigenvalue problem.
Neural Computation, 10:1299-1319, 1998.
Advances in kernel methods (Support Vector Learning). The MIT Press, 1999.
A generalized representer theorem.
In Fourteenth Annual Conference on Computational Learning Theory, page in press, 2001.
Input space vs. feature space in kernel-based methods.
IEEE Transactions on Neural Networks, 10(5):1000-1017, 1999.
Bayesian model selection for Support Vector Machines, Gaussian processes and other kernel classifiers.
In Sara A. Solla, Todd K. Leen, and Klaus-Robert Müller, editors, NIPS, volume 12. The MIT Press, 2000.
Query by committee.
In Computational Learing Theory, pages 287-294, citeseer.nj.nec.com/seung92query.html, 1992.
A new parameter estimation method for Gaussian mixtures.
In Michael S. Kearns, Sara A. Solla, and David A. Cohn, editors, NIPS, volume 11. The MIT Press, 1998.
Advances in Large Margin Classifiers, Cambridge, MA, 1999. The MIT Press.
Sparse greedy Gaussian pocess regression.
In Todd K. Leen, Thomas G. Diettrich, and Volker Tresp, editors, NIPS, volume 13, pages 619-625. The MIT Press, 2001.
Sparse greedy matrix approximation for machine learning.
In Proceedings of ICML'200, pages 911-918, San Francisco, CA, 2000. Morgan Kaufmann.
Sparse greedy gaussian process regression.
In Todd K. Leen, Thomas G. Diettrich, and Volker Tresp, editors, NIPS, volume 13, pages 619-625. The MIT press, 2001.
Learning with Kernels.
MIT Press, 2002.
Learning from minimum entropy queries in a large committee machine.
Physical Review, 53:2060-2063, 1996.
Probabilistic interpretation and Bayesian methods for Support Vector Machines.
In International Conference on Neural Networks, pages 91-96, Edinburgh, 1999.
Ambiguity removal and assimiliation of scatterometer data.
Quarterly Journal of the Royal Meteorological Society, 123:491-518, 1997.
Solution of incorrectly formulated problems and the regularization method.
Soviet Math. Dokl., 4:1035-1038, 1963.
The Relevance Vector Machine.
In Sara A. Solla, Todd K. Leen, and Klaus-Robert Müller, editors, NIPS, volume 12, pages 652-658. The MIT Press, 2000.
Sparse bayesian learning and the relevance vector machine.
Journal of Machine Learning Research, 1:211-244, 2001.
Sparse kernel principal component analysis.
In Todd K. Leen, Thomas G. Diettrich, and Volker Tresp, editors, NIPS, volume 13. The MIT press, 2001.
Probabilistic principal component analysis.
Journal of the Royal Statistical Society, Series B, 61(3):611-622, 1999.
Finite-dimensional approximation of Gaussian processes.
In Michael S. Kearns, Sara A. Solla, and David A. Cohn, editors, NIPS, volume 11. The MIT Press, 1999.
A Bayesian committee machine.
Neural Computation, 12(11):2719-2741, 2000.
Three remarks on the Support Vector method of function estimation.
In Schölkopf et al. [71], pages 25-42.
The Nature of Statistical Learning Theory.
Springer-Verlag, New York, NY, 1995.
Kernel matching pursuit.
Technical Report 1179, Département d'Informatique et Recherche Opérationnelle, Université de Montréal, 2000.
Splines Models for Observational Data.
Series in Applied Mathematics, Vol. 59, SIAM, Philadelphia, 1990.
The bias-variance tradeoff and the randomized GACV.
In Michael S. Kearns, Sara A. Solla, and David A. Cohn, editors, NIPS, volume 11, pages 620-626. The MIT Press, 1999.
Support Vector density estimation.
In Schölkopf et al. [71], pages 293-305.
Prediction with Gaussian processes.
In Michael I. Jordan, editor, Learning in Graphical Models. The MIT Press, 1999.
Bayesian classification with Gaussian Processes.
IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(12):1342-1351, 1998.
Gaussian processes for regression.
In D. S. Touretzky, M. C. Mozer, and M. E. Hasselmo, editors, NIPS, volume 8. The MIT Press, 1996.
Using the Nyström method to speed up kernel machines.
In Todd K. Leen, Thomas G. Diettrich, and Volker Tresp, editors, NIPS, volume 13, 2001.
Computation with infinite networks.
In D. S. Touretzky, M. C. Mozer, and M. E. Hasselmo, editors, NIPS, volume 9. The MIT Press, 1996.
Gaussian regression and optimal finite dimensional linear models.
Technical report, Aston University, 1997.