A novel deep‐learning fault detection model of <scp>MSLR</scp> ‐transformer for chemical process
Bibliographic record
Abstract
Abstract Although Transformer is good at capturing long‐range dependencies in data, it has high computational complexity and has difficulty extracting multi‐scale features efficiently. Therefore, its fault detection performance is limited when dealing with chemical process data that is cross scale and with rich temporal feature. To address the above problems, a fault detection method based on multi‐scale sparse low‐rank‐Transformer (MSLR‐Transformer) is proposed in this paper. First, a parallel convolutional structure with multi‐scale receptive fields is constructed. The structure utilizes differentiated convolution kernels to simultaneously extract multilevel temporal features, which enhances the ability to perceive multiscale dynamic changes. Second, a sparse screening mechanism based on response strength is introduced for sifting out redundant information and highlighting highly responsive features, thus reducing localized noise interference in the process data. Then, the features are de‐ranked by a low‐rank linear attention based on kernel function mapping, which reduces the computational complexity. At the same time, the capture of global dependencies is achieved. Finally, the proposed method is applied to penicillin fermentation (PF) process and Tennessee Eastman (TE) process to verify the effectiveness. The experimental results show that the method is superior to the traditional model in fault detection.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 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.002 | 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".