cs.LGNov 17, 2026

ResoLUT: Distilling Residual Networks into Lookup-Table Networks

Authors: Katarzyna Fojcik, Aidas Mikalauskas, Matthias Kampa, Renaldas Zioma, Jogundas Armaitis

Organizations: Wroclaw University of Science and Technology · Transcendent Logic · Vilnius University · Zurich University of Applied Sciences (ZHAW)

Abstract

Logic networks built from Boolean gates or lookup tables (LUTs) promise efficient hardware inference, but training them at depth and learning their connectivity remain difficult. We do not train logic as logic. Instead, ResoLUT distills a trained residual network (ResNet) layer by layer into LUT trees, preserving its multi-bit residual stream and BatchNorm while extracting connectivity from the teacher rather than learning it. To our knowledge, ResoLUT is the first convolutional logic network in computer vision to retain a ResNet-style multi-bit residual stream. Hard LUT decisions are used throughout training and inference, avoiding a discretization gap in the logic. ResoLUT-20 reaches 95.66% on CIFAR-10 with twice the trees, and ResoLUT-56 reaches 78.87% on CIFAR-100 and 53.69% on ImageNet at 64px, the best results of logic and lookup-table networks on CIFAR-10 and CIFAR-100, showing that LUT networks can scale in depth. We explore and quantify the role of the residuals and the tree budget and shape. The most optimized model, a ResoLUT-8 with one eighth of the trees and further optimizations, fits on an FPGA and reaches 90.04% at 189k images per second, the highest throughput among the compared models above 85% on CIFAR-10.

Figures & tables

Explore similar work

CardsList
  1. ConvLUT: Rethinking Convolutional Architectures for Ultra-Low-Latency LUT-Based Inference

    Nov 8, 2026Marta Andronic, Olivia Weng, Danial Zuberi +2Efficient Neural Network InferenceFPGA-Based Neural Network Acceleration