$$\rightleftharpoonup{xx}$$
$$\longleftharp{xx}$$,
$$\longrightharp{xx}$$,
This section elaborates on the methodological framework of the proposed GARCH-BiLSTM-KAN hybrid model, which integrates the strengths of GARCH for volatility modeling, BiLSTM for bidirectional temporal dependency capture, and KAN for nonlinear refinement. The architecture is designed to address the multifaceted characteristics of financial time series, including volatility clustering, temporal asymmetry, and complex nonlinear patterns. Figure 1 shows the overall framework flowchart of the GARCH-BiLSTM-KAN hybrid model.
GARCH for volatility estimation
The Generalized Autoregressive Conditional Heteroskedasticity (GARCH) model, proposed by Bollerslev (1986)21, serves as the foundational component for volatility estimation in this hybrid framework. Financial time series, such as stock returns, exhibit volatility clustering-periods of high volatility followed by high volatility and low volatility followed by low volatility-which violates the homoskedasticity assumption of traditional linear models. GARCH models capture this phenomenon by modeling the conditional variance as a function of past squared residuals and past conditional variances.
Mathematical formalization
For a given time series of returns rt, the GARCH (p, q) specification consists of two equations: the mean equation and the variance equation. The mean equation is defined as:

where μ is the constant mean return, and
is the error term at time t, which follows a conditional normal distribution
with Ft-1 representing the information set up to time t - 1.
The conditional variance
, which measures the volatility, is specified in the GARCH (p, q) variance equation as:
where ω > 0 is the constant term, αi ≥ 0 are the ARCH coefficients capturing the impact of past squared residuals (news about volatility from the recent past), and βj ≥ 0 are the GARCH coefficients representing the persistence of volatility. To ensure the positivity and stationarity of the conditional variance, the parameters must satisfy ω > 0, αi ≥ 0, βj ≥ 0, and
.
In this hybrid model, the GARCH (1,1) variant was employed, which is parsimonious and widely documented to effectively capture volatility dynamics in financial data21,22.The estimated conditional volatility
from GARCH (1,1) serves as a critical input to the subsequent BiLSTM and KAN components, providing a structured measure of historical volatility that complements the raw return series.
BiLSTM for bidirectional temporal learning
While GARCH models excel at volatility estimation, they are limited in capturing complex temporal dependencies, especially those involving long-range interactions and bidirectional relationships. To address this, a Bidirectional Long Short-Term Memory (BiLSTM) network is integrated, an extension of the LSTM architecture45, which is designed to model sequential data by preserving information from both past and future time steps.
Architecture specification
LSTM networks overcome the vanishing gradient problem of traditional Recurrent Neural Networks (RNNs) through a gated cell structure, enabling them to learn long-term dependencies. Each LSTM cell contains three key gates: the forget gate, input gate, and output gate, which regulate the flow of information into and out of the cell state Ct.
The mathematical formulation of each gate is defined as:
Forget Gate: Determines which information to discard from the cell state:
![figure-protocol-8 Recurrent neural network equation; ft = σ(Wf[ht-1, xt] + bf); diagram; neural network process.](/files/ftp_upload/69355/69355eq17.jpg)
Input Gate: Controls the update of the cell state with new information:
![figure-protocol-9 LSTM gate activation equation, \(\ i_t = \sigma(W_i[ h_{t-1}, x_t]+b_i)\ \).](/files/ftp_upload/69355/69355eq18.jpg)
![figure-protocol-10 LSTM cell equation Ct=tanh(Wc[ht-1,xt]+bc), formula illustrating neural network operation.](/files/ftp_upload/69355/69355eq19.jpg)
Cell State Update: Combines the forget gate output and input gate output

Output Gate: Determines the hidden state based on the cell state:
![figure-protocol-12 LSTM equation \(o_t = \sigma(W_o \cdot [h_{(t-1)}, x_t] + b_o)\); neural network formula.](/files/ftp_upload/69355/69355eq22.jpg)

where σ is the sigmoid activation function,
denotes element-wise multiplication, xt is the input at time t, h{t-1} is the hidden state from the previous time step, W and b and are weight matrices and bias vectors, respectively.
Bidirectional processing:
The Bidirectional Long Short-Term Memory Network (BiLSTM) architecture consists of two parallel LSTM networks: a forward LSTM that processes the sequence from past to future (t = 1 to t = T) and a backward LSTM that processes it from future to past (t = T to t = 1). The hidden states from both directions are concatenated at each time step to form the final output, capturing both historical and future contextual information:



