Implementing Recurrent Neural Networks in Process Systems Engineering applications, the right way!
Notice bibliographique
Résumé
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.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».