Search arXiv⌕ Search

arXiv · 2610.24386

Learning volatility-adaptive forgetting via GARCH-modulated LSTM for stock price forecasting

Abstract

Stock price forecasting is hindered by the heteroscedastic nature of financial time series, in which turbulent and tranquil regimes alternate. Although the Long Short-Term Memory (LSTM) network is widely used for this task, its gates are oblivious to such volatility variation, so memory retention remains fixed regardless of market conditions. A common remedy is to supply volatility estimates as an additional input feature, yet this leaves the internal memory dynamics untouched. Instead, volatility can serve as a direct regulatory signal over the gate activation itself. This paper presents the Gsigmoid-LSTM model, which embeds Generalized Autoregressive Conditional Heteroscedasticity (GARCH(1,1))-derived volatility estimates into the LSTM forgetting gate through the Gsigmoid activation function, a volatility-adaptive variant of the sigmoid that combines a volatility adjustment factor with slope regulation via a learnable parameter. The model thereby automatically prioritizes recent information during turbulent periods while preserving long-term dependencies in stable markets. In the engineering application of daily stock price forecasting, extensive experiments, including activation function comparisons, baseline evaluations, and ablation studies, demonstrate that this structural gating modification effectively improves forecasting accuracy and robustness. The proposed model significantly outperforms a feature-level fusion baseline carrying the same volatility signal on all five datasets, as confirmed by Diebold-Mariano tests with all p<0.01, attains the best average rank of 1.00 in the Friedman test across nine models, and achieves the lowest MSE and MAE on all five datasets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xin-Rui Lu, Da-Qing Zhang. 2026-10-17. Learning volatility-adaptive forgetting via GARCH-modulated LSTM for stock price forecasting. https://arxiv.org/abs/2610.24386

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

EBCC v0.2: Error bounded compression for weather and climate applications

As the resolution of weather and climate simulations increases, the amount of data produced is growing rapidly from hundreds of terabytes to tens of petabytes. These data volumes limit broader adoption, and their continued growth will soon exhaust available storage capacity. To address this problem, we present EBCC v0.2 (Error Bounded Climate-data Compressor). EBCC follows a two-layer compression approach: a base layer using JPEG2000 to capture the bulk of the data at high compression ratios, and a residual layer storing sparse wavelet coefficients to eliminate long-tail extreme errors efficiently. It supports three-dimensional chunks through a multicomponent transform (MCT) in the base layer. To achieve error bounded compression, we introduce error-bound-aware rate allocation in the JPEG2000 base layer. It selects coding passes to approximately satisfy the error target while optimizing the trade-off between compression ratio and mean squared error. We evaluate EBCC alongside established compression methods on benchmarks relevant to weather and climate science, including error statistics, sequential and parallel throughput tests, case studies of primitive and derived variables near a tropical cyclone, an analysis of global energy-budget closure, and a Lagrangian air-parcel trajectory simulation. EBCC either outperforms or closely follows the strongest existing baseline across these benchmarks at relative error targets ranging from 0.01% to 10%, achieving compression ratios from 15x to more than 300x. In the energy-budget-closure and Lagrangian-trajectory benchmarks, EBCC achieves more than 100x compression while keeping compression-induced errors below an assimilation-uncertainty reference derived from the ERA5 uncertainty ensemble. These results demonstrate that EBCC can produce heavily compressed weather and climate datasets suitable for downstream applications.

cs.CE↗

HP-GSBS: Accelerating greedy state boundary search with reusable interval statistics

Greedy State Boundary Search (GSBS) identifies transitions between relatively stable neural activity patterns, but repeated candidate evaluation makes large analyses expensive. HP-GSBS is an open-source Python package that reorganizes the search around reusable interval contributions and correlation statistics. Streaming candidate reduction and local refinement further reduce repeated work; CPU, PyTorch CUDA and Triton backends share sequential segmentation decisions. Across seven controlled workloads with two realizations each, median same-input speedups range from 154 to 1730 times. All 168 optimized executions reproduce original boundaries and selected state counts, with maximum absolute t-distance difference $1.88\times10^{-11}$. Four frozen EEG recordings provide complementary validation, including a complete input-to-segmentation application example. Batch processing, versioned result persistence and optional low-memory execution support recording collections and longer inputs. By removing redundant computation, HP-GSBS makes established neural-state segmentation faster while preserving its scientific outputs.

cs.CE↗

Surface matching for image-derived geometries with a projection-based separation of rigid body modes

The large diffeomorphic deformation metric mapping (LDDMM) framework offers numerous techniques for analyzing shapes and images. Surface matching computes a non-rigid, smooth, and invertible mapping that registers one surface to another. The computed deformation may contain rigid body motion, which frequently does not represent meaningful shape differences but is due to external factors like imaging modalities, such as the object's positioning during image acquisition. We present a simple extension to the LDDMM framework's surface matching that uniquely decomposes the computed deformation into rigid body modes (RBM) and RBM-free motion by introducing a suitable projection. This enables a focused analysis of each component individually and additionally helps to preserve the surface discretization quality. Three sets of examples illustrate our approach. A small-scale example demonstrates the proposed method's effects, followed by an example using a single pair of heart geometries, and finally an example involving a cohort of 98 heart shapes.

cs.CE↗