Pith. sign in

REVIEW 2 cited by

HiPPO-KAN: Efficient KAN Model for Time Series Analysis

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

arxiv 2410.14939 v1 pith:J7XI7ELZ submitted 2024-10-19 cs.LG

classification cs.LG
keywords seriestimehippo-kanmodelparametercountdatawindow
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this study, we introduces a parameter-efficient model that outperforms traditional models in time series forecasting, by integrating High-order Polynomial Projection (HiPPO) theory into the Kolmogorov-Arnold network (KAN) framework. This HiPPO-KAN model achieves superior performance on long sequence data without increasing parameter count. Experimental results demonstrate that HiPPO-KAN maintains a constant parameter count while varying window sizes and prediction horizons, in contrast to KAN, whose parameter count increases linearly with window size. Surprisingly, although the HiPPO-KAN model keeps a constant parameter count as increasing window size, it significantly outperforms KAN model at larger window sizes. These results indicate that HiPPO-KAN offers significant parameter efficiency and scalability advantages for time series forecasting. Additionally, we address the lagging problem commonly encountered in time series forecasting models, where predictions fail to promptly capture sudden changes in the data. We achieve this by modifying the loss function to compute the MSE directly on the coefficient vectors in the HiPPO domain. This adjustment effectively resolves the lagging problem, resulting in predictions that closely follow the actual time series data. By incorporating HiPPO theory into KAN, this study showcases an efficient approach for handling long sequences with improved predictive accuracy, offering practical contributions for applications in large-scale time series data.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DMF2Mel: A Dynamic Multiscale Fusion Network for EEG-Driven Mel Spectrogram Reconstruction

    cs.SD 2025-07 reject novelty 5.0 of 10

    DMF2Mel, a dynamic multiscale fusion network, reports the best mel spectrogram reconstruction scores on SparrKULee, though test-set hyperparameter tuning makes the comparison unreliable.

  2. TFKAN: Time-Frequency KAN for Long-Term Time Series Forecasting

    cs.LG 2025-06 conditional novelty 5.0 of 10

    TFKAN places Kolmogorov-Arnold Networks directly on FFT coefficients alongside a time-domain KAN branch, improving long-term forecast accuracy on seven benchmark datasets.

Pith tools