Transfer Learning for Dynamic Feature Extraction Using Variational Bayesian Inference
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Data-driven methods have been extensively utilized in establishing predictive models from historical data for process monitoring and prediction of quality variables. However, most data-driven approaches assume that training data and testing data come from steady-state operating regions and follow the same distribution, which may not be the case when it comes to complex industrial processes. To avoid these restrictive assumptions and account for practical implementation, a novel online transfer learning technique is proposed to dynamically learn cross-domain features based on the variational Bayesian inference in this work. Stemming from the probabilistic slow feature analysis, a transfer slow feature analysis (TSFA) technique is presented to transfer dynamic models learned from different source processes to enhance prediction performance in the target process. In particular, two weighting functions associated with transition and emission equations are introduced and updated dynamically to quantify the transferability from source domains to the target domain at each time instant. Instead of point estimation, a variational Bayesian inference scheme is designed to learn the parameters under probability distributions accounting for corresponding uncertainties. The effectiveness of the proposed technique with applications to soft sensor modelling is demonstrated by a simulation example, a public dataset and an industrial case study.
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.
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 it