Deep Learning Alternatives Of The Kolmogorov Superposition Theorem
Leonardo Ferreira Guilhoto, Paris Perdikaris
Abstract
This paper explores alternative formulations of the Kolmogorov Superposition Theorem (KST) as a foundation for neural network design. The original KST formulation, while mathematically elegant, presents practical challenges due to its limited insight into the structure of inner and outer functions and the large number of unknown variables it introduces. Kolmogorov-Arnold Networks (KANs) leverage KST for function approximation, but they have faced scrutiny due to mixed results compared to traditional multilayer perceptrons (MLPs) and practical limitations imposed by the original KST formulation. To address these issues, we introduce ActNet, a scalable deep learning model that builds on the KST and overcomes many of the drawbacks of Kolmogorov's original formulation. We evaluate ActNet in the context of Physics-Informed Neural Networks (PINNs), a framework well-suited for leveraging KST's strengths in low-dimensional function approximation, particularly for simulating partial differential equations (PDEs). In this challenging setting, where models must learn latent functions without direct measurements, ActNet consistently outperforms KANs across multiple benchmarks and is competitive against the current best MLP-based approaches. These results present ActNet as a promising new direction for KST-based deep learning applications, particularly in scientific computing and PDE simulation tasks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4e7ed27c-2353-4469-9bae-6ee073462b5bCited by top-tier papers3
- Initialization Schemes for Kolmogorov–Arnold Networks: An Empirical StudySpyros Rigas, Dhruv Verma, Georgios Alexandridis, Yixuan WangICLR 2026 · 13 citations
- On the Convergence of Two-Layer Kolmogorov-Arnold Networks with First-Layer TrainingSeyed Mohammad Eshtehardian, Mohammad Hossein Yassaee, Babak HosseinKhalajICLR 2026
- Deep Learning with Learnable Product-Structured ActivationsSaanjali Maharaj, Prasanth B. NairICLR 2026
Builds on7
- FlashAttention: Fast and Memory-Efficient Exact Attention with IO-AwarenessTri Dao, Daniel Y. Fu, Stefano Ermon, Atri Rudra et al.NeurIPS 2022 · 5,493 citations
- Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional DomainsMatthew Tancik, Pratul P. Srinivasan, Ben Mildenhall, Sara Fridovich-Keil et al.NeurIPS 2020 · 4,036 citations
- Implicit Neural Representations with Periodic Activation FunctionsVincent Sitzmann, Julien N. P. Martel, Alexander W. Bergman, David B. Lindell et al.NeurIPS 2020 · 4,008 citations
- Characterizing possible failure modes in physics-informed neural networksAditi S. Krishnapriyan, Amir Gholami, Shandian Zhe, Robert M. Kirby et al.NeurIPS 2021 · 1,421 citations
- PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph CompilationJason Ansel, Edward Z. Yang, Horace He, Natalia Gimelshein et al.ASPLOS 2024 · 693 citations
Related papers
- KAN: Kolmogorov-Arnold NetworksZiming Liu, Yixuan Wang, Sachin Vaidya, Fabian Ruehle et al.ICLR 2025
- From Kolmogorov to Cauchy: Shallow XNet Surpasses KANsXin Li, Xiaotao Zheng, Zhihong XiaNeurIPS 2025 · 1 citation
- U-KAN Makes Strong Backbone for Medical Image Segmentation and GenerationChenxin Li, Xinyu Liu, Wuyang Li, Cheng Wang et al.AAAI 2025 · 452 citations
- Incorporating Arbitrary Matrix Group Equivariance into KANsLexiang Hu, Yisen Wang, Zhouchen LinICML 2025
- Improving Memory Efficiency for Training KANs via Meta LearningZhangchi Zhao, Jun Shu, Deyu Meng, Zongben XuICML 2025
