Skip to main navigation Skip to search Skip to main content

A practitioner’s guide to Kolmogorov–Arnold networks

Research output: Contribution to journalJournal articlepeer-review

5 Citations (Scopus)

Abstract

Kolmogorov–Arnold Networks (KANs), whose design is inspired—rather than dictated— by the Kolmogorov superposition theorem, have emerged as a structured alternative to MLPs. This review provides a systematic and comprehensive overview of the rapidly expanding KAN literature. The review is organized around three core themes: (i) clarifying the relationships between KANs and Kolmogorov superposition theory (KST), MLPs, and classical kernel methods; (ii) analyzing basis functions as a central design axis; and (iii) summarizing recent advances in accuracy, efficiency, regularization, and convergence. Finally, we provide a practical “Choose–Your–KAN” guide and outline open research challenges and future directions. The accompanying GitHub repository (https://github.com/AmirNoori68/kan-review) serves as a structured reference for ongoing KAN research.
Original languageEnglish
Article number100991
Number of pages36
JournalComputer Science Review
Volume62
Early online date12 May 2026
DOIs
Publication statusE-pub ahead of print - 12 May 2026

User-Defined Keywords

  • Basis functions
  • Kernel methods
  • Kolmogorov superposition theorem
  • Kolmogorov–arnold networks
  • Neural network architectures
  • Physics-informed learning
  • function approximation

Fingerprint

Dive into the research topics of 'A practitioner’s guide to Kolmogorov–Arnold networks'. Together they form a unique fingerprint.

Cite this