Accelerating Markov Random Field Inference with Uncertainty Quantification
Ramin Bashizade, Xiangyu Zhang, Sayan Mukherjee, Alvin R. Lebeck

TL;DR
This paper introduces a high-throughput FPGA accelerator for Markov Random Field inference using MCMC, significantly reducing memory bandwidth and outperforming GPUs in speed and efficiency for probabilistic applications.
Contribution
It presents a novel tiled architecture with memory optimizations and a hybrid memory system for efficient UQ, applicable beyond MRF models.
Findings
Achieved 26X FPGA speedup over prior FPGA work.
Reduced off-chip bandwidth by 71% for targeted applications.
ASIC analysis shows 120X-210X speedup over GPU implementations.
Abstract
Statistical machine learning has widespread application in various domains. These methods include probabilistic algorithms, such as Markov Chain Monte-Carlo (MCMC), which rely on generating random numbers from probability distributions. These algorithms are computationally expensive on conventional processors, yet their statistical properties, namely interpretability and uncertainty quantification (UQ) compared to deep learning, make them an attractive alternative approach. Therefore, hardware specialization can be adopted to address the shortcomings of conventional processors in running these applications. In this paper, we propose a high-throughput accelerator for Markov Random Field (MRF) inference, a powerful model for representing a wide range of applications, using MCMC with Gibbs sampling. We propose a tiled architecture which takes advantage of near-memory computing, and…
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.
Taxonomy
TopicsAnomaly Detection Techniques and Applications · Gaussian Processes and Bayesian Inference · Blind Source Separation Techniques
