Name
Title | ||
|---|---|---|
Accelerating Markov Random Field Inference Using Molecular Optical Gibbs Sampling Units. |
Abstract | ||
|---|---|---|
The increasing use of probabilistic algorithms from statistics and machine learning for data analytics presents new challenges and opportunities for the design of computing systems. One important class of probabilistic machine learning algorithms is Markov Chain Monte Carlo (MCMC) sampling, which can be used on a wide variety of applications in Bayesian Inference. However, this probabilistic iterative algorithm can be inefficient in practice on today's processors, especially for problems with high dimensionality and complex structure. The source of inefficiency is generating samples from parameterized probability distributions. This paper seeks to address this sampling inefficiency and presents a new approach to support probabilistic computing that leverages the native randomness of Resonance Energy Transfer (RET) networks to construct RET-based sampling units (RSU). Although RSUs can be designed for a variety of applications, we focus on the specific class of probabilistic problems described as Markov Random Field Inference. Our proposed RSU uses a RET network to implement a molecular-scale optical Gibbs sampling unit (RSU-G) that can be integrated into a processor / GPU as specialized functional units or organized as a discrete accelerator. We experimentally demonstrate the fundamental operation of an RSU using a macro-scale hardware prototype. Emulation-based evaluation of two computer vision applications for HD images reveal that an RSU augmented GPU provides speedups over a GPU of 3 and 16. Analytic evaluation shows a discrete accelerator that is limited by 336 GB/s DRAM produces speedups of 21 and 54 versus the GPU implementations. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/ISCA.2016.55 | ISCA |
Keywords | Field | DocType |
probabilistic computing,emerging technology,resonance energy transfer,nanophotonics | Bayesian inference,Markov chain Monte Carlo,Computer science,Markov random field,Parallel computing,Probabilistic analysis of algorithms,Probability distribution,Sampling (statistics),Probabilistic logic,Gibbs sampling | Conference |
ISSN | ISBN | Citations |
1063-6897 | 978-1-4673-8948-8 | 2 |
PageRank | References | Authors |
0.36 | 17 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Siyang Wang | 1 | 5 | 0.87 |
| Xiangyu Zhang | 2 | 6 | 3.57 |
| Yuxuan Li | 3 | 2 | 0.36 |
| Ramin Bashizade | 4 | 16 | 2.59 |
| Song Yang | 5 | 2 | 0.36 |
| Chris Dwyer | 6 | 53 | 8.41 |
| Alvin R. Lebeck | 7 | 1394 | 141.95 |