REVIEW 26 cited by
KAN 2.0: Kolmogorov-Arnold Networks Meet Science
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
KAN 2.0: Kolmogorov-Arnold Networks Meet Science
read the original abstract
A major challenge of AI + Science lies in their inherent incompatibility: today's AI is primarily based on connectionism, while science depends on symbolism. To bridge the two worlds, we propose a framework to seamlessly synergize Kolmogorov-Arnold Networks (KANs) and science. The framework highlights KANs' usage for three aspects of scientific discovery: identifying relevant features, revealing modular structures, and discovering symbolic formulas. The synergy is bidirectional: science to KAN (incorporating scientific knowledge into KANs), and KAN to science (extracting scientific insights from KANs). We highlight major new functionalities in the pykan package: (1) MultKAN: KANs with multiplication nodes. (2) kanpiler: a KAN compiler that compiles symbolic formulas into KANs. (3) tree converter: convert KANs (or any neural networks) to tree graphs. Based on these tools, we demonstrate KANs' capability to discover various types of physical laws, including conserved quantities, Lagrangians, symmetries, and constitutive laws.
Forward citations
Cited by 26 Pith papers
-
CaLiSym: Learning Symplectic Dynamics of Real-World Systems through Structured Canonical Lifts
Exact symplectic learning extends to open robotic systems via an algebraic structured canonical lift, improving OOD autoregressive prediction on pendulum, quadrotor, and quadruped with parameter-efficient SympNets.
-
Hyperbolicity-Preserving Stochastic Galerkin Methods for Conservation Laws Based on Associative Truncated Products on Polynomial Spaces
Develops associative truncated products on polynomial spaces to construct hyperbolicity-preserving stochastic Galerkin discretizations for conservation laws, with consistency results and applications to Euler equations.
-
LLM-driven design of physics-constrained constitutive models: two agents are better than one
A Creator-Inspector multi-agent LLM pipeline for constitutive artificial neural networks increases the rate of models satisfying all nine physical constraints to 100% or 56% depending on the LLM backbone.
-
KAN-CL: Per-Knot Importance Regularization for Continual Learning with Kolmogorov-Arnold Networks
KAN-CL cuts catastrophic forgetting by 88-93% on Split-CIFAR-10/5T and Split-CIFAR-100/10T by anchoring KAN parameters at per-knot granularity while matching baseline accuracy.
-
In-Context Symbolic Regression for Robustness-Improved Kolmogorov-Arnold Networks
In-context symbolic regression methods improve robustness of symbolic formula recovery from KANs, cutting median OFAT test MSE by up to 99.8 percent across hyperparameter sweeps.
-
QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation
QKAN is a quantum algorithmic framework using block-encodings and QSVT to implement wide-and-shallow networks for quantum learning and compositional state preparation.
-
Quantum Kolmogorov--Arnold representation theorem for continuous unitary-valued maps
Continuous unitary maps near the identity admit exact Kolmogorov-Arnold decompositions as exp of summed univariate anti-Hermitian fields or as products of univariate matrix exponentials; the results fail globally on U(n).
-
Fast summation on rectangular cuboids with arbitrary periodicity in the DMK framework
DMK extended to rectangular cuboids with arbitrary periodicity via localized octree evaluations on cubical tilings and Fourier-space root-level summation with truncated kernels for reduced periodicity.
-
Decision-Making under Combinatorial Risk
People navigate combinatorial risk by focusing on core features like post-investment success probabilities rather than computing the full induced distribution, unless the PMF is explicitly displayed.
-
Fourier Feature Pyramids for Physics-Informed Neural Networks
beignet replaces random Fourier feature embeddings in PINNs with a trainable multi-resolution Fourier feature pyramid, achieving higher accuracy on PDE benchmarks with fewer parameters and near machine precision resid...
-
KAN-MLP-Mixer: A comprehensive investigation of the usage of Kolmogorov-Arnold Networks (KANs) for improving IMU-based Human Activity Recognition
A hybrid KAN-MLP model for IMU-based human activity recognition achieves 5.33% relative macro F1 improvement over pure MLPs on eight datasets by placing KANs at input embedding and classification stages.
-
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.
-
Sinc Kolmogorov-Arnold network and its application for solving PDEs with singularities
SincKANs integrate Sinc interpolation into KAN activations and report better empirical results than alternatives on function approximation and PINN tasks.
-
KAN-LSTM-Transformer Neural Networks, MFV and Cosmological Parameters
KLT-Net reconstructs the SN Ia distance modulus non-parametrically; with MFV M_B and flat-ΛCDM Bayesian/Hessian inference it yields H0 ≈ 69.6 km s⁻¹ Mpc⁻¹ and Ωm ≈ 0.30.
-
A Novel Tensor Product-Based Neural Network for Solving Partial Differential Equations
TPNet constructs multi-dimensional basis functions via tensor products of subnetwork outputs and solves for coefficients with least-squares to solve PDEs more efficiently than PINNs.
-
KAN-MLP-Mixer: A comprehensive investigation of the usage of Kolmogorov-Arnold Networks (KANs) for improving IMU-based Human Activity Recognition
A hybrid KAN-MLP architecture with KAN input embedding and specialized LarctanKAN classification layer yields 5.33% average macro F1 gain over pure-MLP baselines in IMU-based human activity recognition.
-
Hardware-Oriented Inference Complexity of Kolmogorov-Arnold Networks
Platform-independent formulas for KAN hardware inference complexity (RM, BOP, NABS) are derived for B-spline, GRBF, Chebyshev, and Fourier variants.
-
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.
-
Interpretable Clinical Classification with Kolmogorov-Arnold Networks
Logistic KAN and KAAM achieve competitive or superior accuracy on clinical datasets compared to linear, tree, and neural baselines while providing built-in interpretability via symbolic forms and feature-wise decompositions.
-
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 trad...
-
Nonlinear Factor Decomposition via Kolmogorov-Arnold Networks: A Spectral Approach to Asset Return Analysis
KAN-PCA is a KAN-encoder/linear-decoder autoencoder that strictly contains classical PCA and slightly raises in-sample explained variance on 20 stocks without an out-of-sample edge.
-
KANLib -- A Modular, Extensible and Fast Kolmogorov-Arnold Network Implementation
KANLib is a unified, extensible KAN framework supporting adaptive grids and basis functions that reproduces reference performance on the California Housing benchmark with competitive speed.
-
Kolmogorov--Arnold Networks as Implicit Regularizers: Noise Robustness and Interpretability for Stellar Classification
KAN noise robustness in star/galaxy/quasar classification arises from implicit C2-spline regularization rather than architecture, as weight-decay-tuned MLPs match performance on SDSS and DESI data.
-
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...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.