Pith. sign in

REVIEW 4 cited by

Exploring the Potential of Polynomial Basis Functions in Kolmogorov-Arnold Networks: A Comparative Study of Different Groups of Polynomials

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 2406.02583 v2 pith:3SE2LHGP submitted 2024-05-30 cs.LG cs.AIcs.CV

classification cs.LGcs.AIcs.CV
keywords polynomialsmodelsbasisfunctionspotentialcomplexgroupskolmogorov-arnold
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents a comprehensive survey of 18 distinct polynomials and their potential applications in Kolmogorov-Arnold Network (KAN) models as an alternative to traditional spline-based methods. The polynomials are classified into various groups based on their mathematical properties, such as orthogonal polynomials, hypergeometric polynomials, q-polynomials, Fibonacci-related polynomials, combinatorial polynomials, and number-theoretic polynomials. The study aims to investigate the suitability of these polynomials as basis functions in KAN models for complex tasks like handwritten digit classification on the MNIST dataset. The performance metrics of the KAN models, including overall accuracy, Kappa, and F1 score, are evaluated and compared. The Gottlieb-KAN model achieves the highest performance across all metrics, suggesting its potential as a suitable choice for the given task. However, further analysis and tuning of these polynomials on more complex datasets are necessary to fully understand their capabilities in KAN models. The source code for the implementation of these KAN models is available at https://github.com/seydi1370/Basis_Functions .

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Quantum Variational Activation Functions Empower Kolmogorov-Arnold Networks

    quant-ph 2025-09 reject novelty 5.0 of 10

    QKANs show strong empirical performance on regression, vision, and language tasks, but the claimed exponential parameter reduction is not rigorously established.

  2. Degree-Optimized Cumulative Polynomial Kolmogorov-Arnold Networks

    cs.LG 2025-05 conditional novelty 5.0 of 10

    CP-KAN reformulates polynomial degree selection in Chebyshev-based Kolmogorov-Arnold networks as a QUBO optimization problem and shows competitive regression performance with fewer parameters on several benchmarks.

  3. Low Tensor-Rank Adaptation of Kolmogorov--Arnold Networks

    cs.LG 2025-02 conditional novelty 5.0 of 10

    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.

  4. Improving KAN with CDF normalization to quantiles

    cs.LG 2025-07 conditional novelty 4.0 of 10

    CDF normalization to quantiles improves MNIST test accuracy and training speed of Legendre-KAN compared with min-max scaling.

Pith tools