Ultrafast On-chip Online Learning via Spline Locality in Kolmogorov-Arnold Networks

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Hoang, Duc, Gupta, Aarush, Harris, Philip
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917456033873920
author Hoang, Duc
Gupta, Aarush
Harris, Philip
author_facet Hoang, Duc
Gupta, Aarush
Harris, Philip
contents Ultrafast online learning is essential for high-frequency systems, such as controls for quantum computing and nuclear fusion, where adaptation must occur on sub-microsecond timescales. Meeting these requirements demands low-latency, fixed-precision computation under strict memory constraints, a regime in which conventional Multi-Layer Perceptrons (MLPs) are both inefficient and numerically unstable. We identify key properties of Kolmogorov-Arnold Networks (KANs) that align with these constraints. Specifically, we show that: (i) KAN updates exploiting B-spline locality are sparse, enabling superior on-chip resource scaling, and (ii) KANs are inherently robust to fixed-point quantization. By implementing fixed-point online training on Field-Programmable Gate Arrays (FPGAs), a representative platform for on-chip computation, we demonstrate that KAN-based online learners are significantly more efficient and expressive than MLPs across a range of low-latency and resource-constrained tasks. To our knowledge, this work is the first to demonstrate model-free online learning at sub-microsecond latencies.
format Preprint
id arxiv_https___arxiv_org_abs_2602_02056
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Ultrafast On-chip Online Learning via Spline Locality in Kolmogorov-Arnold Networks
Hoang, Duc
Gupta, Aarush
Harris, Philip
Hardware Architecture
Machine Learning
Systems and Control
Ultrafast online learning is essential for high-frequency systems, such as controls for quantum computing and nuclear fusion, where adaptation must occur on sub-microsecond timescales. Meeting these requirements demands low-latency, fixed-precision computation under strict memory constraints, a regime in which conventional Multi-Layer Perceptrons (MLPs) are both inefficient and numerically unstable. We identify key properties of Kolmogorov-Arnold Networks (KANs) that align with these constraints. Specifically, we show that: (i) KAN updates exploiting B-spline locality are sparse, enabling superior on-chip resource scaling, and (ii) KANs are inherently robust to fixed-point quantization. By implementing fixed-point online training on Field-Programmable Gate Arrays (FPGAs), a representative platform for on-chip computation, we demonstrate that KAN-based online learners are significantly more efficient and expressive than MLPs across a range of low-latency and resource-constrained tasks. To our knowledge, this work is the first to demonstrate model-free online learning at sub-microsecond latencies.
title Ultrafast On-chip Online Learning via Spline Locality in Kolmogorov-Arnold Networks
topic Hardware Architecture
Machine Learning
Systems and Control
url https://arxiv.org/abs/2602.02056