MétaCan
Menu
Back to cohort

Analysis and Tuning of Knowledge Distillation for Efficient Collaborative Learning

2025· article· W4416873377 on OpenAlexaff
Norah Alballa, Ahmed M. Abdelmoniem, Marco Canini

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicAdvanced Graph Neural Networks
Canadian institutionsKootenay Association for Science & Technology
Fundersnot available
KeywordsHyperparameterCollaborative learningTransfer of learningSet (abstract data type)Collaborative filteringKnowledge transfer

Abstract

fetched live from OpenAlex

Knowledge Distillation (KD) has become a crucial technique for efficient collaborative learning in distributed systems, especially under data and system heterogeneity. Despite considerable attention, few works systematically examine tuning strategies for KD hyperparameters or provide comprehensive empirical comparisons across different data distributions. In this paper, we conduct an in-depth study of multiple KD methods-Vanilla KD, Deep Mutual Learning (DML), Data Partitioning KD (DP-KD), and our Tuned KD approach-using diverse data partitions and transfer sets. We show that (1) hyperparameter tuning dramatically boosts KD performance, especially when teacher-student models have disparate accuracies, (2) different transfer set sizes and labeling conditions substantially affect outcomes. Our findings serve as practical guidelines for effectively applying KD to collaborative learning 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 imitation

Not 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.

metaresearch head score (Codex)0.007
metaresearch head score (Gemma)0.041
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.037

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0070.041
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.005
Open science0.0020.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.009
GPT teacher head0.288
Teacher spread0.279 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Graph Neural NetworksFrench-language works237,207