Recurrent Neural Networks Beyond Time: Learning from Multiple Ordered Projections
Vagan Terziyan, Artur Terziian, Oleksandra Vitko
University of Jyväskylä · Prague University of Economics and Business · Kharkiv National University of Radio Electronics
cs.LG
Submitted: 2026-08-10
Updated: 2026-08-11
Comments: 28 pages; 3 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 75/100
The gist: The paper introduces the Ordered Structural Dependency Hypothesis (OSDH), which proposes that "multiple admissible orderings of the same observations may reveal complementary structural dependencies
Terminology
Summary
The paper introduces 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.
The authors argue that recurrent computation fundamentally operates on ordered sequences rather than on time itself,
and that temporal dependency becomes one particular instance of a broader family of ordered structural dependencies rather than the defining object of recurrent learning itself.
To operationalize this hypothesis, they 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, they present Structural Evolution RNNs (SE-RNNs), which employ conventional RNNs as projection-specific structural experts while preserving the underlying recurrent computation unchanged.
The paper formalizes the framework by defining an admissible ordered coordinate
as one whose domain "admits a meaningful ordering such that sorting observations according to that coordinate (using temporal order to resolve ties when necessary) produces a deterministic observation sequence suitable for recurrent modeling. It also defines
ordered structural dependency as existing
along an ordered coordinate if neighboring observations in the induced ordering exhibit statistically meaningful dependency patterns that can be exploited for prediction or representation learning. The construction of ordered projections is achieved by sorting the same observations according to different admissible coordinates, with time playing a dual role:
In its learning role, the temporal coordinate defines the conventional recurrent channel... In its preprocessing role, the temporal coordinate simultaneously provides the canonical identifier of observations."
The learning procedure follows a two-stage approach: Stage I: Independent Structural Learning
where Each ordered projection is assigned to its own structural expert... trained independently... After convergence, the learned parameters are fixed,
and Stage II: Knowledge Integration
where the projection-specific experts remain frozen and serve exclusively as feature extractors
while only the fusion parameters are optimized.
The authors justify this separation by stating that Joint optimization encourages projection-specific experts to co-adapt throughout training... thereby reducing the structural diversity that OSDH seeks to exploit.
Proof-of-concept experiments were conducted on three synthetic datasets with substantially different levels of structural complexity.
Dataset 1 contains smooth nonlinear relationships generated from trigonometric and hyperbolic interactions
(y = sin(x1·x2) + cos(x2·x3) + tanh(x1 − x3) + ε). Dataset 2 introduces substantially more complex nonlinear relationships
(y = cos(x1)·x2 − sin(x2·x3) + 0.1·ε). Dataset 3 serves as a deliberately simple (and partially adversarial) control dataset
(y = 1.5·x1 − 2·x2 + 0.5·x3 + ε). The experiments varied the training strength (WEAK/STRONG) of three components: the feedforward backbone (FFNN), the projection-specific recurrent experts (RNNs), and the fusion module, producing eight combinations.
For Dataset 1, the SE-RNN consistently outperforms the standalone FFNN baseline in all experimental configurations,
with relative improvements ranging from 10.5% to 72.4%. The best result (Run 8, all components STRONG) achieved MSE of 0.0111 versus 0.0158 for the FFNN, a 30.0% improvement. For Dataset 2, the authors note that "when both the recurrent experts and the fusion module receive sufficient training (Runs 6–8), the implemented SE-RNN consistently achieves substantially lower prediction errors than the corresponding feedforward baseline, with Run 6 showing a 92.4% improvement (MSE 0.0282 vs 0.3709). However, some runs exhibited negative improvements (Runs 2 and 5), which the authors explain as cases where
the standalone FFNN already provides exceptionally strong predictions, whereas either the recurrent experts or the fusion module remain comparatively undertrained. For Dataset 3,
the performance differences between the standalone FFNN and the integrated SE-RNN architecture are generally small, with the best improvement being 10.59% (Run 6) and several configurations showing slight degradations, which is
consistent with the construction of the dataset itself since
the target function contains little hidden structural complexity."
The comparative analysis across datasets reveals a consistent relationship between structural complexity and the effectiveness of the proposed architecture,
with the predictive advantage increasing as hidden structural relationships become more complex. The authors emphasize that the experiments provide consistent empirical support for the practical realization of OSDH through the proposed SE-RNN architecture
and that the observed performance trends closely follow the predictions derived from the theoretical principles.
The paper positions its contribution relative to prior work, distinguishing OSDH from conventional sequence learning, multi-dimensional RNNs, multi-view learning, and mixture-of-experts architectures. The authors state that "the primary contribution of the present work is not architectural innovation at the level of individual neural components, but the introduction of a new computational paradigm for sequence learning in which order itself becomes a design variable rather than an inherent property of temporal data. They also note that
OSDH is not inherently tied to a particular neural architecture and that
any model capable of learning from ordered sequences, including more recent sequence-processing architectures such as Transformers, could potentially operate on the ordered projections defined by OSDH."
Future research directions include the application of OSDH-based architectures to practical domains in which multiple meaningful orderings coexist,
the development of methods capable of automatically discovering informative ordered projections rather than relying on domain knowledge,
and implementations based on modern state-space models, Transformer architectures, graph neural networks, or their hybrids.
Improvements for AI systems
Improvements to AI Systems:
- Multi-Order Sequence Learning Module
-
Add a preprocessing layer that sorts input data by multiple admissible coordinates (e.g., time, spatial position, feature magnitude, or user-defined keys) to generate several ordered projections of the same dataset.
-
Train independent recurrent or transformer experts on each projection, then freeze them and fuse their latent representations via a lightweight attention or gated network.
-
Resulting capability: The AI system can discover and exploit structural dependencies that are invisible in a single chronological ordering—e.g., detecting periodic patterns by sorting by phase, or capturing hierarchical relationships by sorting by category.
- Automatic Ordered Coordinate Discovery
-
Implement a meta-learning or gradient-based search that proposes candidate orderings (e.g., by clustering features, using mutual information, or optimizing a surrogate for predictive gain) and evaluates them via the ISEP two-stage training.
-
Use the fusion model’s performance improvement as a reward signal to refine the ordering search.
-
Resulting capability: The system can autonomously find informative orderings for unstructured or high-dimensional data (e.g., medical records, sensor streams, or financial transactions) without manual feature engineering.
- Decoupled Co-Adaptation Avoidance in Multi-Expert Systems
-
Replace joint end-to-end training of multiple experts with a two-phase protocol: (a) train each expert independently on its own ordered projection, then (b) freeze experts and train only a fusion head.
-
Add a regularization term that penalizes mutual information between expert representations during Stage I to further preserve diversity.
-
Resulting capability: The AI system avoids the common failure mode where experts collapse into similar representations, thereby maintaining complementary knowledge and improving ensemble robustness—especially useful in multi-view learning or mixture-of-experts architectures.
- Structural Complexity-Adaptive Architecture Selection
-
Add a diagnostic step that estimates the hidden structural complexity of the data (e.g., via nonlinearity tests or residual analysis of a baseline model).
-
If complexity is high, activate the SE-RNN pipeline (multiple ordered projections + independent experts + fusion); if low, fall back to a single standard model to avoid overhead.
-
Resulting capability: The system dynamically allocates computational resources based on data characteristics, improving efficiency without sacrificing accuracy on simple tasks.
- Time-Agnostic Recurrent Feature Extraction
-
Modify the recurrent cell’s input to include a “coordinate embedding” that encodes the current ordering’s identity (e.g., a one-hot or learned vector for “time-sorted,” “value-sorted,” etc.).
-
During inference, allow the system to switch between orderings on the fly by feeding the appropriate coordinate embedding, enabling the same recurrent weights to serve multiple structural roles.
-
Resulting capability: The AI system can perform multi-perspective temporal reasoning—e.g., predicting a patient’s health trajectory both chronologically and by severity of symptoms—using a single shared model, improving generalization and interpretability.
- Fusion-Based Uncertainty Calibration
-
After Stage II, train a small calibration head on the fusion output to produce uncertainty estimates (e.g., using temperature scaling or deep ensembles).
-
Use the diversity of expert predictions (variance across projections) as an additional uncertainty signal.
-
Resulting capability: The system provides more reliable confidence scores, especially in regimes where different orderings yield conflicting predictions—critical for safety-sensitive applications like medical diagnosis or autonomous driving.
- Transferable Structural Priors for New Tasks
-
Pre-train projection-specific experts on a large corpus of ordered projections from diverse domains (e.g., time, space, value).
-
During fine-tuning on a new task, initialize the experts with these pre-trained weights and only update the fusion layer.
-
Resulting capability: The AI system can rapidly adapt to new datasets with limited labeled data by reusing structural dependency patterns learned from other domains, reducing sample complexity and training time.
Sources
- Order Matters: Sequence to sequence for sets
- Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation
- Neural Machine Translation by Jointly Learning to Align and Translate
- A Critical Review of Recurrent Neural Networks for Sequence Learning
- A Survey on Multi-view Learning
- Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks