An Optimal Transport-Embedded Similarity Measure for Diagnostic Knowledge Transferability Analytics Across Machines
Bibliographic record
Abstract
The successful applications of deep transfer learning to intelligent fault diagnosis testify to a positive correlation between transferable feature similarity and knowledge transferability across diagnostic tasks. This correlation makes feature similarity possible to assess diagnostic knowledge transferability. Therefore, researchers have attempted various measures for feature similarity, and distance metrics have been adopted as an objective measure for feature distribution discrepancy. However, the commonly used distance metrics cannot address the joint distribution discrepancy (JDD) due to the difficulty in fitting conditional distributions of target domain samples. To overcome the problem, we resort to explore cluster-conditional distributions instead and propose an optimal transport-embedded joint distribution similarity measure (OT-JDSM) that is implemented in two steps. First, a cluster-true label propagation spreads labels from a small number of labeled target domain samples to the whole. Second, the JDD of transferable features is produced via an efficient solution of optimal transport. OT-JDSM is demonstrated on synthetic examples and 144 transfer diagnosis tasks that are created by public and private bearing datasets. The results show that OT-JDSM of transferable features has a stronger correlation with diagnostic knowledge transferability than other distance metrics. Moreover, the OT-JDSM gain can quantify the transfer performance of diagnostic models on tasks.
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.003 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| 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".