TL;DR
The paper introduces Megopolis, a GPU-optimized resampling algorithm that enhances performance and stability in importance sampling tasks without tuning parameters, enabling real-time applications.
Contribution
It presents Megopolis, a novel memory-coalesced Metropolis-based resampling algorithm optimized for GPUs, improving speed and quality without parameter tuning.
Findings
Megopolis outperforms existing Metropolis variants in speed and quality.
The algorithm is numerically stable across experiments.
Open-source implementation facilitates future research and fair comparisons.
Abstract
The resampling process employed in widely used methods such as Importance Sampling (IS), with its adaptive extension (AIS), are used to solve challenging problems requiring approximate inference; for example, non-linear, non-Gaussian state estimation problems. However, the re-sampling process can be computationally prohibitive for practical problems with real-time requirements. We consider the problem of developing highly parallelisable resampling algorithms for massively parallel hardware architectures of modern graphics processing units (GPUs) to accomplish real-time performance. We develop a new variant of the Metropolis algorithm -- Megopolis -- that improves performance without requiring a tuning parameter or reducing resampling quality. The Megopolis algorithm is built upon exploiting the memory access patterns of modern GPU units to reduce the number of memory transactions…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
