MétaCan
Menu
Back to cohort
Record W4315701650 · doi:10.3390/math11020400

Input-Output Selection for LSTM-Based Reduced-Order State Estimator Design

2023· article· en· W4315701650 on OpenAlexaff
Sarupa Debnath, Soumya Ranjan Sahoo, Bernard T. Agyeman, Jinfeng Liu

Bibliographic record

VenueMathematics · 2023
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsEstimatorComputer scienceRecurrent neural networkKalman filterSensitivity (control systems)State (computer science)Selection (genetic algorithm)Artificial neural networkModel selectionConstruct (python library)Control theory (sociology)AlgorithmArtificial intelligenceMachine learningMathematicsEngineering

Abstract

fetched live from OpenAlex

In this work, we propose a sensitivity-based approach to construct reduced-order state estimators based on recurrent neural networks (RNN). It is assumed that a mechanistic model is available but is too computationally complex for estimator design and that only some target outputs are of interest and should be estimated. A reduced-order estimator that can estimate the target outputs is sufficient to address such a problem. We introduce an approach based on sensitivity analysis to determine how to select the appropriate inputs and outputs for data collection and data-driven model development to estimate the desired outputs accurately. Specifically, we consider the long short-term memory (LSTM) neural network, a type of RNN, as the tool to train the data-driven model. Based on it, an extended Kalman filter, a state estimator, is designed to estimate the target outputs. Simulations are carried out to illustrate the effectiveness and applicability of the proposed approach.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.001

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.

Opus teacher head0.062
GPT teacher head0.299
Teacher spread0.237 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations6
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueMathematicsSame topicNeural Networks and ApplicationsFrench-language works237,207