mlsanityData to 14 Oct 2026

Optimized Architectures for Kolmogorov-Arnold Networks

arXiv 2512.12448 ↗First posted 13 Dec 2025cs.LG cs.NE physics.data-ancited by 1

Not on the map. Why?

Abstract (arXiv)

Efforts to improve Kolmogorov--Arnold networks (KANs) with architectural enhancements have been stymied by the complexity those enhancements bring, undermining the interpretability that makes KANs attractive in the first place. Here we study overprovisioned architectures combined with sparsification, deep supervision, and depth selection, to learn compact, interpretable KANs without sacrificing accuracy. Crucially, we focus on differentiable mechanisms under a principled minimum description length objective, jointly optimizing activations, structure, and depth end-to-end. Experiments across function approximation benchmarks, dynamical systems forecasting, and real-world prediction tasks demonstrate that sparsification alone is insufficient, but the combination with depth selection achieves competitive or superior accuracy while discovering substantially smaller models. The result is a principled path toward models that are both more expressive and more interpretable, addressing a key tension in scientific machine learning.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 29 of its 57 references that are in the map. First posted on arXiv 13 Dec 2025.

Builds on

29 of 57 references.

References · 29

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2016Densely Connected Convolutional Networkscited by 6,720
  3. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  4. 2018DARTS: Differentiable Architecture Searchcited by 1,798
  5. 2016Neural Architecture Search with Reinforcement Learningcited by 1,499
  6. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  7. 2018A Survey Of Methods For Explaining Black Box Modelscited by 973
  8. 2024KAN: Kolmogorov-Arnold Networkscited by 649
  9. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
  10. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  11. 2019The State of Sparsity in Deep Neural Networkscited by 476
  12. 2014Deeply-Supervised Netscited by 367
17 more
  1. 2018Learning Equations for Extrapolation and Controlcited by 156
  2. 2014A* Samplingcited by 151
  3. 2024Kolmogorov-Arnold Networks are Radial Basis Function Networkscited by 128
  4. 2024Wav-KAN: Wavelet Kolmogorov-Arnold Networkscited by 122
  5. 2024Chebyshev Polynomial-Based Kolmogorov-Arnold Networks: An Efficient Architecture for Nonlinear Function Approximationcited by 118
  6. 2024KAN 2.0: Kolmogorov-Arnold Networks Meet Sciencecited by 118
  7. 2016Extrapolation and learning equationscited by 110
  8. 2019Integration of Neural Network-Based Symbolic Regression in Deep Learning for Scientific Discoverycited by 93
  9. 2021Adaptive Inference through Early-Exit Networks: Design, Challenges and Directionscited by 75
  10. 2020Why should we add early exits to neural networks?cited by 70
  11. 2024KAN-ODEs: Kolmogorov-Arnold Network Ordinary Differential Equations for Learning Dynamical Systems and Hidden Physicscited by 59
  12. 2022Deep Learning and Symbolic Regression for Discovering Parametric Equationscited by 23
  13. 2024SineKAN: Kolmogorov-Arnold Networks Using Sinusoidal Activation Functionscited by 15
  14. 2025Initialization Schemes for Kolmogorov-Arnold Networks: An Empirical Studycited by 11
  15. 2024Data-driven model discovery with Kolmogorov-Arnold networkscited by 9
  16. 2025Multi-Exit Kolmogorov-Arnold Networks: enhancing accuracy and parsimonycited by 4
  17. 2025Softly Symbolifying Kolmogorov-Arnold Networkscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.