PRKAN: Parameter-Reduced Kolmogorov-Arnold Networks

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ta, Hoang-Thang, Thai, Duy-Quy, Tran, Anh, Sidorov, Grigori, Gelbukh, Alexander
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912227994370048
author Ta, Hoang-Thang
Thai, Duy-Quy
Tran, Anh
Sidorov, Grigori
Gelbukh, Alexander
author_facet Ta, Hoang-Thang
Thai, Duy-Quy
Tran, Anh
Sidorov, Grigori
Gelbukh, Alexander
contents Kolmogorov-Arnold Networks (KANs) represent an innovation in neural network architectures, offering a compelling alternative to Multi-Layer Perceptrons (MLPs) in models such as Convolutional Neural Networks (CNNs), Recurrent Neural Networks (RNNs), and Transformers. By advancing network design, KANs drive groundbreaking research and enable transformative applications across various scientific domains involving neural networks. However, existing KANs often require significantly more parameters in their network layers than MLPs. To address this limitation, this paper introduces PRKANs (Parameter-Reduced Kolmogorov-Arnold Networks), which employ several methods to reduce the parameter count in KAN layers, making them comparable to MLP layers. Experimental results on the MNIST and Fashion-MNIST datasets demonstrate that PRKANs outperform several existing KANs, and their variant with attention mechanisms rivals the performance of MLPs, albeit with slightly longer training times. Furthermore, the study highlights the advantages of Gaussian Radial Basis Functions (GRBFs) and layer normalization in KAN designs. The repository for this work is available at: https://github.com/hoangthangta/All-KAN.
format Preprint
id arxiv_https___arxiv_org_abs_2501_07032
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle PRKAN: Parameter-Reduced Kolmogorov-Arnold Networks
Ta, Hoang-Thang
Thai, Duy-Quy
Tran, Anh
Sidorov, Grigori
Gelbukh, Alexander
Machine Learning
Kolmogorov-Arnold Networks (KANs) represent an innovation in neural network architectures, offering a compelling alternative to Multi-Layer Perceptrons (MLPs) in models such as Convolutional Neural Networks (CNNs), Recurrent Neural Networks (RNNs), and Transformers. By advancing network design, KANs drive groundbreaking research and enable transformative applications across various scientific domains involving neural networks. However, existing KANs often require significantly more parameters in their network layers than MLPs. To address this limitation, this paper introduces PRKANs (Parameter-Reduced Kolmogorov-Arnold Networks), which employ several methods to reduce the parameter count in KAN layers, making them comparable to MLP layers. Experimental results on the MNIST and Fashion-MNIST datasets demonstrate that PRKANs outperform several existing KANs, and their variant with attention mechanisms rivals the performance of MLPs, albeit with slightly longer training times. Furthermore, the study highlights the advantages of Gaussian Radial Basis Functions (GRBFs) and layer normalization in KAN designs. The repository for this work is available at: https://github.com/hoangthangta/All-KAN.
title PRKAN: Parameter-Reduced Kolmogorov-Arnold Networks
topic Machine Learning
url https://arxiv.org/abs/2501.07032