Enhancing LUT-based Deep Neural Networks Inference through Architecture and Connectivity Optimization

Binglei Lou, Ruilin Wu, Philip Leong
1/14/2026
cs.ARcs.AI

No confident code implementation found for this paper.

Abstract

Deploying deep neural networks (DNNs) on resource-constrained edge devices such as FPGAs requires a careful balance among latency, power, and hardware resource usage, while maintaining high accuracy. Existing Lookup Table (LUT)-based DNNs -- such as LogicNets, PolyLUT, and NeuraLUT -- face two critical challenges: the exponential growth of LUT size and inefficient random sparse connectivity. This paper presents SparseLUT, a comprehensive framework that addresses these challenges through two orthogonal optimizations. First, we propose an architectural enhancement that aggregates multiple PolyLUT sub-neurons via an adder, significantly reducing LUT consumption by 2.0x-13.9x and lowering inference latency by 1.2x-1.6x, all while maintaining comparable accuracy. Building upon this foundation, we further introduce a non-greedy training algorithm that optimizes neuron connectivity by selectively pruning less significant inputs and strategically regrowing more effective ones. This training optimization, which incurs no additional area and latency overhead, delivers consistent accuracy improvements across benchmarks -- achieving up to a 2.13% gain on MNIST and 0.94% on Jet Substructure Classification compared to existing LUT-DNN approaches.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lou2026enhancing,
  title  = {Enhancing LUT-based Deep Neural Networks Inference through Architecture and Connectivity Optimization},
  author = {Binglei Lou and Ruilin Wu and Philip Leong},
  year   = {2026},
  eprint = {2601.09773},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.09773v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.09773.svg)](https://codeofpaper.com/paper/2601.09773)

Discussion