Two MCMC algorithms for latent position models with almost O(|E|) and O(|V|) running times plus stronger accuracy guarantees than Rastelli et al. (2024).
Firefly Monte Carlo: Exact MCMC with Subsets of Data
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Markov chain Monte Carlo (MCMC) is a popular and successful general-purpose tool for Bayesian inference. However, MCMC cannot be practically applied to large data sets because of the prohibitive cost of evaluating every likelihood term at every iteration. Here we present Firefly Monte Carlo (FlyMC) an auxiliary variable MCMC algorithm that only queries the likelihoods of a potentially small subset of the data at each iteration yet simulates from the exact posterior distribution, in contrast to recent proposals that are approximate even in the asymptotic limit. FlyMC is compatible with a wide variety of modern MCMC algorithms, and only requires a lower bound on the per-datum likelihood factors. In experiments, we find that FlyMC generates samples from the posterior more than an order of magnitude faster than regular MCMC, opening up MCMC methods to larger datasets than were previously considered feasible.
fields
stat.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Accurate and Efficient MCMC for Latent Position Models
Two MCMC algorithms for latent position models with almost O(|E|) and O(|V|) running times plus stronger accuracy guarantees than Rastelli et al. (2024).