arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.02583cs.LGcs.AIcs.CV
收藏

探索多项式基函数在 Kolmogorov-Arnold 网络中的潜力:不同多项式组的比较研究

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

University of Tehran(德黑兰大学)

Seyd Teymoor Seydi

AI总结:

本文调查了18种多项式作为Kolmogorov-Arnold网络基函数的适用性,在MNIST数据集上评估发现Gottlieb-KAN模型在各项指标表现最佳,为复杂任务提供了新方案。

摘要:

本文对 18 种不同的多项式及其在 Kolmogorov-Arnold Network (KAN) 模型中作为传统基于样条方法替代方案的潜在应用进行了全面调查。根据数学性质,这些多项式被分为正交多项式、超几何多项式、q-多项式、与 Fibonacci 相关的多项式、组合多项式和数论多项式等不同组。本研究旨在调查这些多项式作为 KAN 模型中基函数的适用性,用于处理 MNIST 数据集上的手写数字分类等复杂任务。对 KAN 模型的性能指标(包括总体准确率、Kappa 和 F1 分数)进行了评估和比较。Gottlieb-KAN 模型在所有指标上均取得了最高性能,表明其作为该给定任务合适选择的潜力。然而,为了充分理解它们在 KAN 模型中的能力,有必要在更复杂的数据集上对这些多项式进行进一步的分析和调优。这些 KAN 模型实现的源代码可在 https://github.com/seydi1370/Basis_Functions 获取。

英文摘要:

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 .

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