mlsanityData to 7 Oct 2026

Shift-Invariant Attribute Scoring for Kolmogorov-Arnold Networks via Shapley Value

arXiv 2510.01663 ↗First posted 2 Oct 2025cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

For many real-world applications, understanding feature-outcome relationships is as crucial as achieving high predictive accuracy. While traditional neural networks excel at prediction, their black-box nature obscures underlying functional relationships. Kolmogorov--Arnold Networks (KANs) address this by employing learnable spline-based activation functions on edges, enabling recovery of symbolic representations while maintaining competitive performance. However, KAN's architecture presents unique challenges for network pruning. Conventional magnitude-based methods become unreliable due to sensitivity to input coordinate shifts. We propose ShapKAN, a pruning framework using Shapley value attribution to assess node importance in a shift-invariant manner. Unlike magnitude-based approaches, ShapKAN quantifies each node's actual contribution, ensuring consistent importance rankings regardless of input parameterization. Extensive experiments on synthetic and real-world datasets demonstrate that ShapKAN preserves true node importance while enabling effective network compression. Our approach improves KAN's interpretability advantages, facilitating deployment in resource-constrained environments.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 25 of its 51 references that are in the map. First posted on arXiv 2 Oct 2025.

Builds on

25 of 51 references.

References · 25

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  3. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  4. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  5. 2024KAN: Kolmogorov-Arnold Networkscited by 634
  6. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
  7. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  8. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  9. 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
  10. 2020Improving KernelSHAP: Practical Shapley Value Estimation via Linear Regressioncited by 153
  11. 2024Kolmogorov-Arnold Networks are Radial Basis Function Networkscited by 125
  12. 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
13 more
  1. 2024KAN 2.0: Kolmogorov-Arnold Networks Meet Sciencecited by 116
  2. 2021Sampling Permutations for Shapley Value Estimationcited by 101
  3. 2022The Shapley Value in Machine Learningcited by 97
  4. 2019Pruning by Explaining: A Novel Criterion for Deep Neural Network Pruningcited by 89
  5. 2024KAN or MLP: A Fairer Comparisoncited by 71
  6. 2024Kolmogorov-Arnold Networks for Time Series: Bridging Predictive Power and Interpretabilitycited by 69
  7. 2021Have We Learned to Explain?: How Interpretability Methods Can Learn to Encode Predictions in their Interpretationscited by 59
  8. 2013Bounding the Estimation Error of Sampling-based Shapley Value Approximationcited by 56
  9. 2024shapiq: Shapley Interactions for Machine Learningcited by 42
  10. 2018Antithetic and Monte Carlo kernel estimators for partial rankingscited by 10
  11. 2020Shapley Value as Principled Metric for Structured Network Pruningcited by 8
  12. 2023Federated Learning for Clinical Structured Data: A Benchmark Comparison of Engineering and Statistical Approachescited by 8
  13. 2024A preliminary study on continual learning in computer vision using Kolmogorov-Arnold Networkscited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.