HackerPapers

arXiv:2404.19756cs.LG

KAN: Kolmogorov-Arnold Networks

Ziming Liu, Yixuan Wang, Sachin Vaidya, Fabian Ruehle, James Halverson, Marin Soljačić, Thomas Y. Hou, Max Tegmark

Abstract

Inspired by the Kolmogorov-Arnold representation theorem, we propose Kolmogorov-Arnold Networks (KANs) as promising alternatives to Multi-Layer Perceptrons (MLPs). While MLPs have fixed activation functions on nodes ("neurons"), KANs have learnable activation functions on edges ("weights"). KANs have no linear weights at all -- every weight parameter is replaced by a univariate function parametrized as a spline. We show that this seemingly simple change makes KANs outperform MLPs in terms of accuracy and interpretability. For accuracy, much smaller KANs can achieve comparable or better accuracy than much larger MLPs in data fitting and PDE solving. Theoretically and empirically, KANs possess faster neural scaling laws than MLPs. For interpretability, KANs can be intuitively visualized and can easily interact with human users. Through two examples in mathematics and physics, KANs are shown to be useful collaborators helping scientists (re)discover mathematical and physical laws. In summary, KANs are promising alternatives for MLPs, opening opportunities for further improving today's deep learning models which rely heavily on MLPs.

arXiv comments
Accepted by International Conference on Learning Representations (ICLR) 2025 (conference version: https://openreview.net/forum?id=Ozo7qJ5vZi). Codes are available at https://github.com/KindXiaoming/pykan
Journal reference
DOI
Subjects
cs.LGMachine Learning cond-mat.dis-nnDisordered Systems and Neural Networks cs.AIArtificial Intelligence stat.MLMachine Learning (Statistics)

On Hacker News

Linked by 4 identifiable commenters in 4 comments across 2 threads, from May 2024 to Jul 2024. Found in 7 HN submissions from May 2024 to May 2024. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments2 threads

    • The original paper [1] used LBFGS [2], it is quasi-second-order optimization algorithm. [1] https://arxiv.org/pdf/2404.19756 - "Both MLPs and KANs are trained with LBFGS for 1800 steps in total." [2] https://en.wikipedia.org/wiki/Limited-memory_BFGS (Quasi-)Newton methods…

      theszView on HNParent context

  1. Kolmogorov-Arnold Networks 3 comments
    • At page 6 it explains how they did back propagation https://arxiv.org/pdf/2404.19756 (and in page 2 it says that previous efforts to leverage Kolmogorov-Arnold representation failed to use backpropagation), so maybe using backpropagation to train multilayer networks with this…

      nextaccounticView on HNParent context

    • Not for discontinuous functions, as your paper explains, we know that g exists for discontinuous bounded, but nothing to find it with. > A practical construction of g in cases with discontinuous bounded and un- bounded functions is not yet known. For such cases Theorem 2.1 gives…

      nyrikkiView on HNParent context

    • The paper [0] is pretty good for handling questions like those. > doesn't KA representation require continuous univariate functions? All multivariate continuous functions (on a bounded domain) can be represented as compositions of addition and univariate continuous functions.…

      hansvmView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.