Fisher Simplicity in Kolmogorov-Arnold Networks and Multilayer Perceptrons
cs.LG
Submitted: 2026-09-26
Updated: 2026-09-26
Code: https://github.com/atavory/fisher
Terminology
Sources
- Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architectures
- Generalization Bounds and Model Complexity for Kolmogorov-Arnold Networks
- Information-Theoretic Framework for Understanding Modern Machine-Learning
- Empirical Analysis of the Hessian of Over-Parametrized Neural Networks
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks