LTBs-KAN delivers linear-time B-spline evaluation in KANs plus parameter reduction via product-of-sums factorization, with competitive results on MNIST, Fashion-MNIST, and CIFAR-10.
PRKAN: Parameter-Reduced Kolmogorov-Arnold Networks
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
cs.LG 3roles
background 2polarities
background 2representative citing papers
Derives generalized formulas for KAN inference complexity using RM, BOP, and NABS metrics across B-spline, GRBF, Chebyshev, and Fourier variants.
SHARe-KAN compresses KAN prediction-head storage by 9.3X via post-training vector quantization at a 2-point mAP cost on PASCAL VOC detection, with no retraining and good zero-shot transfer.
citing papers explorer
-
LTBs-KAN: Linear-Time B-splines Kolmogorov-Arnold Networks
LTBs-KAN delivers linear-time B-spline evaluation in KANs plus parameter reduction via product-of-sums factorization, with competitive results on MNIST, Fashion-MNIST, and CIFAR-10.
-
Hardware-Oriented Inference Complexity of Kolmogorov-Arnold Networks
Derives generalized formulas for KAN inference complexity using RM, BOP, and NABS metrics across B-spline, GRBF, Chebyshev, and Fourier variants.
-
SHARe-KAN: Post-Training Vector Quantization for Cache-Resident KAN Inference
SHARe-KAN compresses KAN prediction-head storage by 9.3X via post-training vector quantization at a 2-point mAP cost on PASCAL VOC detection, with no retraining and good zero-shot transfer.