Bayes and big data: the consensus Monte Carlo algorithm

References

• Anderson, T.E., Culler, D.E., & Patterson, D. (1995). A case for NOW (Networks Of Workstations). IEEE Micro, 15(1), 54–64. Retrieved from http://dx.doi.org/10.1109/40.342018
   Web of Science ®Google Scholar
• Chipman, H.A., George, E.I., & McCulloch, R.E. (2010). BART: Bayesian Additive Regression Trees. The Annals of Applied Statistics, 4(1), 266–298.
   Web of Science ®Google Scholar
• Dean, J., & Ghemawat, S. (2008). MapReduce: simplified data processing on large clusters. Communications of the ACM, 51(1), 107–113.
   Web of Science ®Google Scholar
• Denison, D.G.T., Mallick, B.K., & Smith, A.F.M. (1998). Automatic Bayesian Curve Fitting. Journal of the Royal Statistical Society, Series B, Methodological, 60, 333–350.
   Google Scholar
• Friedman, J. H. (1991). Multivariate adaptive regression splines. The Annals of Statistics, 19(1), 1–67.
   Web of Science ®Google Scholar
• Ghahramani, Z., & Beal, M.J. (2001). Propagation algorithms for variational Bayesian learning. T.K. Leen, T.G. Dietterich, & V. Tresp. (Eds.), Advances in Neural Information Processing Systems 13, Proceedings of the 2000 Conference (pp. 507–513). Boston, MA: MIT Press. Retrieved from http://papers.nips.cc/paper/1907-propagation-algorithms-for-variational-bayesian-learning.pdf
   Google Scholar
• Guha, S., Guha, S., Kidwell, P., Hafen, R., & Cleveland, W.S. (2009). Visualization databases for the analysis of large complex datasets. In Proceedings of the 12th International Conference on Artificial Intelligence and Statistic (AISTATS), 16–18 April 2009, Clearwater Beach, FL, Journal of Machine Learning Research: Workshop and Conference Proceedings. 5, 193–200. Retrieved from http://ml.stat.purdue.edu/hafen/preprints/GuhaAISTATS2009.pdf
   Google Scholar
• Hadfield, J.D. (2010). MCMC methods for multi-response generalized linear mixed models: the MCMCglmm R package. Journal of Statistical Software, 33(2), 1–22.
   PubMed Web of Science ®Google Scholar
• Hinton, G.E., & Van Camp, D. (1993). Keeping the neural networks simple by minimizing the description length of the weights. In Proceedings of the Sixth Annual Conference on Computational Learning Theory (COLT ’93), 26-28 July 1993, Santa Cruz, CA (pp. 5–13). New York: ACM.
   Google Scholar
• Huang, Z., & Gelman, A. (2005). Sampling for Bayesian computation with large datasets (Technical Report). Department of Statistics: Columbia University.
   Google Scholar
• Jaakkola, T.S., & Jordan, M.I. (2000). Bayesian parameter estimation via variational methods. Statistics and Computing, 10(1), 25–37.
   Web of Science ®Google Scholar
• Kleiner, A., Talwalkar, A., Sarkar, P., & Jordan, M.I. (2011). A scalable bootstrap for massive data. arXiv preprint arXiv:1112.5016. Retrieved from http://arxiv.org/abs/1112.5016
   Google Scholar
• Le Cam, L.M., & Yang,, G.L. (2000). Asymptotics in Statistics: Some Basic Concepts. New York: Springer-Verlag.
   Google Scholar
• Lee, A., Yao, C., Giles, M. B., Doucet, A., & Holmes, C. C. (2010). On the utility of graphics cards to perform massively parallel simulation of advanced Monte Carlo methods. Journal of Computational and Graphical Statistics, 19(4), 769–789.
   PubMed Web of Science ®Google Scholar
• Malewicz, G., Austern, M.H., Bik, A.J.C., Dehnert, J.C., Horn,, I., Leiser, N., et al. (2010). Pregel: a system for large-scale graph processing. In Proceedings of the 2010 ACM SIGMOD/PODS Conference (SIGMOD’10), 6-1 June 2010, Indianapolis, IN (pp. 135–145). New York: ACM.
   Google Scholar
• Neiswanger, W., Wang, C., & Xing, E. (2013). Asymptotically Exact, Embarrassingly Parallel MCMC. arXiv preprint arXiv:1311.4780,
   Google Scholar
• Rue, H., Martino, S., & Chopin, N. (2009). Approximate Bayesian inference for latent Gaussian models by using integrated nested Laplace approximations. Journal of the royal statistical society: Series b (statistical methodology), 71(2), 319–392.
   Web of Science ®Google Scholar
• Srivastava, S., Li, C., & Dunson, D.B. (2015). Scalable Bayes via barycenter in Wasserstein space. arXiv preprint arXiv:1508.05880. Retrieved from http://arxiv.org/abs/1508.05880
   Google Scholar
• Suchard, M. A., Wang, Q., Chan, C., Frelinger, J., Cron, A., & West, M. (2010). Understanding GPU programming for statistical computation: studies in massively parallel massive mixtures. Journal of Computational and Graphical Statistics, 19(2), 419–438.
   PubMed Web of Science ®Google Scholar
• Wang, X. & Dunson, D.B. (2013). Parallel MCMC via Weierstrass sampler. arXiv preprint arXiv:1312.4605. Retrieved from http://arxiv.org/abs/1312.4605
   Google Scholar
• Wang, X., Fangjian, G., Heller, K.A., & Dunson, D.B. (2015). Parallelizing MCMC with random partition trees. Retrieved from http://dx.doi.org/10.13140/RG.2.1.2921.4883
   Google Scholar
• White, T. (2012). Hadoop: the Definitive Guide. Sebastopol, CA: O’Reilly.
   Google Scholar
• Zhang, Y., Duchi, J.C., & Wainwright, M.J. (2012). Communication-efficient algorithms for statistical optimization. Proceedings of the 51st IEEE Annual Conference on Decision and Control (CDC 2012), 10-13 December 2012, Grand Wailea, Maui, HI (pp. 6792–6792). IEEE.
   Google Scholar