Hybrid LSTM-KAN Model Overview

• Hybrid LSTM-KAN models are neural architectures that integrate LSTM’s temporal memory with KAN’s adaptive univariate function approximations for enhanced time-series analysis.
• They employ diverse integration patterns—post-recurrent heads, intrinsic gating, and composite encoder-decoder designs—to effectively address various forecasting and classification tasks.
• Empirical studies demonstrate these models excel in parameter efficiency and improved prediction accuracy across domains like financial risk, respiratory sound detection, and cyber-security.

Searching arXiv for hybrid LSTM–KAN and closely related TKAN/KAN time-series papers. Hybrid LSTM-KAN models are neural architectures that combine Long Short-Term Memory (LSTM) sequence modeling with Kolmogorov-Arnold Networks (KANs), a class of networks in which learnable univariate functions are placed on edges rather than fixed activations on nodes. In the recent literature, the term denotes not a single canonical network but a family of designs that couple LSTM-style memory and gating with KAN-style functional approximation. The hybridization appears in at least three forms: a KAN used as a post-recurrent prediction head, a recurrent cell in which KAN computations are integrated into the gating or state-update mechanism, and larger composite systems in which LSTM-derived sequence encoders and KAN projection layers are embedded inside encoder-decoder pipelines (Genet et al., 2024). The hybrid idea is motivated by standalone evidence that KANs can outperform similarly shaped MLPs in time-series forecasting with fewer learnable parameters (Vaca-Rubio et al., 2024).

1. Theoretical basis and defining components

The KAN component is grounded in the Kolmogorov-Arnold representation theorem, written in the time-series literature as

$$f(\mathbf{x})=\sum_{i=1}^{2n+1}\Phi_i\left(\sum_{j=1}^n \phi_{i,j}(x_j)\right),$$

or equivalently,

$$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$

In KAN-based models, this theorem is interpreted as a network whose nonlinearities are carried by trainable univariate edge functions rather than by fixed node activations. A KAN layer is therefore a matrix of functions $\mathbf{\Phi}$, and the forward rule can be written as

$$x_{l+1,j}=\sum_{i=1}^{n_l}\phi_{l,j,i}(x_{l,i}), \qquad \mathbf{x}_{l+1}=\mathbf{\Phi}_l\mathbf{x}_l.$$

In the time-series forecasting work on satellite traffic, these edge functions are approximated with B-splines, with spline order $k$ and grid size $G$, and the network is trained by backpropagation because the construction is fully differentiable (Vaca-Rubio et al., 2024).

The LSTM component contributes stateful temporal memory through gated recurrence. In the loan-default formulation, the standard update is

$$f_t = \sigma(W_f[h_{t-1}]+b_f),\quad i_t = \sigma(W_i[h_{t-1},x_t]+b_i),$$

$$\tilde{c}_t = \tanh(W_c[h_{t-1},x_t]+b_c),\quad c_t = f_t \odot c_{t-1} + i_t \odot \tilde{c}_t,$$

$$o_t = \sigma(W_o[h_{t-1},x_t]+b_o),\quad h_t = o_t \odot \tanh(c_t).$$

This mechanism preserves useful historical information while filtering irrelevant past states (Yang et al., 18 Jul 2025).

The hybrid rationale is explicit across the literature: LSTM is used for temporal dependency capture and memory management, while KAN is used for more expressive nonlinear transformation after, within, or around the recurrent state evolution. This suggests a division of labor in which recurrence handles sequence structure and KAN handles adaptive feature-to-output mapping.

2. Architectural patterns

The literature suggests three recurring integration patterns.

Pattern	Representative structure	Example papers
Post-recurrent KAN head	recurrent encoder $\rightarrow$ KAN $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$0 classifier/regressor	(Yang et al., 18 Jul 2025, K. et al., 7 Jan 2026)
Intrinsic recurrent hybrid	KAN or RKAN inside LSTM-style gating/state update	(Genet et al., 2024, Hsu et al., 4 Dec 2025)
Composite encoder-decoder hybrid	LSTM-derived backbone with KAN projection blocks	(Guo et al., 13 Jan 2025, Hassanin, 30 Mar 2026)

In the post-recurrent design, the LSTM acts as a feature extractor and the KAN replaces the usual dense decision head. The loan-default model uses preprocessing, masking, two stacked LSTM layers, Batch Normalization, a KAN layer, a dense layer, Dropout, and a sigmoid output layer; the first LSTM has 128 units with return_sequences=True, the second has 64 units with return_sequences=False, and the KAN is specified with output_dim=1 and num_functions=10 (Yang et al., 18 Jul 2025). A related respiratory-sound classifier uses a BiLSTM with hidden size $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$1, Dropout $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$2, and a KAN back-end with one hidden KAN layer of $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$3 neurons and an output layer of $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$4 neurons, using cubic splines of order $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$5 and grid size $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$6 (K. et al., 7 Jan 2026).

In the intrinsic recurrent hybrid, the KAN machinery is folded into the recurrent dynamics themselves. TKAN introduces Recurrent Kolmogorov-Arnold Network (RKAN) layers together with LSTM-like gates and cell state, so that KAN computations become temporally aware through per-layer memory variables and the output gate is driven by an RKAN-based composite representation rather than by a standard affine map (Genet et al., 2024). QKAN-LSTM pushes this further by replacing the affine gate pre-activations with sums of KAN-like quantum-inspired variational activation functions, while preserving the external LSTM gate structure (Hsu et al., 4 Dec 2025).

