跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.19692 · v1

MathaMAGICal: Validating Trajectory Data Attribution During Capability Acquisition

首次提交 2026-11-15 08:51
版本更新 2026-11-15 08:51
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

Influence-function-based methods like MAGIC provide exact first-order scores for trajectory data attribution, yet only retraining indicates whether those scores accurately predict data removal. We evaluate MAGIC on 8686M- and 152152M-parameter GPT-2-style models learning multistep arithmetic from scratch on filtered web text and four synthetic math families. Full-run attribution at 8686M suffers from numerical overflow, and even with metagradient clipping, scores correlate near chance with retraining (linear datamodeling score, LDS, 0.170.17--0.220.22). In contrast, short checkpoint windows yield stable, accurate predictions at both scales (LDS 0.860.86--0.990.99 across four 100100-step windows at 152152M), whereas a single-checkpoint gradient-dot baseline shows near-zero correlation. Rankings of individual training blocks predict retraining only within that single run and do not transfer across seeds or hyperparameters (ρ≤0.09ρ\le 0.09), whereas format-level patterns replicate across runs. Two data families, worked examples and primitive facts, occupy 2.12.1--2.6×2.6\times their corpus share in both the helpful and harmful 5%5\% score tails, reflecting strong bidirectional local sensitivity distinct from net benefit under multi-epoch family deletion. These results show that trajectory attribution is reliable within short, validated windows and yields family-level insights that generalize across runs.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-15 08:51 · 最新观测版本

MathaMAGICal: Validating Trajectory Data Attribution During Capability Acquisition

Influence-function-based methods like MAGIC provide exact first-order scores for trajectory data attribution, yet only retraining indicates whether those scores accurately predict data removal. We evaluate MAGIC on 8686M- and 152152M-parameter GPT-2-style models learning multistep arithmetic from scratch on filtered web text and four synthetic math families. Full-run attribution at 8686M suffers from numerical overflow, and even with metagradient clipping, scores correlate near chance with retraining (linear datamodeling score, LDS, 0.170.17--0.220.22). In contrast, short checkpoint windows yield stable, accurate predictions at both scales (LDS 0.860.86--0.990.99 across four 100100-step windows at 152152M), whereas a single-checkpoint gradient-dot baseline shows near-zero correlation. Rankings of individual training blocks predict retraining only within that single run and do not transfer across seeds or hyperparameters (ρ≤0.09ρ\le 0.09), whereas format-level patterns replicate across runs. Two data families, worked examples and primitive facts, occupy 2.12.1--2.6×2.6\times their corpus share in both the helpful and harmful 5%5\% score tails, reflecting strong bidirectional local sensitivity distinct from net benefit under multi-epoch family deletion. These results show that trajectory attribution is reliable within short, validated windows and yields family-level insights that generalize across runs.

查看此版本解读 →查看此版本原文 ↗