Implementing Recurrent Neural Networks in Process Systems Engineering applications, the right way!
Bibliographic record
Abstract
This manuscript identifies, addresses and illustrates via comparisons an inconsistency and inaccuracy with the implementation of Recurrent Neural Networks (RNNs) on naturally occurring dynamical processes, particularly focusing on implementations that claim to identify input–output dynamic relationships through a state–space representation. While the RNN structure does lend itself to these types of problems, there are two major issues with how RNNs are typically structured and trained in this context. Firstly, the hidden states of the model are commonly reinitialized or discarded between each of the input–output sequences in the training data set, essentially leading to a framework where the initial state for each sequence is not trained. In contrast, in a typical state–space model identification framework, the model parameters along with the states are (and need to be) identified together. Secondly, the model structure of the RNN is different from a classic state space (SS) representation. While in state space representations the current state is defined to be a function of the state and input from the previous time step, RNNs use input from the same time step. In this paper, two changes are proposed to address these inconsistencies. The first step is to train the initial hidden states for the training sequences. To address the structural inconsistency between a state space model and the RNN, the list of hidden states retrieved from the RNN is formatted to represent the data and state pairings that a state space model would create. The effect of these corrections is demonstrated in the simplest of dynamical systems — data generated using a Linear Time-Invariant (LTI) state space model. The importance of both these corrections is demonstrated by implementing them one at a time. Interestingly, the model that performed the worst in testing was the model with only the trained hidden states. The model with no changes was slightly better, and the model with the correct input timing but no trained hidden states increased performance by a significant amount. Finally, the best results were found when both changes were implemented. • Dynamic process modeling using Recurrent Neural Networks. • State space representation of dynamic systems form the basis for the proposed approach. • Previous RNN applications inconsistent with state space representation, hence fundamentally incorrect. • Proposed fixes shows great improvement in prediction accuracy.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".