In this model, the BiLSTM is configured with 32 hidden units in each direction (64 after concatenation) and 2 layers, employing a dropout rate of 0.2 between layers to prevent overfitting. The network processes sequences of 19-time steps derived from the 20-day lookback window. The BiLSTM is configured with 32 hidden units in each direction (64 after concatenation) and 2 layers, trained using the Adam optimizer with a learning rate of 0.01. This allows the BiLSTM to learn temporal patterns in both returns and volatility, with the bidirectional design enabling it to capture asymmetric dependencies. The output of the BiLSTM,
, is a high-dimensional representation of bidirectional temporal features, which is fed into the KAN layer for further refinement. Figure 2 shows the schematic diagram of the hidden state fusion process in BiLSTM.
KAN for nonlinear refinement
Despite the strength of BiLSTM in modeling temporal dynamics, financial time series often exhibit highly nonlinear relationships that are challenging to capture with standard neural network architectures. To address this, a Kolmogorov-Arnold Network (KAN)43, a novel neural network paradigm that leverages the Kolmogorov-Arnold representation theorem to model complex nonlinear functions through a combination of univariate functions and linear operations is incorporated.
Mathematical foundation
KANs differ from traditional feedforward neural networks by replacing the linear transformations followed by activation functions in each layer with a set of univariate basis functions applied to individual input dimensions, followed by a linear combination. The Kolmogorov-Arnold representation theorem states that any multivariate continuous function can be represented as a composition of univariate functions:

Implementation specification:
In this specific implementation, a KAN layer transforms an input vector = [z1,z2,...,zd ] into an output vector y = [y1,y2,...,ym ]. The transformation for each output neuron k is defined by:

where Φ{k,i}: R
R are the learnable univariate basis functions. This study implements these functions Φ(x) as cubic B-splines for their smoothness and expressive power, as defined in

where Bj; are the third-order B-spline basis functions, cj are the trainable spline coefficients, and G is the number of basis functions, determined by the grid size and spline order.
Within the forecasting framework, the KAN layer receives the final hidden state
from the preceding Bidirectional LSTM layer as its input. The configured KAN has an architecture of [64, 1], meaning it accepts the 64-dimensional BiLSTM output and produces a single scalar value as the final forecast. The spline functions Φk,i are defined using a grid of 5 equidistant knots. To mitigate overfitting, an L1 regularization term with a coefficient of λ = 0.001 is applied to the spline coefficients during training. Furthermore, the spline grid is updated every 100 optimization steps to adaptively refine the function approximations based on the evolving loss landscape.
In this framework, the KAN receives the output of the BiLSTM layer,
, as input. The KAN has a width structure of [64,1] and uses cubic B-spline basis functions with 5 knots for Φk,i, chosen for their flexibility in approximating smooth nonlinear functions and interpretability43. The output of the KAN is denoted by
, represents the refined prediction after accounting for both temporal dependencies and nonlinear patterns. Figure 3 shows the schematic diagram of the KAN (Kolmogorov-Arnold Network) model structure.
Hybrid model integration
The GARCH-BiLSTM-KAN hybrid model is integrated in a sequential manner, where each component's output serves as input to the next, culminating in a final prediction. Table 1 summarizes all critical parameters for model replication. The parameters include GARCH order, BiLSTM architecture details, KAN configuration, and training hyperparameters. All parameter values reported in the text correspond exactly to those implemented in the code.
All model parameters are consistent across mathematical formulation, textual description, and code implementation: This ensures complete reproducibility and alignment between theoretical formulation and practical implementation. Table 1 summarizes the key parameters of each component.
GARCH preprocessing: The raw return series rt is first input to the GARCH(1,1) model to estimate the conditional volatility
. This step transforms the univariate return series into a bivariate sequence
, enriching the input with volatility information.
BiLSTM feature extraction: The bivariate sequence is fed into the BiLSTM network, which processes it in both forward and backward directions to generate bidirectional temporal features
. The network uses a lookback window of 20 to construct input sequences, with 32 hidden units per direction and 2 layers, trained via the Adam optimizer.
KAN refinement: The BiLSTM features
are input to the KAN, which applies cubic B-spline basis functions (with 5 knots) to each feature dimension, followed by a linear combination to produce the final prediction yt. The KAN has a width structure of [64,1] and uses the same Adam optimizer.
The sequential integration is theoretically motivated by the 'hierarchical feature refinement' principle: GARCH first decomposes raw returns into predictable volatility patterns, reducing noise for subsequent layers. BiLSTM then encodes bidirectional dependencies-forward LSTMs capture supply-driven trends, while backward LSTMs model demand expectations. Finally, KAN refines these temporal features using cubic B-splines, which outperform ReLU in approximating non-smooth functions. This pipeline ensures that volatility, temporal asymmetry, and nonlinearity are modeled as interdependent rather than isolated phenomena.
Training and loss function: The entire model is trained end-to-end for 100 epochs using a mean squared error (MSE) loss function, defined as:

