Towards scaling up Markov chain Monte Carlo: An adaptive subsampling approach

31st International Conference on Machine Learning, ICML 2014

Volumn 1, Issue , 2014, Pages 630-653

  Bardenet, Rémi ^a   Doucet, Arnaud ^a   Holmes, Chris ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CHAINS; LEARNING SYSTEMS; MARKOV PROCESSES;

LARGE DATASETS; MARKOV CHAIN MONTE CARLO METHOD; MARKOV CHAIN MONTE-CARLO; METROPOLIS-HASTINGS; PRACTICAL USE; RANDOM SUBSETS; TOLERANCE LEVELS; TOTAL VARIATION;

MONTE CARLO METHODS;

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

References (22)

1. Alkhamis, T. M., Ahmed, M. A., and Tuan, V. K. Simulated annealing for discrete optimization with estimation. European Journal of Operational Research, 116:530-544, 1999.
2. Andrieu, C. and Thorns, J. A tutorial on adaptive MCMC. Statistics and Computing, 18:343-373, 2008.
3. Audibert, J.-Y., Munos, R., and Szepesvari, Cs. Exploration-exploitation trade-off using variance estimates in multi-armed bandits. Theoretical Computer Science, 2009.
4. Bardenet, R. and Maillard, O.-A. Concentrations inequalities for sampling without replacement, preprint, 2013. URLarxiv.org/abs/130 9.4 02 9.
5. Bulgak, A. A. and Sanders, J. L. Integrating a modified simulated annealing algorithm with the simulation of a manufacturing system to optimize buffer sizes in automatic assembly systems. In Proceedings of the 20th Winter Simulation Conference, 1988.
6. Cesa-Bianchi, N. and Lugosi, G. Combinatorial bandits. In Proceedings of the 22nd Annual Conference on Learning Theory, 2009.
7. Collobert, R., Bengio, S., and Bengio, Y. A parallel mixture of SVMs for very large scale problems. Neural Computation, 14(5): 1105-1114, 2002.
8. Domingo, C. and Watanabe, O. MadaBoost: a modification of AdaBoost. In Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT), 2000.
9. Ferré, D., L., Hervé, and Ledoux, J. Regular perturbation of V-geometrically ergodic Markov chains. Journal of Applied Probability, 50(1):184-194, 2013.
10. Gelman, A., Jakulin, A, Pittau, M. G., and Su, Y-S. A weakly informative default prior distribution for logistic and other regression models. Annals of applied Statistics, 2008.
11. Haario, H., Saksman, E., and Tamminen, J. An adaptive Metropolis algorithm. Bernoulli, 7:223-242, 2001.
12. Hoeffding, W. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13-30, 1963.
13. Korattikara, A., Chen, Y, and Welling, M. Austerity in MCMC land: Cutting the Metropolis-Hastings budget. In Proceedings of the International Conference on Machine Learning (ICML), 2014.
14. Maron, O. and Moore, A. Hoeffding races: Accelerating model selection search for classification and function approximation. In Advances in Neural Information Processing Systems. The MIT Press, 1993.
15. Mnih, V. Efficient stopping rules. Master's thesis, University of Alberta, 2008.
16. Mnih, V., Szepesvari, Cs., and Audibert, J.-Y. Empirical Bernstein stopping. In Proceedings of the 25th International Conference on Machine Learning (ICML), 2008.
17. Robert, C. P. and Casella, G. Monte Carlo Statistical Methods. Springer-Verlag, New York, 2004.
18. Roberts, G. O. and Rosenthal, J. S. Optimal scaling for various Metropolis-Hastings algorithms. Statistical Science, 16:351-367, 2001.
19. Serfling, R. J. Probability inequalities for the sum in sampling without replacement. The Annals of Statistics, 2 (1):39-48, 1974.
20. Singh, S., Wick, M., and McCallum, A. Monte carlo mcmc: Efficient inference by approximate sampling. In Proceedings of the Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, 2012.
21. van der Vaart, A. W. Asymptotic Statistics. Cambridge University Press, 2000.
22. Wang, L. and Zhang, L. Stochastic optimization using simulated annealing with hypothesis test. Applied Mathematics and Computation, 174:1329-1342, 2006.