Ultrafast FPGA-based inference and online learning using Kolmogorov-Arnold Networks
By
Aarush Gupta
The kind of bagel that ruins lesser bagels for you.
Summary
This post explains the author's Master's thesis on designing hardware architectures for ultrafast inference and online learning using Kolmogorov-Arnold Networks (KAN) on FPGAs. The work won the FPGA 2026 Best Paper award. The author assumes familiarity with ML concepts and digital circuits, and references two papers for detailed benchmarks and results.
Key quotes
· 3 pulledThis post is a high-level explainer for my Master's thesis, which involves designing hardware architectures for ultrafast inference and online learning using the Kolmogorov-Arnold Network (KAN) architecture.
I'll assume familiarity with standard machine learning concepts, as well as some understanding of hardware and digital circuits.
[FPGA 2026 Best Paper] Duc Hoang*, Aarush Gupta*, and Phi
You might also wanna read
Theoretical Analysis Reveals Why Linear RNNs Are More Parallelizable Than Nonlinear RNNs
This paper establishes a theoretical connection between types of RNNs and standard complexity classes to explain why linear RNNs (LRNNs) are
AI method developed to automatically design efficient quantum circuits
Researchers led by Gorka Muñoz-Gil from the Department of Theoretical Physics, in collaboration with NVIDIA and the group of theoretical phy
Study Reveals How RL and SFT Differently Teach Transformers Chain-of-Thought Reasoning on Sparse Boolean Functions
This research paper analyzes how transformers learn Chain-of-Thought (CoT) reasoning capabilities through Reinforcement Learning (RL) with p
Efficient Classical Computation of Quantum Neural Network Kernels
FarSkip-Collective: Unhobbling Blocking Communication in Mixture of Experts Models
Emergent Hebbian Dynamics in Regularized Learning: A Theoretical Analysis
This research paper investigates whether observed Hebbian/anti-Hebbian plasticity in synaptic updates necessarily implies an underlying Hebb
