mlsanityData to 14 Oct 2026

FS-KAN: Permutation Equivariant Kolmogorov-Arnold Networks via Function Sharing

arXiv 2509.24472 ↗First posted 29 Sep 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Permutation equivariant neural networks employing parameter-sharing schemes have emerged as powerful models for leveraging a wide range of data symmetries, significantly enhancing the generalization and computational efficiency of the resulting models. Recently, Kolmogorov-Arnold Networks (KANs) have demonstrated promise through their improved interpretability and expressivity compared to traditional architectures based on MLPs. While equivariant KANs have been explored in recent literature for a few specific data types, a principled framework for applying them to data with permutation symmetries in a general context remains absent. This paper introduces Function Sharing KAN (FS-KAN), a principled approach to constructing equivariant and invariant KA layers for arbitrary permutation symmetry groups, unifying and significantly extending previous work in this domain. We derive the basic construction of these FS-KAN layers by generalizing parameter-sharing schemes to the Kolmogorov-Arnold setup and provide a theoretical analysis demonstrating that FS-KANs have the same expressive power as networks that use standard parameter-sharing layers, allowing us to transfer well-known and important expressivity results from parameter-sharing networks to FS-KANs. Empirical evaluations on multiple data types and symmetry groups show that FS-KANs exhibit superior data efficiency compared to standard parameter-sharing layers, by a wide margin in certain cases, while preserving the interpretability and adaptability of KANs, making them an excellent architecture choice in low-data regimes.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 43 of its 56 references that are in the map. First posted on arXiv 29 Sep 2025.

Builds on

43 of 56 references.

References · 43

  1. 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,248
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  3. 2018How Powerful are Graph Neural Networks?cited by 4,393
  4. 2020Point Transformercited by 1,470
  5. 2017Deep Setscited by 1,421
  6. 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,167
  7. 2016Group Equivariant Convolutional Networkscited by 1,165
  8. 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 881
  9. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
  10. 2018Hypergraph Neural Networkscited by 488
  11. 2019General E(2)-Equivariant Steerable CNNscited by 446
  12. 2019Provably Powerful Graph Networkscited by 389
31 more
  1. 2018Invariant and Equivariant Graph Networkscited by 346
  2. 2018On the Generalization of Equivariance and Convolution in Neural Networks to the Action of Compact Groupscited by 300
  3. 2017Learning SO(3) Equivariant Representations with Spherical CNNscited by 248
  4. 2021A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groupscited by 187
  5. 2019Universal Invariant and Equivariant Graph Neural Networkscited by 183
  6. 2022Sign and Basis Invariant Networks for Spectral Graph Representation Learningcited by 179
  7. 2019On the equivalence between graph isomorphism testing and function approximation with GNNscited by 172
  8. 2019On the Universality of Invariant Networkscited by 152
  9. 2017Equivariance Through Parameter-Sharingcited by 141
  10. 2024Kolmogorov-Arnold Networks are Radial Basis Function Networkscited by 128
  11. 2018Universal approximations of invariant maps by neural networkscited by 127
  12. 2024Chebyshev Polynomial-Based Kolmogorov-Arnold Networks: An Efficient Architecture for Nonlinear Function Approximationcited by 118
  13. 2023Equivariant Architectures for Learning in Deep Weight Spacescited by 107
  14. 2020Expressive Power of Invariant and Equivariant Graph Neural Networkscited by 100
  15. 2020On Learning Sets of Symmetric Elementscited by 98
  16. 2017Geometric Matrix Completion with Recurrent Multi-Graph Neural Networkscited by 88
  17. 2020On the Universality of Rotation Equivariant Point Cloud Networkscited by 80
  18. 2023Permutation Equivariant Neural Functionalscited by 70
  19. 2018Deep Models of Interactions Across Setscited by 69
  20. 2024A Survey on Kolmogorov-Arnold Networkcited by 68
  21. 2018Covariant Compositional Networks For Learning Graphscited by 54
  22. 2020Universal Equivariant Multilayer Perceptronscited by 49
  23. 2019On Universal Equivariant Set Networkscited by 45
  24. 2024On the expressiveness and spectral bias of KANscited by 37
  25. 2020The expressive power of kth-order invariant graph networkscited by 34
  26. 2024PointNet with KAN versus PointNet with MLP for 3D Classification and Segmentation of Point Setscited by 15
  27. 2024Endowing Interpretability for Neural Cognitive Diagnosis by Efficient Kolmogorov-Arnold Networkscited by 13
  28. 2024On the Robustness of Kolmogorov-Arnold Networks: An Adversarial Perspectivecited by 11
  29. 2024CF-KAN: Kolmogorov-Arnold Network-based Collaborative Filtering to Mitigate Catastrophic Forgetting in Recommender Systemscited by 8
  30. 2024Incorporating Arbitrary Matrix Group Equivariance into KANscited by 4
  31. 2023P-Tensors: a General Formalism for Constructing Higher Order Message Passing Networkscited by 2

Built on by

Not cited yet.