where yt is the true value and
is the model's prediction. Three evaluation metrics are used to assess performance:
Root Mean squared Error (RMSE):

Mean Absolute Error (MAE):

Coefficient of Determination (R2):

The model is trained on 80% of the data (7877 samples) and tested on the remaining 20% (1969 samples), with price data normalized using MinMaxScaler (feature range = (-1, 1)) to facilitate training.
The integration of GARCH, BiLSTM, and KAN is motivated by their complementary strengths: GARCH provides a statistically grounded measure of volatility, BiLSTM captures bidirectional temporal dependencies in both returns and volatility, and KAN refines these features by modeling residual nonlinearities. This hierarchical approach ensures that the model leverages both parametric (GARCH) and nonparametric (BiLSTM, KAN) techniques, making it robust to the diverse characteristics of financial time series.
Experimental procedure overview
The experimental procedure was meticulously designed as a systematic pipeline to ensure the reproducibility and robustness of the findings. The process commenced with data acquisition, where daily West Texas Intermediate (WTI) crude oil price data spanning from 1986 to 2025 was sourced from the U.S. Energy Information Administration (EIA) database. Subsequently, the raw price data underwent a comprehensive preprocessing stage. To achieve stationarity, the raw prices were transformed into logarithmic returns. These return series were then normalized to the range of [-1, 1] using Min-Max scaling to facilitate stable and efficient model training.
Following preprocessing, the dataset was split into training and testing sets following a temporal order, with no shuffling, to preserve the chronological structure of the time series. To prevent any data leakage, all volatility modeling was strictly confined to the training data.
Specifically, for the initial model training and evaluation with the static 80-20 split, the GARCH(1,1) model was fitted exclusively on the training set (data from 1986 to 2016). The estimated parameters from this training period were then used to generate the conditional volatility series for both the training and test sets. This ensures that the volatility inputs for the BiLSTM and KAN components during testing are based solely on information available up to the time of prediction, without incorporating any future data from the test set.
Furthermore, for the rolling window validation introduced in the results section, this principle was rigorously upheld. For each rolling window, the GARCH(1,1) model was re-estimated from scratch using only the data within that specific training window. The resulting volatility estimates were then used as inputs for training the subsequent BiLSTM-KAN network and for forecasting the corresponding test window. This recursive re-estimation mimics a real-world forecasting scenario and guarantees that no future information is leaked at any step of the evaluation process.
For model input, a feature engineering step was conducted. This involved aligning the derived volatility series with the price returns to form bivariate input sequences, which were structured using a 20-day lookback window to capture temporal dependencies. During the model training phase, all neural network architectures were trained for 100 epochs. The optimization was performed using the Adam optimizer with a learning rate of 0.01, and the Mean Squared Error (MSE) served as the loss function to guide the learning process.
The evaluation of the models was carried out on a held-out test set, comprising 20% of the total data. Performance was quantified using a suite of metrics, including Root Mean Squared Error (RMSE), Mean Absolute Error (MAE), and the coefficient of determination (R²). To further substantiate the findings, a series of robustness tests were implemented, including ablation studies to assess component importance, rolling window validation to test temporal.
CODE AND DATA AVAILABILITY
The daily WTI crude oil price data used in this study are publicly available from the U.S. Energy Information Administration (EIA) database (https://www.eia.gov/dnav/pet/hist/RWTCd.htm) and have been validated using historical records from the Federal Reserve Economic Data (FRED) database (https://fred.stlouisfed.org/series/DCOILWTICO). All raw data, processed datasets, and the complete analysis code that support the findings of this study have been deposited in the Zenodo repository and are publicly available at DOI: 10.5281/zenodo.17614060. The provided source code encompasses the full implementation of the proposed GARCH-BiLSTM-KAN hybrid model, all benchmark models used for comparison, and the scripts necessary to replicate the entire experimental pipeline, including data preprocessing, model training, evaluation, and the generation of all figures and tables presented in this paper. To guarantee the reproducibility of the results, the repository includes detailed documentation for environment setup. Furthermore, this study employed a fixed random seed (42) across all experiments and utilized a consistent set of hyperparameters for model training. All neural networks were optimized using the Adam optimizer with a learning rate of 0.01 and a batch size of 32, trained for 100 epochs. This rigorous standardization ensures that the reported outcomes can be reliably replicated.