aiqbench analysis
This research introduces TreeGRNG, a hardware-efficient Gaussian Random Number Generator designed specifically for Bayesian Neural Networks operating at the edge. By replacing complex arithmetic units with constant comparators and applying hardware-aware optimizations, it significantly reduces energy consumption while improving throughput and distribution flexibility compared to current state-of-the-art methods. This advancement directly addresses critical bottlenecks in implementing probabilistic AI on ultra-low-power devices.
TreeGRNG: Binary Tree Gaussian Random Number Generator for Efficient Probabilistic AI Hardware
arXiv:2606.16599v1 Announce Type: cross Abstract: Bayesian Neural Networks (BNNs) offer opportunities for greatly enhancing the trustworthiness of conventional neural networks by monitoring the uncertainties in decision-making. A significant drawback for BNN inference at the extreme edge, however, is the imperative need to incorporate Gaussian Random Number Generators (GRNG) within each neuron. State-of-the-art GRNG algorithms heavily depend on multiple arithmetic operations and the use of extensive look-up tables, posing significant implementation challenges for ultra-low power hardware implementations. To overcome this, this paper presents an innovative binary tree random number generator (TreeGRNG) allowing the use of ultra-low-cost constant comparators instead of arithmetic units. We further enhance the TreeGRNG proposal with a set of hardware-aware optimizations exploiting the Gaussian properties. The optimized TreeGRNG surpasses the State-of-the-Art (SoTA) in terms of distribution accuracy while achieving a 3.7$\times$ reduction in energy per sample and boosting the throughput per unit area by 5.8$\times$. Moreover, our TreeGRNG proposal possesses a distinct advantage over the current SoTA in terms of flexibility, as it easily enables designers to adjust the shape of the sampled probability distribution, extending beyond the capabilities of traditional GRNGs, opening the horizon towards future probabilistic AI designs. The TreeGRNG design is available open-source in the link
Abstract:Bayesian Neural Networks (BNNs) offer opportunities for greatly enhancing the trustworthiness of conventional neural networks by monitoring the uncertainties in decision-making. A significant drawback for BNN inference at the extreme edge, however, is the imperative need to incorporate Gaussian Random Number Generators (GRNG) within each neuron. State-of-the-art GRNG algorithms heavily depend on multiple arithmetic operations and the use of extensive look-up tables, posing significant implementation challenges for ultra-low power hardware implementations. To overcome this, this paper presents an innovative binary tree random number generator (TreeGRNG) allowing the use of ultra-low-cost constant comparators instead of arithmetic units. We further enhance the TreeGRNG proposal with a set of hardware-aware optimizations exploiting the Gaussian properties. The optimized TreeGRNG surpasses the State-of-the-Art (SoTA) in terms of distribution accuracy while achieving a 3.7$\times$ reduction in energy per sample and boosting the throughput per unit area by 5.8$\times$. Moreover, our TreeGRNG proposal possesses a distinct advantage over the current SoTA in terms of flexibility, as it easily enables designers to adjust the shape of the sampled probability distribution, extending beyond the capabilities of traditional GRNGs, opening the horizon towards future probabilistic AI designs. The TreeGRNG design is available open-source in the link
Hardware Architecture (cs.AR); Machine Learning (cs.LG)
arXiv:2606.16599 [cs.AR]
(or arXiv:2606.16599v1 [cs.AR] for this version)
https://doi.org/10.48550/arXiv.2606.16599 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
2024 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 1-6 (2024)
https://doi.org/10.23919/DATE58400.2024.10546516 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 317 words
Related coverage
Contributions to the hierarchy of probabilistic languages
arXiv · Sep 22, 2026
SNACK: A Sequential Notation Framework for Probabilistic Graph Generation
arXiv · Oct 15, 2026
Fundamental limits of parameter estimation with heralded optical non-Gaussian states generated from Gaussian resources
arXiv · Aug 7, 2026
Building Expressive and Tractable Probabilistic Generative Models: A Review
arXiv · Sep 2, 2026