KAConvNet introduces a Kolmogorov-Arnold Convolutional Layer to build networks competitive with ViTs and CNNs while offering stronger theoretical interpretability.
hub Canonical reference
Wav-kan: Wavelet kolmogorov-arnold networks
Canonical reference. 80% of citing Pith papers cite this work as background.
11
Pith papers citing it
Background
80% of classified citations
hub tools
citation-role summary
background 4
method 1
citation-polarity summary
representative citing papers
PU-GKAN applies Shepard normalization to Gaussian bases in KANs, yielding exact constant reproduction, reduced epsilon sensitivity, and better validation accuracy across tested regimes.
A stable operating interval for the Gaussian scale parameter ε in KANs is ε ∈ [1/(G-1), 2/(G-1)], derived from first-layer feature geometry and validated across multiple approximation and physics-informed problems.
Derives generalized formulas for KAN inference complexity using RM, BOP, and NABS metrics across B-spline, GRBF, Chebyshev, and Fourier variants.
InfinityKAN is a variational inference method that learns the number of basis functions per layer in KANs during training, matching or exceeding fixed-basis KAN performance across 18 datasets without manual selection.
GeoKAN learns a diagonal Riemannian metric to warp inputs for KAN models, enabling task-dependent resolution allocation for sharp and non-uniform regimes.
The work introduces a modulation-based analytical method for singularity proofs in singular PDEs and refines ML techniques like PINNs and KANs to identify blowup solutions, with application to the open 3D Keller-Segel problem.
Overprovisioned KANs with sparsification, deep supervision, and depth selection under differentiable MDL yield smaller models with competitive accuracy on benchmarks.
ATHENA introduces an agentic team framework that autonomously manages the end-to-end computational research lifecycle via a knowledge-driven HENA loop to achieve validation errors of 10^{-14} in scientific computing and machine learning tasks.
Automated methods based on Deep Symbolic Regression and Kolmogorov-Arnold Networks discover compact, interpretable path loss models that achieve high accuracy and reduce prediction errors by up to 75% compared to traditional approaches on synthetic and real datasets.
A systematic review of Kolmogorov-Arnold Networks that maps their relation to Kolmogorov superposition theory, MLPs, and kernels, examines basis-function design choices, summarizes performance advances, and supplies a practitioner's selection guide plus open challenges.
citing papers explorer
-
KAConvNet: Kolmogorov-Arnold Convolutional Networks for Vision Recognition
KAConvNet introduces a Kolmogorov-Arnold Convolutional Layer to build networks competitive with ViTs and CNNs while offering stronger theoretical interpretability.
-
Partition-of-Unity Gaussian Kolmogorov-Arnold Networks
PU-GKAN applies Shepard normalization to Gaussian bases in KANs, yielding exact constant reproduction, reduced epsilon sensitivity, and better validation accuracy across tested regimes.
-
Scale-Parameter Selection in Gaussian Kolmogorov-Arnold Networks
A stable operating interval for the Gaussian scale parameter ε in KANs is ε ∈ [1/(G-1), 2/(G-1)], derived from first-layer feature geometry and validated across multiple approximation and physics-informed problems.
-
Hardware-Oriented Inference Complexity of Kolmogorov-Arnold Networks
Derives generalized formulas for KAN inference complexity using RM, BOP, and NABS metrics across B-spline, GRBF, Chebyshev, and Fourier variants.
-
Variational Kolmogorov-Arnold Network
InfinityKAN is a variational inference method that learns the number of basis functions per layer in KANs during training, matching or exceeding fixed-basis KAN performance across 18 datasets without manual selection.
-
Geometric Kolmogorov--Arnold Network (GeoKAN)
GeoKAN learns a diagonal Riemannian metric to warp inputs for KAN models, enabling task-dependent resolution allocation for sharp and non-uniform regimes.
-
Singularity Formation: Synergy in Theoretical, Numerical and Machine Learning Approaches
The work introduces a modulation-based analytical method for singularity proofs in singular PDEs and refines ML techniques like PINNs and KANs to identify blowup solutions, with application to the open 3D Keller-Segel problem.
-
Optimized Architectures for Kolmogorov-Arnold Networks
Overprovisioned KANs with sparsification, deep supervision, and depth selection under differentiable MDL yield smaller models with competitive accuracy on benchmarks.
-
ATHENA: Agentic Team for Hierarchical Evolutionary Numerical Algorithms
ATHENA introduces an agentic team framework that autonomously manages the end-to-end computational research lifecycle via a knowledge-driven HENA loop to achieve validation errors of 10^{-14} in scientific computing and machine learning tasks.
-
Automated Modeling Method for Pathloss Model Discovery
Automated methods based on Deep Symbolic Regression and Kolmogorov-Arnold Networks discover compact, interpretable path loss models that achieve high accuracy and reduce prediction errors by up to 75% compared to traditional approaches on synthetic and real datasets.
-
A Practitioner's Guide to Kolmogorov-Arnold Networks
A systematic review of Kolmogorov-Arnold Networks that maps their relation to Kolmogorov superposition theory, MLPs, and kernels, examines basis-function design choices, summarizes performance advances, and supplies a practitioner's selection guide plus open challenges.