Pith. sign in

REVIEW 9 cited by

TKAN: Temporal Kolmogorov-Arnold Networks

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 2405.07344 v4 pith:MAMRRARS submitted 2024-05-12 cs.LG cs.AI

classification cs.LGcs.AI
keywords networkskolmogorov-arnoldarchitecturedataforecastinginspiredlstmmemory
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recurrent Neural Networks (RNNs) have revolutionized many areas of machine learning, particularly in natural language and data sequence processing. Long Short-Term Memory (LSTM) has demonstrated its ability to capture long-term dependencies in sequential data. Inspired by the Kolmogorov-Arnold Networks (KANs) a promising alternatives to Multi-Layer Perceptrons (MLPs), we proposed a new neural networks architecture inspired by KAN and the LSTM, the Temporal Kolomogorov-Arnold Networks (TKANs). TKANs combined the strenght of both networks, it is composed of Recurring Kolmogorov-Arnold Networks (RKANs) Layers embedding memory management. This innovation enables us to perform multi-step time series forecasting with enhanced accuracy and efficiency. By addressing the limitations of traditional models in handling complex sequential patterns, the TKAN architecture offers significant potential for advancements in fields requiring more than one step ahead forecasting.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 9 Pith papers

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

  1. KANEL\'E: Kolmogorov-Arnold Networks for Efficient LUT-based Evaluation

    cs.AR 2025-12 conditional novelty 7.0 of 10

    Quantized, pruned Kolmogorov-Arnold Networks can be compiled directly into FPGA lookup tables, achieving extreme latency/resource reductions and matching state-of-the-art LUT-based networks on several benchmarks.

  2. Watermarking Kolmogorov-Arnold Networks for Emerging Networked Applications via Activation Perturbation

    cs.LG 2025-08 conditional novelty 6.0 of 10

    DCT-AW embeds a watermark into KAN layer-0 activation outputs via a discrete cosine transform perturbation, and a trained detector still recovers it after fine-tuning, pruning, and retraining.

  3. Improving Memory Efficiency for Training KANs via Meta Learning

    cs.LG 2025-06 conditional novelty 6.0 of 10

    MetaKANs generates each KAN activation function from a shared prompt-conditioned meta-learner, cutting trainable parameters toward MLP level while retaining comparable or better accuracy on tested benchmarks.

  4. Quantum Variational Activation Functions Empower Kolmogorov-Arnold Networks

    quant-ph 2025-09 reject novelty 5.0 of 10

    QKANs show strong empirical performance on regression, vision, and language tasks, but the claimed exponential parameter reduction is not rigorously established.

  5. Toroidal area-preserving parameterizations of genus-one closed surfaces

    math.NA 2025-08 unverdicted novelty 5.0 of 10

    Four Riemannian optimization algorithms (projected/Riemannian gradient and conjugate gradient) are proposed to compute toroidal area-preserving parameterizations by minimizing stretch energy on a power manifold of ring tori.

  6. 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.

  7. Capsule-ConvKAN: A Hybrid Neural Approach to Medical Image Classification

    eess.IV 2025-07 conditional novelty 4.0 of 10

    A hybrid Capsule-ConvKAN model reports 91.21% accuracy on histopathological image classification, outperforming CNN, CapsNet, and ConvKAN baselines on a single dataset.

  8. Localized Weather Prediction Using Kolmogorov-Arnold Network-Based Models and Deep RNNs

    cs.LG 2025-05 reject novelty 4.0 of 10

    KAN achieves R2 up to 0.9998 for daily temperature in Abidjan and Kigali, but missing split details and baselines make the result unverifiable and likely inflated.

  9. SigGate: Enhancing Recurrent Neural Networks with Signature-Based Gating Mechanisms

    cs.LG 2025-02 reject novelty 4.0 of 10

    A signature-based forget/reset gate that ignores the hidden state yields small and task-dependent R2 changes on two crypto forecasting tasks, not the consistent improvement claimed.

Pith tools