REVIEW 18 cited by
Chebyshev Polynomial-Based Kolmogorov-Arnold Networks: An Efficient Architecture for Nonlinear Function Approximation
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
Chebyshev Polynomial-Based Kolmogorov-Arnold Networks: An Efficient Architecture for Nonlinear Function Approximation
read the original abstract
Accurate approximation of complex nonlinear functions is a fundamental challenge across many scientific and engineering domains. Traditional neural network architectures, such as Multi-Layer Perceptrons (MLPs), often struggle to efficiently capture intricate patterns and irregularities present in high-dimensional functions. This paper presents the Chebyshev Kolmogorov-Arnold Network (Chebyshev KAN), a new neural network architecture inspired by the Kolmogorov-Arnold representation theorem, incorporating the powerful approximation capabilities of Chebyshev polynomials. By utilizing learnable functions parametrized by Chebyshev polynomials on the network's edges, Chebyshev KANs enhance flexibility, efficiency, and interpretability in function approximation tasks. We demonstrate the efficacy of Chebyshev KANs through experiments on digit classification, synthetic function approximation, and fractal function generation, highlighting their superiority over traditional MLPs in terms of parameter efficiency and interpretability. Our comprehensive evaluation, including ablation studies, confirms the potential of Chebyshev KANs to address longstanding challenges in nonlinear function approximation, paving the way for further advancements in various scientific and engineering applications.
Forward citations
Cited by 18 Pith papers
-
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.
-
Neural Discovery of Memory and Nonlocal Kernels in Integro-Differential Equations with Constrained Kolmogorov--Arnold Networks
Hard-constrained Bernstein MC-KANs recover positive, monotone, convex memory/nonlocal kernels from sparse noisy IDE data more robustly than soft-penalized Cheb-KANs, especially in 2D.
-
Inertia-Informed Federated Learning Control Framework for Distributed Smart Grid Resilience
Inertia-weighted FedAvg plus RoCoF-augmented ChebyKAN controllers achieve 75% generalization on unseen IEEE-39 faults and beat centralized PFL on two of three stabilized cases at full decentralization.
-
Quantum-classical physics-informed Kolmogorov-Arnold networks for PDEs
QCPIKAN is a quantum-classical physics-informed KAN that claims exponential high-frequency error convergence and superior accuracy over prior QCPINNs on single-phase, transport, and two-phase seepage PDEs.
-
Neural Spectral Element Methods for stiff multiphysics PDEs with electrochemical transport benchmarks
NSEM solves Poisson-Nernst-Planck benchmarks to 10^-4 to 10^-7 relative error using two orders of magnitude fewer collocation points than adaptive PINNs by combining spectral differentiation matrices with neural netwo...
-
Adaptive RBF-KAN: A Comparative Evaluation of Dynamic Shape Parameters in Kolmogorov-Arnold Networks
Adaptive RBF-KAN adds multiple radial basis kernels and LOOCV-based shape initialization to FastKAN, with benchmark tests on 2D functions showing kernel-specific advantages for smooth, discontinuous, and oscillatory cases.
-
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.
-
Learning continuous state of charge dependent thermal decomposition kinetics for Li-ion cathodes using Kolmogorov-Arnold Chemical Reaction Neural Networks (KA-CRNNs)
KA-CRNN learns continuous SOC-dependent kinetic parameters for cathode-electrolyte decomposition directly from DSC data, reproducing heat-release features across all SOCs for NCA, NM, and NMA cathodes.
-
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.
-
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.
-
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.
-
Process-Informed Forecasting of Complex Thermal Dynamics in Pharmaceutical Manufacturing
Process-Informed Forecasting models incorporating deterministic production recipe priors outperform ARIMA and deep learning baselines in accuracy, physical plausibility, and noise resilience for temperature forecastin...
-
Process-Informed Forecasting of Complex Thermal Dynamics in Pharmaceutical Manufacturing
PIF models incorporating production recipes as trajectory priors outperform purely data-driven models in accuracy, physical plausibility, and noise resilience for thermal forecasting in pharmaceutical manufacturing.
-
P1-KAN: an effective Kolmogorov-Arnold network with application to hydraulic valley optimization
P1-KAN introduces a new KAN architecture with theoretical approximation guarantees that outperforms MLPs and prior KAN variants on irregular functions while matching spline KAN accuracy on smooth ones, demonstrated on...
-
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.