REVIEW 13 cited by
Kolmogorov-Arnold Networks for Time Series: Bridging Predictive Power and Interpretability
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
read the original abstract
Kolmogorov-Arnold Networks (KAN) is a groundbreaking model recently proposed by the MIT team, representing a revolutionary approach with the potential to be a game-changer in the field. This innovative concept has rapidly garnered worldwide interest within the AI community. Inspired by the Kolmogorov-Arnold representation theorem, KAN utilizes spline-parametrized univariate functions in place of traditional linear weights, enabling them to dynamically learn activation patterns and significantly enhancing interpretability. In this paper, we explore the application of KAN to time series forecasting and propose two variants: T-KAN and MT-KAN. T-KAN is designed to detect concept drift within time series and can explain the nonlinear relationships between predictions and previous time steps through symbolic regression, making it highly interpretable in dynamically changing environments. MT-KAN, on the other hand, improves predictive performance by effectively uncovering and leveraging the complex relationships among variables in multivariate time series. Experiments validate the effectiveness of these approaches, demonstrating that T-KAN and MT-KAN significantly outperform traditional methods in time series forecasting tasks, not only enhancing predictive accuracy but also improving model interpretability. This research opens new avenues for adaptive forecasting models, highlighting the potential of KAN as a powerful and interpretable tool in predictive analytics.
Forward citations
Cited by 13 Pith papers
-
Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning
Gated QKAN-FWP combines fast weight programming with quantum-inspired Kolmogorov-Arnold networks via single-qubit DARUAN activations and gated updates to deliver a 12.5k-parameter model that outperforms larger classic...
-
SCOPE and SCION: A Benchmark and an Auditable Reference Pipeline for Schema Induction and Fusion from Text
A 24-dataset benchmark for inducing schema graphs from raw text, plus an auditable LLM-based pipeline that reports the highest scores on the benchmark's four schema-similarity metrics.
-
Temporal Functional Circuits: From Spline Plots to Faithful Explanations in KAN Forecasting
A gated residual KAN framework called Temporal Functional Circuits maps edge functions to input lags, ranks them by activation, and validates faithfulness via interventions showing that learned B-splines add predictiv...
-
A Kolmogorov-Arnold Surrogate Model for Chemical Equilibria: Application to Solid Solutions
Kolmogorov-Arnold networks trained on GEM-Selektor output accurately approximate chemical equilibria for cement and radium-sulfate solid-solution systems, outperforming MLPs on the cement benchmark and cutting evaluat...
-
Complementary Matrix-Gated QKAN Fast-Weight Programmers for Quantum Dynamics Forecasting
Complementary Matrix Gating gives QKAN fast-weight programmers coordinate-wise retain/write control and cuts multi-step quantum-dynamics forecast MSE by at least 91.2% versus scalar gates.
-
Pretrained Time-Series Foundation Models for Financial Return Forecasting
Pretrained TSFMs achieve top ranks on equity return tasks but show sparse, minimal improvements over random walk, serving as practical priors without reliable alpha generation.
-
KAN Text to Vision? The Exploration of Kolmogorov-Arnold Networks for Multi-Scale Sequence-Based Pose Animation from Sign Language Notation
KANMultiSign generates sign language poses from notation via coarse-to-fine multi-scale supervision and compact KAN-Transformer modules, achieving lower DTW joint error with fewer parameters than baselines on several ...
-
On the Rate of Convergence of Kolmogorov-Arnold Network Regression Estimators
The paper claims spline-parameterized KAN least-squares estimators achieve the minimax univariate regression rate O(n^{-2r/(2r+1)}) for additive and multiplicative KAN structures, independent of dimension.
-
Quantum Variational Activation Functions Empower Kolmogorov-Arnold Networks
QKANs show strong empirical performance on regression, vision, and language tasks, but the claimed exponential parameter reduction is not rigorously established.
-
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...
-
STKAN: Kolmogorov-Arnold Networks for Spatio-Temporal Forecasting
STKAN inserts Taylor-polynomial KAN token mixers into spatial and temporal mixing blocks and achieves small but consistent gains over strong baselines on three traffic-flow benchmarks and a tie on a fourth.
-
SechKAN: Kolmogorov-Arnold Networks with Hyperbolic Secant Functions
SechKAN combines sech basis functions with a 1D linear projection to build a KAN-style model whose parameter count matches MLPs and which is competitive or better than several KAN variants on tested benchmarks.
-
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 to comment.