Concurrent training methods for Kolmogorov-Arnold networks: Disjoint datasets and FPGA implementation
Andrew Polar, Michael Poluektov

TL;DR
This paper proposes concurrency-driven training enhancements for Kolmogorov-Arnold networks, achieving over 40x faster training on CPUs and FPGA implementation, by introducing pre-training, disjoint data training, and FPGA parallelisation.
Contribution
It introduces novel concurrency techniques for KAN training, including data disjoint training, pre-training, and FPGA parallelisation, significantly accelerating the process.
Findings
KANs trained with new methods are over 40 times faster than neural networks.
Parallelisation on FPGAs is successfully implemented and tested.
Experimental results are fully reproducible with available source code.
Abstract
The present paper introduces concurrency-driven enhancements to the training algorithm for the Kolmogorov-Arnold networks (KANs) that is based on the Newton-Kaczmarz (NK) method. Prior research shows that KANs trained using the NK-based approach significantly overtake classical neural networks based on multilayer perceptrons (MLPs) in terms of accuracy and training time. Although some parts of the algorithm, such as the evaluation of the basis functions, can be parallelised, the fundamental limitation lies in the sequential computation of the updates - each update depends on the results of the previous step, obstructing parallelisation. However, substantial acceleration is achievable. Three complementary strategies are proposed in the present paper: (i) a pre-training procedure tailored to the NK updates' structure, (ii) training on disjoint subsets of data, followed by models' merging,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
