Self-Supervised Deep Tensor Domain-Adversarial Regression Adaptation for Online Remaining Useful Life Prediction Across Machines
Bibliographic record
Abstract
With deep transfer learning techniques, this paper focuses on the online remaining useful life (RUL) prediction problem across different machines, and tries to address the following concerns: 1) The effect of transfer learning decreases significantly due to considerable divergence of degradation characteristic; 2) A high computational cost is raised by re-training whole model with online data; 3) Error accumulation occurs because of lacking label information of online data. In this paper, a self-supervised deep tensor domain-adversarial regression adaptation approach is proposed. In the pre-training stage, a novel tensor domain-adversarial network, with a tensorized domain discriminator, is constructed using the offline whole-life degradation data and early fault data of the target machine. A new training algorithm with an alternating minimization scheme is then built to seek the optimal core tensor and domain-invariant feature representation. In the online stage, a new self-supervised fine-tuning strategy is designed for the target network initialized from the pre-trained network. The core tensor-formed self-supervised information, extracted from the monotonicity of online degradation process, and the pseudo-supervised information from the pre-trained network are integrated to realize fast and adaptive RUL prediction. This paper takes rolling bearing as an example, and runs both cross-conditions and cross-machines experiments on three rolling bearings datasets, i.e., IEEE PHM Challenge 2012, XJTU-SY and our test rig. The results verify the use of tensor representation can facilitate regression adversarial training, and demonstrate the proposed approach can effectively improve predictive accuracy and stability under unknown online conditions.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| 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".