Affinity-Driven Transfer Learning for Load Forecasting
Bibliographic record
Abstract
In this study, we introduce an innovative method for load forecasting that capitalizes on the concept of task affinity score to measure the similarity between various tasks. The task affinity score emerges as a superior technique for assessing task similarity within the realm of transfer learning. Through empirical evaluation on a synthetic dataset, we establish the superiority of the task affinity score over traditional metrics in task selection scenarios. To operationalize this method, we unveil the Affinity-Driven Transfer Learning (ADTL) algorithm to enhance load forecasting precision. The ADTL algorithm enriches the transfer learning framework by incorporating insights from both pre-trained models and datasets, thereby augmenting the accuracy of load forecasting for new and unseen datasets. The robustness of the ADTL algorithm is further evidenced through its application to two empirical datasets, namely the dataset provided by the Australian Energy Market Operator (AEMO) and the Smart Australian dataset. In conclusion, our research underscores the important role of the task affinity score in refining transfer learning methodologies for load forecasting applications.
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.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".