Sampling for inference in probabilistic models with fast Bayesian quadrature

Advances in Neural Information Processing Systems

Volumn 4, Issue January, 2014, Pages 2789-2797

  Gunter, Tom ^a   Osborne, Michael A ^a   Garnett, Roman ^b   Hennig, Philipp ^c   Roberts, Stephen J ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF BONN   (Germany)

^c MAX PLANCK INSTITUTE FOR INTELLIGENT SYSTEMS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; INFORMATION SCIENCE; MARKOV PROCESSES; MONTE CARLO METHODS;

ACTIVE LEARNING SCHEME; FASTER CONVERGENCE; MARGINAL LIKELIHOOD; MARKOV CHAIN MONTE CARLO; NUMERICAL INTEGRATIONS; PARTITION FUNCTIONS; PROBABILISTIC INFERENCE; PROBABILISTIC MODELS;

IMPORTANCE SAMPLING;

EID: 84937141156     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R.M. Neal. Annealed importance sampling. Statistics and Computing, 11(2): 125-139, 2001.
2. J. Skilling. Nested sampling. Bayesian inference and maximum entropy methods in science and engineering, 735: 395-405, 2004.
3. X. Meng and W. H. Wong. Simulating ratios of normalizing constants via a simple identity: a theoretical exploration. Statistica Sinica, 6(4): 831-860, 1996.
4. R. M. Neal. Probabilistic inference using Markov chain Monte Carlo methods. Technical Report CRG-TR-93-1, University of Toronto, 1993.
5. S.P. Brooks and G.O. Roberts. Convergence assessment techniques for Markov chain Monte Carlo. Statistics and Computing, 8(4): 319-335, 1998.
6. M.K. Cowles, G.O. Roberts, and J.S. Rosenthal. Possible biases induced by MCMC convergence diagnostics. Journal of Statistical Computation and Simulation, 64(1): 87, 1999.
7. P. Diaconis. Bayesian numerical analysis. In S. Gupta J. Berger, editor, Statistical Decision Theory and Related Topics IV, Volume 1, pages 163-175. Springer-Verlag, New York, 1988.
8. A. O'Hagan. Bayes-Hermite quadrature. Journal of Statistical Planning and Inference, 29: 245-260, 1991.
9. M. Kennedy. Bayesian quadrature with non-normal approximating functions. Statistics and Computing, 8(4): 365-375, 1998.
10. C. E. Rasmussen and Z. Ghahramani. Bayesian Monte Carlo. In S. Becker and K. Obermayer, editors, Advances in Neural Information Processing Systems, Volume 15. MIT Press, Cambridge, MA, 2003.
11. C. E. Rasmussen and C. K. I. Williams. Gaussian Processes for Machine Learning. MIT Press, 2006.
12. M. A. Osborne, D. K. Duvenaud, R. Garnett, C. E. Rasmussen, S. J. Roberts, and Z. Ghahramani. Active learning of model evidence using Bayesian quadrature. In P. Bartlett, F. C. N. Pereira, C. J. C. Burges, L. Bottou, and K. Q. Weinberger, editors, Advances in Neural Information Processing Systems. MIT Press, Cambridge, MA, 2012.
13. T. P. Minka. Deriving quadrature rules from Gaussian processes. Technical report, Statistics Department, Carnegie Mellon University, 2000.
14. N. Hansen, S. D. Müller, and P. Koumoutsakos. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evolutionary Computation, 11(1): 1-18, 2003.
15. J Gerritsma, R Onnink, and A Versluis. Geometry, resistance and stability of the Delft systematic yacht hull series. International shipbuilding progress, 28(328), 1981.
16. R. Garnett, Y. Krishnamurthy, X. Xiong, J. Schneider, and R. P. Mann. Bayesian optimal active search and surveying. In J. Langford and J. Pineau, editors, Proceedings of the 29th International Conference on Machine Learning (ICML 2012). Omnipress, Madison, WI, USA, 2012.
17. C. E. Rasmussen and H. Nickisch. Gaussian processes for machine learning (GPML) toolbox. The Journal of Machine Learning Research, 11(2010): 3011-03015.
18. F. Fouss, A. Pirotte, J-M Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 19(3): 355-369, 2007.