- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper finds that if we have one public model M_0, one teacher model (called M_T) SFTed on one target task from M_0, and another student model M_S initialised from M_0, we can collect some data to train M_S to learn the target task capability from M_T. The interesting part is the data is unrelated prompt + two single tokens, and the requirement is two single tokens are approximately equally likely and one of the tokens is the greedy token.
Intuitively, seeing which token M_T greedily decodes from the two approximately equally likely tokens from M_0 gives information about how M_T was updated from M_0.
Critical strengths
The paper observes a phenomenon where under some restricted conditions (same model ancestor, greedy decoding, teacher model generates the same token from the two most likely tokens from the base model), we can actively design unrelated prompts to distill some target task capability from teacher model with only 1 token per prompt generated from the teacher model, no model weight access and no logins.
Critical weaknesses
W1: The biggest weakness and opportunity for improvement is to (1) make it clear how generally applicable the Active Taskless Distillation (ATD) method is, what conditions will break it, and (2) demonstrate that some version of ATD is more generally applicable.
W2:The current experiment has many restrictions. It makes the implication of ATD narrower and does not support ATD beyond an isolated case.
- The authors conduct experiments only on teacher and student models from the same public ancestor model. I encourage the authors to share if they have made any efforts to try ATD on cases where teacher and student models are different models, and whether it still works.
- Greedy decoding is necessary to apply ATD, which is a restriction and less common in practice.
- teacher model must greedy decode one of the two equally most likely tokens from the base model. How likely and practical is this requirement? Does it effectively require the teacher model is not too different and cannot undergo too many gradient updates from the base model?
W3: Even under the same ancestor model constraint, the authors are encouraged to clarify and discuss as the teacher model becomes further away from the base model (e.g., by taking more gradient updates in SFT), (1) does ATD recover less of the teacher performance? (2) will it becomes more challenging to apply ATD for example because teacher model less frequently decode the most likely two tokens from the base model?
W4:The authors are encouraged to clarify how many gradient steps the teacher models are trained in current experiments
W5:The second biggest weakness and opportunity for improvement is: While the authors emphasise the effectiveness of ATD, the authors should also emphasise there can be large gap in teacher and ATD performance as reported in Table 2. In many cases, such as ScienceQA, OpenBookQA, HellaSwag, RACE-high, PIQA in table 2, the ATD student performance is mildly higher than control experiments, but largely behind teacher models. It means ATD can only recover small fraction of the target capability, not full capability. How much of target capability from teacher model can be recovered through ATD needs a dedicated discussion section.
W6: The presentation of Table 1, Figure 2 can be made much clearer. I recommend not using unnecessary naming, such as signal, control, independent-acquisition signal, etc. Try to present results in more direct, clear, simplistic form. And describe different experiments in a way that is self explanatory.
W7: Please report how prompts are discovered. How many tries does it take to find the needed prompts that satisfy the requirement for both base model and teacher model. This is important to give readers an understanding of how easy/difficult it is to select near-tie prompts as part of ATD.
W8: I find the title of this paper too broad and not accurately reflective of the main contribution. "POST-TRAINING LEAVES BEHAVIORAL SHADOWS ON UNRELATED DECISIONS" is too broad, suggesting general findings of "behaviroal shadows" from general "post-training". But the main contribution of this paper is the Active Taskless Distillation. It is about how ATD can distill target capabilities from teacher model into student model. But none of these concrete contributions are mentioned in the title.
Questions for authors
I am curious if the authors tried extending the experiments to more general setup and if any findings can be shared. such as
- different base models
- non greedy decoding
- teacher model trained more steps from the base model, so more different from the base model
3 comments
increased my score
The authors' responses addressed most of my concerns, and I've raised my score.
- Title and core thesis: No remaining concerns.
- Experiments: The experiments and evidence for ATD are strong.
- New result: "ATD achieves much higher training efficiency and accuracy than standard target-task SFT!" This is a strong and interesting result!
One suggestion: In the intro, say clearly both when ATD works and where it doesn't.
Where ATD works:
- It isn't tied to a specific model.
- It doesn't need a matched post-training method.
- It works with non-greedy decoding.
- It outperforms both the shuffled baseline and target-task SFT.
Limitations:
- The teacher and student must share the same model ancestor.
- It doesn't fully recover the teacher's capability.
- It gradually breaks down as the teacher drifts further from the base model.
Stating both side of conditions gives readers a clearer understanding of the phenomenon and method's scope. :)
Thank you for your positive feedback!
Thank you very much for your recognition of our work and for this helpful suggestion! We have revised the intro accordingly to clearly state both where ATD works and where its limitations lie.
Rebuttal by Authors
Thanks for the detailed review. Below we address your four main points in turn.
1. Title and Core Thesis
In our Abstract and Section 1, our goal is to reveal an empirical phenomenon: post-training leaves behavioral shadows on unrelated decisions carrying capability information. ATD is a minimal black-box probe we built to observe this phenomenon across tasks and models. Post-Training Leaves Behavioral Shadows on Unrelated Decisions states this finding directly; we keep it and clarify ATD's role as a probe in the Introduction.
2. Effectiveness vs. Teacher Gap
ATD is not meant to clone the full teacher. Effectiveness means one greedy token per prompt on unrelated text already transfers real capability over matched controls on the same prompts and words. A gap to the teacher in Table 2 is expected for a 1-bit channel; widening observations in Table 13 to 20 words per prompt on Qwen2.5-0.5B GSM8K lifts the net gain to +6.37 pp.
To test higher student capacity on the same 1-token carriers, we added a LoRA r64 experiment across all 4 ancestors on HumanEval+: every model beats its shuffle control, and Qwen2.5-1.5B reaches 54.88%, beating the exact control by +8.54 pp and matching the 51.22% teacher:
We also ran a new baseline spending the same 17,858 queries on target coding prompts, and found a surprising result: ATD achieves much higher training efficiency and accuracy than standard target-task SFT! Training on 5,664 unrelated words for 157 steps beats SFT on 17,815 full code solutions:
Both new comparisons are now Tables 3a and 4 in the revised paper.
3. Scope and Boundaries
For base models and fine-tuning, Table 14 shows cross-ancestor pairs fail because near-ties are defined on θ0. Within a shared base, transfer holds across all 4 lineages in Figure 3, and teacher and student need no matching fine-tuning: distilling our LoRA r16 teacher into a full-parameter student without LoRA still gains +4.73 pp. Testing more non-Qwen families, we find ATD works whenever the teacher retains clear near-tie shifts on M0: averaged over three seeds, two open-source teachers beat their shuffle control, with official OLMo-2-1B SFT at +1.42 pp and DeepSeek-Coder-1.3B at +1.02 pp across all three seeds, now in Table 3b.
For non-greedy decoding, ATD is not tied to greedy decoding: at T = 0.2, all 4 seeds stay positive at +2.17 pp over shuffle, fading only under T = 0.8 noise to +0.96 pp.
When the teacher is trained for more steps and moves further from the student's base M0, Table 11 shows that within local updates the recovered direction still tracks the teacher's strength closely. Once heavy multi-stage training pulls the teacher too far from the student, however, transfer weakens, consistent with the milder open-source gains above, and eventually vanishes when the update leaves Eq. 3's local regime or requires knowledge the student base cannot already express, as Section 5.5 and Appendix I show for memorized answers, ciphers, and incompatible bases. Notably, this breakdown is not from missing the two candidate words: since each prompt restricts choices to a or b, even distant teachers still output one option, so what degrades when teacher and student diverge too far is the boundary signal itself rather than the hit rate.
4. Experimental Details and Naming
Sections 4–5 and Appendices A–B note offline screening on M0 with 0 teacher queries: we score 400,000 prefixes to select 17,858 near-ties, and since Options: a | b is prompted where M0 picks from {a, b}, the Qwen2.5-1.5B teacher hits {a, b} 99.5% of the time before |q − 0.5| <= 0.02 and an 80/20 split yield 5,664 pairs. Teachers use 50 DPO steps on Qwen2.5-1.5B code, 160–240 SFT steps on MC, and 100 SFT steps on other code teachers in Appendix B.
For naming, signal, control, and exact nuisance-matched are defined in Section 5.1, Table 1, Figure 2, and Appendix C; we keep this naming and add brief glosses in captions.
Uncovering behavioral shadows in this local regime is exciting, showing post-training encodes executable capabilities into single-word unrelated decisions, and we hope this inspires broader work on implicit distillation across unrelated tasks. In light of these clarifications and new results, we would be sincerely grateful if you might reconsider the overall assessment of our paper.