Fault Diagnosis of Unseen Modes in Chemical Processes Based on Labeling and Class Progressive Adversarial Learning
Bibliographic record
Abstract
While deep neural network (DNN)-based fault diagnosis methods can monitor the faults that occur on the operating modes, they cannot perform well on the modes that are never experienced before. This limitation makes it challenging to ensure the production safety of chemical processes. In this article, this issue is formulated as domain generalization (DG), which aims to learn a universal fault diagnosis model from historical operating modes that can generalize well to unseen modes. Many existing DG approaches focus on learning a domain-invariant representation by aligning marginal distributions between domains, which ignore the conditional relationships and label information. Recently, some researches start to reduce the discrepancy of the class conditional distributions across domains, while the theoretical justifications of that are still missing. To address this issue, the theoretical analysis of DG is developed to investigate how to minimize the unseen domains’ risk, which is a theoretical guarantee that the DG methods can generalize well over unseen domains. This theory reveals that the unseen domain error can be bounded by the shift of the label and class conditional distributions across source domains. Then, this result motivates a novel labeling and class progressive adversarial learning (LCPAL) algorithm for fault diagnosis, which simultaneously controls the errors weighted based on label information and aligns the class conditional distributions between different historical operating modes, as well as reducing the adverse effect of the domain-specific feature. Empirical results on both the numerical example and the Tennessee Eastman process (TEP) demonstrate the effectiveness of the LCPAL 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 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.000 |
| 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".