ESTroM: Element-Flow Architecture for Processing Sparse Tractable Probabilistic Models
Anjunyi Fan, Xuejie Liu, Anji Liu, Qiuping Wu, Jiaqi Yang, Yuchao Qin, Guy Van den Broeck, Yitao Liang, Bonan Yan
摘要
Probabilistic Circuits (PCs) models are emerging popular tractable probabilistic models. Their internal connections are represented in the form of directed acyclic graphs (DAGs) with sum nodes and product nodes, ensuring their internal parameter efficiency and model expressiveness in terms of probabilistic inference. Despite these algorithmic advantages, executing PC still faces graph structure deployment issues. PyJuice on GPU with the block-sparse parallel computation methods causes a parallelism-sparsity gap, while DAG-style processing does not take advantage of the repetitive characteristics of PC internal nodes, resulting in low throughput. To address this challenge, this work proposes the ESTroM, an efficient architecture that provides novel graph-element (nodes/edges) parallelism with sparsity-aware compilation. Through analysis of the sum/product node computational requirements, ESTroM core uses compressed matrices for sum/product nodes DAG representations, edge-based dataflow for product node processing, and node-based dataflow for sum node processing. With intra-core rewind and intercore multicast optimizations, we develop a prototype ESTrom chip and a demonstrative system for a PC-based neural lossless compression application. Our ablation experiments show ESTrom offers a speed improvement ofcompared to the state-of-the-art DAG processing unit (DPU)-v2 with the same computing resources. Under various typical PC structures, ESTrom achieves a speedup ofcompared to DPU-v2 andcompared to NVIDIA RTX 4090 GPU with PyJuice framework. In terms of neural lossless compression, ESTroM demonstrates aimprovement in compression ratio compared to the industrial-standard Z-standard (Zstd) algorithms with the highest compression level, while offeringimprovement in compression speed compared to Zstd on Intel Xeon Gold 6230. In a nutshell, this work develops novel graph element parallelism and element-flow architecture theory with practical prototype chips and systems, revealing a new hardware-perspective path for the “scaling law” of emerging tractable probabilistic models.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- Scaling Tractable Probabilistic Circuits: A Systems PerspectiveAnji Liu, Kareem Ahmed, Guy Van den BroeckICML 2024 · 被引用 26 次
- Lossless Compression with Probabilistic CircuitsAnji Liu, Stephan Mandt, Guy Van den BroeckICLR 2022 · 被引用 29 次
- Sparse Probabilistic Circuits via Pruning and GrowingMeihua Dang, Anji Liu, Guy Van den BroeckNeurIPS 2022 · 被引用 25 次
- Einsum Networks: Fast and Scalable Learning of Tractable Probabilistic CircuitsRobert Peharz, Steven Lang, Antonio Vergari, Karl Stelzner 等ICML 2020 · 被引用 155 次
- Scaling Probabilistic Circuits via Monarch MatricesHonghua Zhang, Meihua Dang, Benjie Wang, Stefano Ermon 等ICML 2025
