Noisy Multipath Parallel Hybrid Model for Remaining Useful Life Estimation (NMPM)
Bibliographic record
Abstract
The parallel hybrid models of different deep neural networks architectures are the most promising approaches for remaining useful life (RUL) estimation. In light of that, this paper introduces for the first time in the literature a new parallel hybrid deep neural network (DNN) solution for RUL estimation, named as the Noisy Multipath Parallel Hybrid Model for Remaining Useful Life Estimation (NMPM). The proposed framework comprises of three parallel paths, the first one utilizes a noisy Bidirectional Long-short term memory (BLSTM) that used for extracting temporal features and learning the dependencies of sequence data in two directions, forward and backward, which can benefit completely from the input data. While the second parallel path employs noisy multilayer perceptron (MLP) that consists of three layers to extract different class of features. The third parallel path utilizes noisy convolutional neural networks (CNN) to extract another class of features. The concatenated output of the previous parallel paths is then fed into a noisy fusion center (NFC) to predict the RLU. The NMPM has been trained based on a noisy training to enhance the generalization behavior, as well as strengthen the model accuracy and robustness. The NMPM framework is tested and evaluated by using CMAPSS dataset provided by NASA.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".