Skip to content
Preprint

Recurrent Neural Networks Beyond Time: Learning from Multiple Ordered Projections

Aug 2026 · 0 citations · 37 references
Computer Science

TL;DR

This work proposes the Independent Structural Expert Principle (ISEP), whereby projection-specific sequence models are trained independently before their learned representations are integrated through a dedicated fusion model, and presents Structural Evolution RNNs, which employ conventional RNNs as projection-specific structural experts while preserving the underlying recurrent computation unchanged.

Abstract

Recurrent neural networks (RNNs) are widely used for sequence learning, yet their application is commonly associated with temporal data, although recurrent computation fundamentally operates on ordered sequences rather than on time itself. Building on this observation, we introduce the Ordered Structural Dependency Hypothesis (OSDH), which proposes that multiple admissible orderings of the same observations may reveal complementary structural dependencies inaccessible through a single sequential organization. To operationalize this hypothesis, we propose the Independent Structural Expert Principle (ISEP), whereby projection-specific sequence models are trained independently before their learned representations are integrated through a dedicated fusion model. As a concrete realization, we present Structural Evolution RNNs (SE-RNNs), which employ conventional RNNs as projection-specific structural experts while preserving the underlying recurrent computation unchanged. Proof-of-concept experiments on three synthetic datasets with substantially different levels of structural complexity demonstrate that the proposed architecture consistently benefits from multiple ordered projections when hidden structural dependencies are present, while remaining competitive on simpler datasets. Since OSDH is independent of the underlying sequence-processing model, the proposed framework naturally extends beyond recurrent networks and may be instantiated using alternative architectures. The results suggest a general computational perspective for exploiting complementary ordered representations across diverse structured learning problems.

View source

Similar papers

#artificial intelligence Review Sep 2026

Memory in Deep Time-Series Models

This work develops a unified taxonomy of memory mechanisms and reviews three classes of external memory, including explicit modules, retrieval augmentation, and agentic stores, under a common framework for what is retained, how it is written and accessed, and how it persists.

M. Nguyen, H. Nguyen, Manh Nguyen et al. · 0 citations
Review Open access Sep 2026

An Introduction to Stochastic Deep Learning

Stochastic neural network broadens deep learning from prediction‐oriented function approximation to a richer framework for statistical inference, and two related architectures are discussed: kernel‐expanded StoNet and sublinearly structured DNNs, which can be viewed as structural or theoretical extensions of the StoNet...

Fa-Ming Liang · 0 citations
#machine learning Preprint Sep 2026

Reinforcement Learning with Complex (valued) Memories

Partially observable environments pose a fundamental challenge in deep reinforcement learning, requiring agents to compress temporal information from observations and maintain a memory to make effective decisions. While there exist many approaches ranging from gated recurrence to attention mechanisms and model-based RL...

Sathya Kamesh Bhethanabhotla, Efstratios Gavves, André Biedenkapp · 0 citations
#machine learning Preprint Aug 2026

Dynamic Compression in Recurrent Networks

Recurrent models process long contexts efficiently by compressing their history into a fixed-size state, but modern architectures typically do so in a single causal pass over the sequence. Each input must therefore be compressed before the model knows how it will later be used, forcing a limited state to compromise acr...

Jyothish Pari, Ryan Bahlous-Boldi, Pulkit Agrawal · 0 citations
Open access Aug 2026

CASCADED GLOBAL–LOCAL REPRESENTATION LEARNING FOR FINANCIAL TIME-SERIES FORECASTING

The findings indicate that passing attention-derived context into a bidirectional memory module offers a practical means of combining long-horizon structure with local temporal variation, although computational cost remains relevant for latency-sensitive trading applications.

Hao Wu · 0 citations
#artificial intelligence Preprint Sep 2026

Structured Sparse Memory for Recurrent Reasoning

This work introduces a compositional sparse embedding (CoSE) for task conditioning that reduces learned task-memory parameters by over 90% while improving pass@2 in controlled ARC ablations.

Zi-Xuan Zhao, Samuel Wheeler, Neil Getty et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.