Adaptive Attention-Driven Manifold Regularization for Deep Learning Networks: Industrial Predictive Modeling Applications and Beyond
Bibliographic record
Abstract
Industrial predictive modeling, which provides valuable information for process monitoring and decision-making on process operation, plays a crucial role in the process industry. However, industrial processes commonly exhibit nonstationary characteristics caused by various process drifts, such as frequent variations in the properties of raw materials. Hence, this article proposes an adaptive attention-driven manifold regularization (AAMR) strategy. Specifically, it designs an adaptive working condition selection strategy to overcome sudden variations in the raw material properties. In addition, a novel attention distance calculation is introduced to minimize the impact of noise and redundant features, which aims to address the limitations of conventional manifold learning distance calculations. Finally, the proposed manifold regularization strategy is fused into the stacked autoencoder (SAE), coined AAMR-SAE, to enhance dynamic manifold feature extraction capability and strengthen the parameter update process. Two real industrial applications are presented to verify the efficacy of the proposed method. The results confirm that the proposed method can provide superior prediction accuracy and practicality compared to some existing representative methods.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 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".