MétaCan
Menu
Back to cohort
Record W4402683916 · doi:10.18653/v1/2024.acl-srw.35

Trace-of-Thought Prompting: Investigating Prompt-Based Knowledge Distillation Through Question Decomposition

2024· article· en· W4402683916 on OpenAlexfundno aff
Tyler McDonald

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicIntelligent Tutoring Systems and Adaptive Learning
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsTRACE (psycholinguistics)DecompositionComputer scienceDistillationArtificial intelligenceChemistryLinguisticsChromatographyPhilosophyOrganic chemistry

Abstract

fetched live from OpenAlex

Knowledge distillation allows smaller neural networks to emulate the performance of larger, teacher models with reduced computational demands.Traditional methods for Large Language Models (LLMs) often necessitate extensive fine-tuning, which limits their accessibility.To address this, we introduce Trace-of-Thought Prompting, a novel framework designed to distill critical reasoning capabilities from largescale teacher models (over 8 billion parameters) to small-scale student models (up to 8 billion parameters).This approach leverages problem decomposition to enhance interpretability and facilitate human-in-the-loop interventions.Empirical evaluations on the GSM8K and MATH datasets show that student models achieve accuracy gains of up to 113% on GSM8K and 20% on MATH, with significant improvements particularly notable in smaller models like Llama 2 and Zephyr.Our results suggest a promising pathway for open-source, small-scale models to eventually serve as both students and teachers, potentially reducing our reliance on large-scale, proprietary models.Our code, featuring data analytics and testing scripts, is provided here.

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.005
metaresearch head score (Gemma)0.108
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.007
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

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

Opus teacher head0.037
GPT teacher head0.337
Teacher spread0.300 · 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 designBench or experimental
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
Published2024
Admission routes1
Has abstractno

Explore more

Same topicIntelligent Tutoring Systems and Adaptive LearningFrench-language works237,207