Massive parallelization boosts big Bayesian multidimensional scaling
Andrew Holbrook, Philippe Lemey, Guy Baele, Simon Dellicour, Dirk, Brockmann, Andrew Rambaut, Marc Suchard

TL;DR
This paper demonstrates how massive parallelization using CPUs and GPUs significantly accelerates Bayesian multidimensional scaling, enabling analysis of large-scale complex data such as viral spread patterns.
Contribution
It introduces a GPU-accelerated implementation of Bayesian MDS, extending its applicability to big data scenarios and providing an open-source library for practical use.
Findings
GPU acceleration achieves over 100-fold speedup in Bayesian MDS computations.
Bayesian MDS applied to influenza data reveals subtype H3N2's effective global spread.
Open-source MassiveMDS library facilitates scalable Bayesian MDS analysis.
Abstract
Big Bayes is the computationally intensive co-application of big data and large, expressive Bayesian models for the analysis of complex phenomena in scientific inference and statistical learning. Standing as an example, Bayesian multidimensional scaling (MDS) can help scientists learn viral trajectories through space-time, but its computational burden prevents its wider use. Crucial MDS model calculations scale quadratically in the number of observations. We partially mitigate this limitation through massive parallelization using multi-core central processing units, instruction-level vectorization and graphics processing units (GPUs). Fitting the MDS model using Hamiltonian Monte Carlo, GPUs can deliver more than 100-fold speedups over serial calculations and thus extend Bayesian MDS to a big data setting. To illustrate, we employ Bayesian MDS to infer the rate at which different…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
