REVIEW 7 cited by
Kolmogorov-Arnold Convolutions: Design Principles and Empirical Studies
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The emergence of Kolmogorov-Arnold Networks (KANs) has sparked significant interest and debate within the scientific community. This paper explores the application of KANs in the domain of computer vision (CV). We examine the convolutional version of KANs, considering various nonlinearity options beyond splines, such as Wavelet transforms and a range of polynomials. We propose a parameter-efficient design for Kolmogorov-Arnold convolutional layers and a parameter-efficient finetuning algorithm for pre-trained KAN models, as well as KAN convolutional versions of self-attention and focal modulation layers. We provide empirical evaluations conducted on MNIST, CIFAR10, CIFAR100, Tiny ImageNet, ImageNet1k, and HAM10000 datasets for image classification tasks. Additionally, we explore segmentation tasks, proposing U-Net-like architectures with KAN convolutions, and achieving state-of-the-art results on BUSI, GlaS, and CVC datasets. We summarized all of our findings in a preliminary design guide of KAN convolutional models for computer vision tasks. Furthermore, we investigate regularization techniques for KANs. All experimental code and implementations of convolutional layers and models, pre-trained on ImageNet1k weights are available on GitHub via this https://github.com/IvanDrokin/torch-conv-kan
Forward citations
Cited by 7 Pith papers
-
KANEL\'E: Kolmogorov-Arnold Networks for Efficient LUT-based Evaluation
Quantized, pruned Kolmogorov-Arnold Networks can be compiled directly into FPGA lookup tables, achieving extreme latency/resource reductions and matching state-of-the-art LUT-based networks on several benchmarks.
-
KAN-SAs: Efficient Acceleration of Kolmogorov-Arnold Networks on Systolic Arrays
A systolic-array accelerator that tabulates B-splines and exploits B-spline local support achieves ~100% PE utilization and a 2x cycle reduction for KAN inference compared with a conventional systolic array.
-
AgentHPOBench: A Benchmark For Evaluating LLM Agents as Sequential Hyperparameter Optimizers
A new 30-task benchmark shows LLM agents can improve real ML experiments through sequential hyperparameter choices, but their gains are uneven and often not retained.
-
Improving Memory Efficiency for Training KANs via Meta Learning
MetaKANs generates each KAN activation function from a shared prompt-conditioned meta-learner, cutting trainable parameters toward MLP level while retaining comparable or better accuracy on tested benchmarks.
-
Low Tensor-Rank Adaptation of Kolmogorov--Arnold Networks
A low tensor-rank adaptation (LoTRA) method and learning-rate guidance enable efficient fine-tuning of Kolmogorov-Arnold networks, validated on PDE solving and representation tasks.
-
Capsule-ConvKAN: A Hybrid Neural Approach to Medical Image Classification
A hybrid Capsule-ConvKAN model reports 91.21% accuracy on histopathological image classification, outperforming CNN, CapsNet, and ConvKAN baselines on a single dataset.
-
SegKAN: High-Resolution Medical Image Segmentation with Long-Distance Dependencies
A new segmentation architecture combining Fourier-based KAN convolution and a gated recurrent patch-sequence module improves hepatic vessel CT segmentation Dice by 1.78 points over TransUNet on one benchmark.
Discussion (0). Continue with ORCID to comment.