In the composite encoder-decoder pattern, hybridization is distributed across a larger architecture. UNETVL replaces ViT encoder blocks in a UNETR-like 3D segmentation system with Vision-LSTM blocks and then replaces MLP-style up- and down-projection layers inside the modified ViL block with Chebyshev KAN layers (Guo et al., 13 Jan 2025). In IoT threat detection, the reported KAN-LSTM architecture is explicitly Preprocessing → 2 [CNN](https://www.emergentmind.com/topics/condensed-nearest-neighbour-cnn) layers → 1 LSTM layer → 2 KAN layers → classifier/output, assigning local feature extraction to CNN, temporal encoding to LSTM, and adaptive nonlinear decision mapping to KAN (Hassanin, 30 Mar 2026).

3. Mathematical forms of hybridization

A direct post-recurrent hybrid is summarized in the loan-default work as

$$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$7

where $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$8 is the predicted default probability (Yang et al., 18 Jul 2025). In this formulation, the recurrent block compresses the sequence into a hidden representation and the KAN transforms that representation using learnable univariate nonlinear functions before final classification.

TKAN uses a deeper integration. Its RKAN update is written as

$$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$9

with recurrent memory

$\mathbf{\Phi}$0

The LSTM-style gates remain largely standard,

$\mathbf{\Phi}$1

$\mathbf{\Phi}$2

but the output gate becomes

$\mathbf{\Phi}$3

where $\mathbf{\Phi}$4 is the RKAN-based composite representation, and the hidden state is

$\mathbf{\Phi}$5

The defining feature is therefore a dual memory structure: RKAN memory inside KAN layers for short-term temporal context and LSTM cell state for long-term dependency management (Genet et al., 2024).

QKAN-LSTM retains the LSTM shell while replacing each gate pre-activation with a KAN-like sum of learned functional units. For gate $\mathbf{\Phi}$6, with $\mathbf{\Phi}$7, the paper defines

$\mathbf{\Phi}$8

and then

$\mathbf{\Phi}$9

$$x_{l+1,j}=\sum_{i=1}^{n_l}\phi_{l,j,i}(x_{l,i}), \qquad \mathbf{x}_{l+1}=\mathbf{\Phi}_l\mathbf{x}_l.$$0

This formulation makes the hybridization occur directly at the gate level rather than in a separate readout head (Hsu et al., 4 Dec 2025).

In Chebyshev-KAN-based Vision-LSTM, the KAN module is defined through polynomial basis expansion rather than B-splines. The basis recursion is

$$x_{l+1,j}=\sum_{i=1}^{n_l}\phi_{l,j,i}(x_{l,i}), \qquad \mathbf{x}_{l+1}=\mathbf{\Phi}_l\mathbf{x}_l.$$1

and the output is formed by Einstein summation over basis tensor $$x_{l+1,j}=\sum_{i=1}^{n_l}\phi_{l,j,i}(x_{l,i}), \qquad \mathbf{x}_{l+1}=\mathbf{\Phi}_l\mathbf{x}_l.$$2 and coefficient tensor $$x_{l+1,j}=\sum_{i=1}^{n_l}\phi_{l,j,i}(x_{l,i}), \qquad \mathbf{x}_{l+1}=\mathbf{\Phi}_l\mathbf{x}_l.$$3. This is a distinct KAN instantiation but preserves the central idea of edge-wise functional approximation (Guo et al., 13 Jan 2025).

4. Empirical record across domains

In time-series forecasting, the empirical basis for hybrid LSTM-KAN models begins with standalone KAN results. On satellite traffic forecasting, a 4-depth KAN with architecture $$x_{l+1,j}=\sum_{i=1}^{n_l}\phi_{l,j,i}(x_{l,i}), \qquad \mathbf{x}_{l+1}=\mathbf{\Phi}_l\mathbf{x}_l.$$4, using B-spline activations with $$x_{l+1,j}=\sum_{i=1}^{n_l}\phi_{l,j,i}(x_{l,i}), \qquad \mathbf{x}_{l+1}=\mathbf{\Phi}_l\mathbf{x}_l.$$5 and $$x_{l+1,j}=\sum_{i=1}^{n_l}\phi_{l,j,i}(x_{l,i}), \qquad \mathbf{x}_{l+1}=\mathbf{\Phi}_l\mathbf{x}_l.$$6, reports MSE $$x_{l+1,j}=\sum_{i=1}^{n_l}\phi_{l,j,i}(x_{l,i}), \qquad \mathbf{x}_{l+1}=\mathbf{\Phi}_l\mathbf{x}_l.$$7, RMSE $$x_{l+1,j}=\sum_{i=1}^{n_l}\phi_{l,j,i}(x_{l,i}), \qquad \mathbf{x}_{l+1}=\mathbf{\Phi}_l\mathbf{x}_l.$$8, MAE $$x_{l+1,j}=\sum_{i=1}^{n_l}\phi_{l,j,i}(x_{l,i}), \qquad \mathbf{x}_{l+1}=\mathbf{\Phi}_l\mathbf{x}_l.$$9, MAPE $k$0, and $k$1k parameters; the compared 3-depth and 4-depth MLPs use $k$2k and $k$3k parameters, respectively, with worse error metrics (Vaca-Rubio et al., 2024). This does not yet constitute a hybrid model, but it provides the empirical premise for replacing MLP heads in recurrent systems.

TKAN supplies the first explicit recurrent KAN-LSTM synthesis for multi-step forecasting. On Bitcoin market traded notional values, its $k$4 is $k$5 at 1-step ahead, slightly below GRU at $k$6, but at 6 steps ahead TKAN reaches $k$7 while GRU drops to $k$8 and LSTM to $k$9; at 12 and 15 steps ahead, GRU and LSTM are negative while TKAN remains positive at $G$0 and $G$1 (Genet et al., 2024). The reported training and validation curves are also described as much closer together for TKAN than for GRU or LSTM.

In financial risk modeling, LSTM-KAN and GRU-KAN are evaluated for loan-default early prediction on the Freddie Mac Single-Family Loan-Level dataset. The abstract reports over $G$2 accuracy three months in advance and over $G$3 accuracy eight months in advance. Within the early-prediction analysis, the best AUC at the 3-month blank interval is reported for LSTM-KAN with average AUC $G$4, and the paper states that the proposed models can achieve at a 5-month blank interval roughly the same accuracy, recall, and F1 that baseline models achieve at 3 months, implying about 2 additional months of warning time (Yang et al., 18 Jul 2025).

In imbalanced respiratory sound classification on the ICBHI 2017 Respiratory Sound Database, the Hybrid LSTM-KAN model reports $G$5 accuracy, macro precision $G$6, macro recall $G$7, macro-F1 $G$8, and weighted-F1 $G$9, with the dominant COPD class comprising about $$f_t = \sigma(W_f[h_{t-1}]+b_f),\quad i_t = \sigma(W_i[h_{t-1},x_t]+b_i),$$0 of the filtered dataset. The ablation study reports a baseline cross-entropy system at $$f_t = \sigma(W_f[h_{t-1}]+b_f),\quad i_t = \sigma(W_i[h_{t-1},x_t]+b_i),$$1 accuracy and macro-F1 $$f_t = \sigma(W_f[h_{t-1}]+b_f),\quad i_t = \sigma(W_i[h_{t-1},x_t]+b_i),$$2, rising to $$f_t = \sigma(W_f[h_{t-1}]+b_f),\quad i_t = \sigma(W_i[h_{t-1},x_t]+b_i),$$3 and $$f_t = \sigma(W_f[h_{t-1}]+b_f),\quad i_t = \sigma(W_i[h_{t-1},x_t]+b_i),$$4 when focal loss, class-specific augmentation, and SMOTE are combined. Per-class F1 for the proposed model is $$f_t = \sigma(W_f[h_{t-1}]+b_f),\quad i_t = \sigma(W_i[h_{t-1},x_t]+b_i),$$5 for Bronchiectasis, $$f_t = \sigma(W_f[h_{t-1}]+b_f),\quad i_t = \sigma(W_i[h_{t-1},x_t]+b_i),$$6 for Pneumonia, $$f_t = \sigma(W_f[h_{t-1}]+b_f),\quad i_t = \sigma(W_i[h_{t-1},x_t]+b_i),$$7 for URTI, and $$f_t = \sigma(W_f[h_{t-1}]+b_f),\quad i_t = \sigma(W_i[h_{t-1},x_t]+b_i),$$8 for Bronchiolitis (K. et al., 7 Jan 2026).

In cyber-security threat detection, KAN-LSTM is benchmarked on UNSW-NB15, NSL-KDD, CICIDS2017, and a combined Tri-IDS dataset. Reported results are $$f_t = \sigma(W_f[h_{t-1}]+b_f),\quad i_t = \sigma(W_i[h_{t-1},x_t]+b_i),$$9 accuracy, $$\tilde{c}_t = \tanh(W_c[h_{t-1},x_t]+b_c),\quad c_t = f_t \odot c_{t-1} + i_t \odot \tilde{c}_t,$$0 precision, $$\tilde{c}_t = \tanh(W_c[h_{t-1},x_t]+b_c),\quad c_t = f_t \odot c_{t-1} + i_t \odot \tilde{c}_t,$$1 recall, and $$\tilde{c}_t = \tanh(W_c[h_{t-1},x_t]+b_c),\quad c_t = f_t \odot c_{t-1} + i_t \odot \tilde{c}_t,$$2 F1 on UNSW-NB15; $$\tilde{c}_t = \tanh(W_c[h_{t-1},x_t]+b_c),\quad c_t = f_t \odot c_{t-1} + i_t \odot \tilde{c}_t,$$3, $$\tilde{c}_t = \tanh(W_c[h_{t-1},x_t]+b_c),\quad c_t = f_t \odot c_{t-1} + i_t \odot \tilde{c}_t,$$4, $$\tilde{c}_t = \tanh(W_c[h_{t-1},x_t]+b_c),\quad c_t = f_t \odot c_{t-1} + i_t \odot \tilde{c}_t,$$5, and $$\tilde{c}_t = \tanh(W_c[h_{t-1},x_t]+b_c),\quad c_t = f_t \odot c_{t-1} + i_t \odot \tilde{c}_t,$$6 on NSL-KDD; $$\tilde{c}_t = \tanh(W_c[h_{t-1},x_t]+b_c),\quad c_t = f_t \odot c_{t-1} + i_t \odot \tilde{c}_t,$$7, $$\tilde{c}_t = \tanh(W_c[h_{t-1},x_t]+b_c),\quad c_t = f_t \odot c_{t-1} + i_t \odot \tilde{c}_t,$$8, $$\tilde{c}_t = \tanh(W_c[h_{t-1},x_t]+b_c),\quad c_t = f_t \odot c_{t-1} + i_t \odot \tilde{c}_t,$$9, and $$o_t = \sigma(W_o[h_{t-1},x_t]+b_o),\quad h_t = o_t \odot \tanh(c_t).$$0 on CICIDS2017; and $$o_t = \sigma(W_o[h_{t-1},x_t]+b_o),\quad h_t = o_t \odot \tanh(c_t).$$1, $$o_t = \sigma(W_o[h_{t-1},x_t]+b_o),\quad h_t = o_t \odot \tanh(c_t).$$2, $$o_t = \sigma(W_o[h_{t-1},x_t]+b_o),\quad h_t = o_t \odot \tanh(c_t).$$3, and $$o_t = \sigma(W_o[h_{t-1},x_t]+b_o),\quad h_t = o_t \odot \tanh(c_t).$$4 on Tri-IDS (Hassanin, 30 Mar 2026).

Beyond 1D sequence tasks, hybridization also appears in 3D medical image segmentation. UNETVL reports mean Dice $$o_t = \sigma(W_o[h_{t-1},x_t]+b_o),\quad h_t = o_t \odot \tanh(c_t).$$5 on ACDC versus $$o_t = \sigma(W_o[h_{t-1},x_t]+b_o),\quad h_t = o_t \odot \tanh(c_t).$$6 for UNETR, and $$o_t = \sigma(W_o[h_{t-1},x_t]+b_o),\quad h_t = o_t \odot \tanh(c_t).$$7 on AMOS2022 versus $$o_t = \sigma(W_o[h_{t-1},x_t]+b_o),\quad h_t = o_t \odot \tanh(c_t).$$8 for UNETR. In the ablation table, the ViL-only configuration at $$o_t = \sigma(W_o[h_{t-1},x_t]+b_o),\quad h_t = o_t \odot \tanh(c_t).$$9 gives $\rightarrow$0 Dice on ACDC and $\rightarrow$1 on AMOS, while the KAN-enabled version at the same width improves to $\rightarrow$2 and $\rightarrow$3 (Guo et al., 13 Jan 2025).

5. Interpretability, efficiency, and limitations

Interpretability is a recurring argument for KAN-based hybrids. Because KAN replaces fixed activations and scalar weights with learnable univariate functions, the learned edge functions can in principle be inspected. The satellite-traffic paper explicitly contrasts this with opaque dense weight matrices, and the respiratory-sound study similarly presents KAN’s spline functions as offering insight into feature-to-class mappings (Vaca-Rubio et al., 2024). This interpretability claim is architectural rather than fully validated across all applications.

Efficiency claims are more conditional. In standalone forecasting, KAN can be markedly more parameter-efficient than matched MLP baselines, as in the $\rightarrow$4k-parameter KAN versus $\rightarrow$5k and $\rightarrow$6k MLPs on satellite traffic (Vaca-Rubio et al., 2024). In respiratory-sound classification, the reported Hybrid LSTM-KAN has $\rightarrow$7k parameters, training time $\rightarrow$8 min/epoch, inference time $\rightarrow$9 ms/sample, about $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$00 MB GPU memory during training, and about $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$01 MB during inference (K. et al., 7 Jan 2026). QKAN-LSTM reports a stronger parameter-efficiency result on Urban Telecommunication, with $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$02 total trainable parameters for QKAN-LSTM versus $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$03 for LSTM, corresponding to the paper’s headline $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$04 reduction (Hsu et al., 4 Dec 2025).

Yet KAN does not uniformly reduce cost. In UNETVL, enabling KAN at $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$05 increases parameters from $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$06M to $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$07M while improving Dice. The paper explicitly frames this as a tradeoff between expressiveness and model complexity (Guo et al., 13 Jan 2025). The lesson is that parameter efficiency depends on where KAN is inserted and which basis functions and widths are used.

The limitations are likewise consistent across papers. TKAN is not especially superior at very short horizons, where GRU can be slightly better, and its ablation study does not fully isolate the incremental contribution of RKAN versus the gate modifications (Genet et al., 2024). The standalone KAN forecasting study notes that robustness across diverse datasets is not yet fully established and that the architecture has not yet been shown to compete directly with more advanced temporal models such as LSTMs, GRUs, CNNs, or attention-based methods (Vaca-Rubio et al., 2024). The cyber-security study acknowledges slow processing, limited scalability, expensive training, and some stability issues for KANs (Hassanin, 30 Mar 2026). The respiratory-sound work notes that rare classes remain difficult, feature aggregation may lose fine-grained temporal information, only one public dataset is used, and no real-world clinical validation has yet been conducted (K. et al., 7 Jan 2026).

6. Research trajectory and conceptual boundaries

A common misconception is that “Hybrid LSTM-KAN” names a settled, standardized architecture. The literature indicates otherwise. TKAN is a recurrent KAN with explicit LSTM-like memory control; the loan-default and respiratory-sound systems are LSTM encoders with KAN heads; UNETVL is a Vision-LSTM plus Chebyshev-KAN encoder module inside a 3D segmentation pipeline; and QKAN-LSTM replaces affine gate transforms with KAN-like quantum-inspired activations. These are related by design philosophy rather than by a unique blueprint.

The broader research trajectory reinforces this point. In deep state-space recurrent modeling for Bitcoin regime prediction, the switching TKAN variant, m-TKAN, reports accuracy $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$08 versus $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$09 for m-LSTM and $$f(x_1,\dots,x_n)=\sum_{q=1}^{2n+1}\Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right).$$10 for m-GRU, together with the strongest reported in-sample and out-of-sample risk-adjusted backtesting metrics among the three switching models (Inzirillo, 2024). In option pricing, by contrast, the literature provides a complementary result: KAN outperforms MLP and TDNN as a nonlinear approximator, while the best overall model is an LSTM-GRU hybrid RNN with attention, and the authors explicitly identify integrating LSTM or GRU layers and attention mechanisms into MLP and KAN models as future work (Ter-Avanesov et al., 2024). This suggests that the current field treats KAN and recurrent modeling as complementary rather than mutually exclusive.

A plausible implication is that the appropriate hybrid design depends on the bottleneck of the target problem. If the main difficulty lies in mapping a recurrent latent state to a complex output manifold, a KAN head may be sufficient. If the difficulty lies inside the recurrent transition itself, an intrinsic recurrent-KAN design such as TKAN or QKAN-LSTM is more directly aligned with the problem. If long-range context, local structure, and dense reconstruction must all be handled simultaneously, as in 3D segmentation or network-traffic analysis, composite hybrids become more natural.

Hybrid LSTM-KAN modeling therefore designates a developing research area rather than a finalized architecture class. Its unifying theme is the attempt to combine recurrent memory control with adaptive edge-wise function approximation, while negotiating a recurring tradeoff among expressiveness, parameter count, training stability, and implementation complexity.