Austerity in MCMC land: Cutting the metropolis-hastings budget

31st International Conference on Machine Learning, ICML 2014

Volumn 1, Issue , 2014, Pages 321-336

  Korattikara, Anoop ^a   Chen, Yutian ^b   Welling, Max ^c  

^a Ringgold Standard Institution Informatics   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BUDGET CONTROL; LEARNING SYSTEMS;

ASYMPTOTIC BIAS; BINARY DECISION; HIGH CONFIDENCE; HYPOTHESIS TESTS; LARGE DATASETS; MCMC SAMPLING; METROPOLIS-HASTINGS; RULE BASED;

ACCEPTANCE TESTS;

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

References (19)

1. Ahn, S., Korattikara, A., and Welling, M. Bayesian posterior sampling via stochastic gradient Fisher scoring. In International Conference on Machine Learning, 2012.
2. Amari, Shun-ichi, Cichocki, Andrzej, Yang, Howard Hua, et al. A new learning algorithm for blind signal separation. Advances in neural information processing systems, pp. 757-763, 1996.
3. Andrieu, Christophe and Roberts, Gareth O. The pseudo-marginal approach for efficient Monte Carlo computations. The Annals of Statistics, 37(2): 697-725, 2009.
4. Bache, K. and Lichman, M. UCI machine learning repository, 2013. URL http://archive.ics.uci. edu/ml.
5. Bremaud, R Markov chains: Gibbs fields, Monte Carlo simulation, and queues, volume 31. Springer, 1999.
6. Chen, Xiaohui, Jane Wang, Z, and McKeown, Martin J. A Bayesian Lasso via reversible-jump MCMC. Signal Processing, 91(8): 1920-1932, 2011.
7. Fearnhead, Paul, Papaspiliopoulos, Omiros, and Roberts, Gareth O. Particle filters for partially observed diffusions. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 70(4): 755-777, 2008.
8. Gamerman, Dani and Lopes, Hedibert F. Markov chain Monte Carlo: stochastic simulation for Bayesian inference, volume 68. Chapman & Hall/CRC, 2006.
9. Green, Peter J. Reversible jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrika, 82(4): 711-732, 1995.
10. Hastings, W Keith. Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57(1): 97-109, 1970.
11. Hyvarinen, Aapo and Oja, Erkki. Independent component analysis: algorithms and applications. Neural networks, 13(4): 411-130, 2000.
12. Lin, L, Liu, KF, and Sloan, J. A noisy Monte Carlo algorithm. Physical Review D, 61(7): 074505, 2000.
13. Metropolis, Nicholas, Rosenbluth, Arianna W, Rosenbluth, Marshall N, Teller, Augusta H, and Teller, Edward. Equation of state calculations by fast computing machines. The journal of chemical physics, 21: 1087, 1953.
14. O'Brien, Peter C and Fleming, Thomas R. A multiple testing procedure for clinical trials. Biometrics, pp. 549-556, 1979.
15. Ouyang, Zhi. Bayesian Additive Regression Kernels. PhD thesis, Duke University, 2008.
16. Pocock, Stuart J. Group sequential methods in the design and analysis of clinical trials. Biometrika, 64(2): 191-199, 1977.
17. Singh, Sameer, Wick, Michael, and McCallum, Andrew. Monte Carlo MCMC: efficient inference by approximate sampling. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pp. 1104-1113. Association for Computational Linguistics, 2012.
18. Wang, Samuel K and Tsiatis, Anastasios A. Approximately optimal one-parameter boundaries for group sequential trials. Biometrics, pp. 193-199, 1987.
19. Welling, M. and Teh, Y.W. Bayesian learning via stochastic gradient Langevin dynamics. In Proceedings of the 28th International Conference on Machine Learning (ICML), pp. 681-688, 2011.