QL-LSTM: A Parameter-Efficient LSTM for Stable Long-Sequence Modeling

Isaac Kofi Nti
12/6/2025
cs.LGcs.AIcs.NE

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Recurrent neural architectures such as LSTM and GRU remain widely used in sequence modeling, but they continue to face two core limitations: redundant gate-specific parameters and reduced ability to retain information across long temporal distances. This paper introduces the Quantum-Leap LSTM (QL-LSTM), a recurrent architecture designed to address both challenges through two independent components. The Parameter-Shared Unified Gating mechanism replaces all gate-specific transformations with a single shared weight matrix, reducing parameters by approximately 48 percent while preserving full gating behavior. The Hierarchical Gated Recurrence with Additive Skip Connections component adds a multiplication-free pathway that improves long-range information flow and reduces forget-gate degradation. We evaluate QL-LSTM on sentiment classification using the IMDB dataset with extended document lengths, comparing it to LSTM, GRU, and BiLSTM reference models. QL-LSTM achieves competitive accuracy while using substantially fewer parameters. Although the PSUG and HGR-ASC components are more efficient per time step, the current prototype remains limited by the inherent sequential nature of recurrent models and therefore does not yet yield wall-clock speed improvements without further kernel-level optimization.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{nti2025qllstm,
  title  = {QL-LSTM: A Parameter-Efficient LSTM for Stable Long-Sequence Modeling},
  author = {Isaac Kofi Nti},
  year   = {2025},
  eprint = {2512.06582},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.06582v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.06582.svg)](https://codeofpaper.com/paper/2512.06582)

Discussion