mlsanityData to 14 Oct 2026

AIA: A 16nm Multicore SoC for Approximate Inference Acceleration Exploiting Non-normalized Knuth-Yao Sampling and Inter-Core Register Sharing

arXiv 2606.16148 ↗First posted 15 Jun 2026cs.ARcited by 0

On the map: Efficient LLM inference and serving → Serving systems and request scheduling

Abstract (arXiv)

Probabilistic graphical models (PMs) are popular to empower machine learning with the ability of reasoning and decision-making. To perform approximate inference in PMs, sampling-based Markov Chain Monte Carlo (MCMC) algorithms are commonly employed. Unfortunately, MCMC is compute-intensive and hard to run in parallel, resulting in inefficient execution on modern CPU/GPU platforms. This paper proposes name, an Approximate Inference Accelerator designed to empower decision-making and reasoning at the edge. name consists of a RISC-V host, and a 2D mesh of 16 customized RISC-V cores optimized to efficiently support PM inference, each featuring (i) a novel non-normalized Knuth-Yao sampler and interpolation unit; and (ii) core-to-core direct data access via the register file, which provides solutions for compute-intensive operations. To fully exploit the parallel potential of Markov Chain Monte Carlo (MCMC) algorithms, a customized compiler chain has been developed for effective spatial mapping and scheduling on the chip. name can generate 1277 MSample/s at 0.9V and 20 GSamples/s/W at 0.7V which is up to 2× faster and 1.45x more energy efficient compared to the previous state-of-the-art Markov Random Field (MRF) accelerator. We further map Bayesian Networks benchmark onto name to show the flexibility of our design.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Serving systems and request scheduling, one of 12 directions in Efficient LLM inference and serving. Builds on 4 of its 14 references that are in the map. First posted on arXiv 15 Jun 2026.

Builds on

4 of 14 references.

References · 4

  1. 20213DP3: 3D Scene Perception via Probabilistic Programmingcited by 26
  2. 2021DPU: DAG Processing Unit for Irregular Graphs with Precision-Scalable Posit Arithmetic in 28nmcited by 7
  3. 2020The Fast Loaded Dice Roller: A Near-Optimal Exact Sampler for Discrete Probability Distributionscited by 2
  4. 2021Accelerating Markov Random Field Inference with Uncertainty Quantificationcited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025ZettaLith: An Architectural Exploration of Extreme-Scale AI Inference Acceleration
  2. 2026Adaptive Parallel Monte Carlo Tree Search for Efficient Test-time Compute Scaling
  3. 2024Optimized Speculative Sampling for GPU Hardware Accelerators
  4. 2025Evaluating the Energy Efficiency of NPU-Accelerated Machine Learning Inference on Embedded Microcontrollers
  5. 2025Accelerated Parallel Tempering via Neural Transports
  6. 2026Architecture-Aware LLM Inference Optimization on AMD Instinct GPUs: A Comprehensive Benchmark and Deployment Study
  7. 2026FlashSampling: Fast and Memory-Efficient Exact Sampling
  8. 2026Scaling LLM Inference Beyond Amdahl`s Limits via Eliminating Non-Scalable Overheads ↗