Pith. sign in

REVIEW 3 cited by

Kolmogorov-Arnold Networks in Low-Data Regimes: A Comparative Study with Multilayer Perceptrons

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

arxiv 2409.10463 v1 pith:CGB5XFIU submitted 2024-09-16 cs.LG stat.COstat.ML

classification cs.LGstat.COstat.ML
keywords mlpskansaccuracyactivationfunctionsnetworkssignificantlyachieve
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Multilayer Perceptrons (MLPs) have long been a cornerstone in deep learning, known for their capacity to model complex relationships. Recently, Kolmogorov-Arnold Networks (KANs) have emerged as a compelling alternative, utilizing highly flexible learnable activation functions directly on network edges, a departure from the neuron-centric approach of MLPs. However, KANs significantly increase the number of learnable parameters, raising concerns about their effectiveness in data-scarce environments. This paper presents a comprehensive comparative study of MLPs and KANs from both algorithmic and experimental perspectives, with a focus on low-data regimes. We introduce an effective technique for designing MLPs with unique, parameterized activation functions for each neuron, enabling a more balanced comparison with KANs. Using empirical evaluations on simulated data and two real-world data sets from medicine and engineering, we explore the trade-offs between model complexity and accuracy, with particular attention to the role of network depth. Our findings show that MLPs with individualized activation functions achieve significantly higher predictive accuracy with only a modest increase in parameters, especially when the sample size is limited to around one hundred. For example, in a three-class classification problem within additive manufacturing, MLPs achieve a median accuracy of 0.91, significantly outperforming KANs, which only reach a median accuracy of 0.53 with default hyperparameters. These results offer valuable insights into the impact of activation function selection in neural networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. PRKAN: Parameter-Reduced Kolmogorov-Arnold Networks

    cs.LG 2025-01 conditional novelty 6.0 of 10

    PRKAN lowers KAN parameter counts to near-MLP levels via attention, convolution/pooling, dimension summation, and feature-vector projections, reaching MLP-like accuracy on MNIST and Fashion-MNIST.

  2. Efficiency Bottlenecks of Convolutional Kolmogorov-Arnold Networks: A Comprehensive Scrutiny with ImageNet, AlexNet, LeNet and Tabular Classification

    cs.CV 2025-01 reject novelty 5.0 of 10

    CKANs are measurably less efficient than standard CNNs, and on ImageNet the accuracy gap is large, but the paper's baseline and timing comparisons are not controlled.

  3. KANs for Computer Vision: An Experimental Study

    cs.CV 2024-11 conditional novelty 2.0 of 10

    On MNIST, CIFAR-10, and Fashion-MNIST, KANs match MLP accuracy while using significantly more parameters and showing higher sensitivity to grid and order settings.

Pith tools