A highly scalable Restricted Boltzmann Machine FPGA implementation
The DOI matches its Crossref record.
Abstract
Restricted Boltzmann machines (RBMs)- the building block for newly popular deep belief networks (DBNs) - are a promising new tool for machine learning practitioners. However, future research in applications of DBNs is hampered by the considerable computation that training requires. In this paper, we describe a novel architecture and FPGA implementation that accelerates the training of general RBMs in a scalable manner, with the goal of producing a system that machine learning researchers can use to investigate ever-larger networks. Our design uses a highly efficient, fully-pipelined architecture based on 16-bit arithmetic for performing RBM training on an FPGA. We show that only 16-bit arithmetic precision is necessary, and we consequently use embedded hardware multiply-and-add (MADD) units. We present performance results to show that a speedup of 25-30X can be achieved over an optimized software implementation on a high-end CPU.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 10
- 10.1109/4.121550 · DOI
- 10.1049/ip-cds:19971587 · DOI · Paper page
- 10.1162/neco.2006.18.7.1527 · DOI · Paper page
- lee, 2008, sparse deep belief net model for visual area v2, Advances in Neural Information Processing Systems 20, 873
- 10.1145/1508128.1508140 · DOI
- zhu, 2003, fpga implementations of neural networks: a survey ofa decade of progress, Proc Int Conf Field Programmable Logic and Applications, 1062, 10.1007/978-3-540-45234-8_120 · DOI · Paper page
- 10.1007/3-540-58419-6_126 · doi:10.1007/3-540-58419-6_126
- 10.1109/IJCNN.1991.155324 · DOI
- 10.1145/175247.175255 · DOI · Paper page
- tkacik, 2003, a hardware random number generator, ser Lecture Notes in Computer Science, 2523, 450, 10.1007/3-540-36400-5_32 · DOI
Cited by
BinaryConnect: Training Deep Neural Networks with binary weights during propagations
Courbariaux, M., Bengio, Y., & David, J.-P. (2015) · arXiv · doi:10.48550/arxiv.1511.00363 · Cited by 2,180
Ising machines as hardware solvers of combinatorial optimization problems
Mohseni, N., McMahon, P. L., & Byrnes, T. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00440-8 · Cited by 543
Self-citationTraining deep neural networks with low precision multiplications
Courbariaux, M., Bengio, Y., & David, J.-P. (2014) · arXiv · doi:10.48550/arxiv.1412.7024 · Cited by 407
NeuFlow: A runtime reconfigurable dataflow processor for vision
Farabet, C., Martini, B., Corda, B., Akselrod, P., Culurciello, E., & LeCun, Y. (2011) · CVPR 2011 WORKSHOPS · doi:10.1109/cvprw.2011.5981829 · Cited by 369
A Survey of Neuromorphic Computing and Neural Networks in Hardware
Schuman, C. D., Potok, T. E., Patton, R. M., Birdwell, J. D., Dean, M. E., Rose, G. S., & Plank, J. S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.06963 · Cited by 352
Metadata
- Authors
- Kim, S. K., McAfee, L. C., McMahon, P. L., & Olukotun, K.
- Venue
- 2009 International Conference on Field Programmable Logic and Applications
- Publisher
- IEEE
- Published
- 2009-08
- Pages
- 367-372
- OpenAlex
- W2122221396
- Cited by
- 80
- References
- 0
- FWCI
- 1.74
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A highly scalable Restricted Boltzmann Machine FPGA implementation. https://app.cochat.ai/papers/10.1109/fpl.2009.5272262
- The paper
- Kim, S. K., McAfee, L. C., McMahon, P. L., & Olukotun, K. (2009). A highly scalable Restricted Boltzmann Machine FPGA implementation. 2009 International Conference on Field Programmable Logic and Applications. https://doi.org/10.1109/fpl.2009.5272262
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.