REVIEW 2 major objections 5 minor
Learning What Matters: Supervising Global Context Pruning with Causal Evidence Sets
T0 review · 2 major / 5 minor · reviewed 2026-08-01 · deepseek-v4-flash
Pith's one-line read Answer-position attention is an unreliable target for context-pruning routers; causal evidence sets are stable, annotation-free, and route at 99–100% on multi-hop where attention-based routing swings from 36% to 98%.
desk verdict Honest, careful empirical test of attention-as-importance with known evidence: causal evidence sets beat answer-position attention for routing on synthetic retrieval, and the conflict transfers to some pretrained facts; the main caveat is that the headline multi-hop gap has not been shown on real models, and the paper says so itself. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the causal evidence set, a per-example label defined by masking interventions. A block is included if it is individually sufficient—restricting attention to it and the query preserves the answer—or individually necessary—masking it changes the answer. The intervention adds -10^4 to the attention logits of the block's positions at every layer, leaving token positions unchanged. The router architecture also matters: a mean-pooling router collapses pointer source and destination keys and fails on chains under every supervision, while a chain router with per-offset projections and two transformer layers over block summaries can express the selection. A backward max-product
What would settle it
Run the paper's multi-hop task with five new seeds. If the attention-distilled router reaches 0.99 or better on all five (as the causal router does), while dense accuracy stays high, the claim that attention is an unreliable routing target on this task would be falsified; the paper's seed 1 already reaches 0.98, so the claim depends on the spread, and a uniform 0.99+ across seeds would collapse it.
Extended reading notes
Core claim
The paper's central discovery is that attention weights at the answer position are not a dependable map of what a model's answer depends on, and that causal evidence sets—computed by masking context blocks and observing whether the answer changes—are a stable and better supervision target for context-pruning routers. On the multi-hop retrieval task, where a chain of two pointers ends in a value, causal supervision routes at 0.99–1.00 on every converged teacher, while attention distillation ranges from 0.36 to 0.98, with the variance tracking how often the router selects the chain's middle block. Dense accuracy does not reveal which teacher a practitioner has, since all four teachers solve mu
Load-bearing premise
The load-bearing premise is that the synthetic task mixture—small rotary-only teachers, direct value supervision without an answer marker, and 32-block contexts—produces retrieval circuits that faithfully represent how real pretrained models use attention and context; if the multi-hop attention failure is specific to this protocol, the central routing-ordering result may not transfer.
Editorial extensions
If this is right
- Context-pruning routers should be supervised with causal evidence sets rather than distilled attention when the task has multi-step or conflicting evidence; the paper shows a 60+ point swing in routed accuracy due to supervision choice alone.
- Dense accuracy does not indicate whether a teacher's attention is a safe routing target: all four multi-hop teachers solve the task at 98% or better, yet attention-distilled routers range from 36% to 98%.
- Annotation-free routing is feasible: a masking-effect estimator with a 0.25-nat floor recovers labels that match annotated sets on 87% of examples and trains routers near annotation-trained performance, and on Qwen2.5-3B recovery is exact (1.000 agreement) up to 128 records.
- Attention remains useful for per-query, per-layer thinning—where it routes at 94–100% on multi-hop—but that protocol keeps the entire context resident and prunes no context; it cannot substitute for global pruning.
- Tasks with distributed computation (aggregation/counting) are outside sparse routing's reach: an oracle keeping every marked block stays at chance until the full context, so the model's computational sufficient set can be strictly larger than the task's.
Reading between the lines
- Editorial inference: the failure of answer-position attention may be partly a protocol artifact; the paper's Appendix B notes that adding an answer marker prevents retrieval circuits from forming at 10.7M scale. A larger-scale training run with an answer marker that still forms a retrieval circuit might show better answer-position coverage, so the paper's strongest transfer evidence is the pretrai
- Editorial inference: the annotation-free estimator's scope is narrower than its headline; in the two-disjoint-chains topology (Appendix J), both regimes fail and no estimator recovers a full chain, so practical deployment would need a fallback for evidence topologies where no block is necessary and no singleton is sufficient.
- Editorial inference: a path-aware readout (backward max-product trace) recovers the chain at a fraction of the intervention cost, suggesting future routers might be trained directly on path traces rather than interventions, though the paper tested the trace only as a label oracle on multi-hop, not on obsolete-write or pretrained settings.
- Editorial inference: because label recovery costs one masked forward per block, scaling to document-length contexts requires approximation; the paper's own wall-clock estimates (a million examples in under a week at 16 records) may not hold at 128 records.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies whether attention weights at the answer position are a reliable supervision target for context-pruning routers. On synthetic retrieval tasks with known evidence, the authors show that attention and causally-defined evidence sets (recovered by masking interventions) disagree in specific ways: attention includes obsolete writes, misses the middle block of multi-hop chains, and varies across seeds with identical evidence. Routing experiments with identical architectures show that causal supervision is more accurate and stable than attention distillation, especially on multi-hop retrieval (0.99–1.00 vs 0.36–0.98). The paper also proposes an annotation-free estimator of causal evidence sets and demonstrates transfer of the attention/causal conflict to frozen pretrained models on conflicting-fact tasks.
Significance. If the results hold, this is a significant contribution to sparse attention research: it provides the first controlled testbed where attention as an importance signal is compared against ground-truth evidence, and it shows a practical alternative (causal evidence sets) that can be recovered without annotations. The paper's strengths are its careful experimental design (masked-block direction checks, mask vs overwrite agreement, property-tested task generators, per-seed tables, explicit confidence intervals), its reproducible pipeline, and its honest treatment of limitations. The multi-hop result is striking and the annotation-free recovery is useful. The main caveat is the transferability of the multi-hop failure to real models.
major comments (2)
- [§5, Table 4, Appendix B, §10] The headline multi-hop result is established exclusively on synthetic 10.7M-parameter teachers trained with direct value supervision, because Appendix B states that inserting an answer marker between the query key and value prevents retrieval circuits from forming at this scale. Real pretrained models predict after an answer marker. The paper's transfer experiments in §7 cover only unique retrieval and conflicting facts (single-record tasks); no natural-language multi-step chain task is tested. Consequently, the abstract's general conclusion that 'Attention ... shows where a model looks, not what its answer depends on' and the conclusion that 'the readout fails rather than the weights' rest on a phenomenon that has not been observed in a real model. If the direct-supervision quirk is responsible for the answer-position skipping, the central routing-ordering result may be an artifact of t
- [§6, Appendix J, Table 19] The claim that 'the causal sets need no annotation' is potentially misleading. While the recovery estimator works on the main task mixture, Appendix J shows that on two disjoint two-hop chains, the floored estimator recovers a complete chain on only 0.0–6.7% of examples (Table 19). The paper does acknowledge this in §10, but the contribution bullet in §1 ('An annotation-free estimator of the causal evidence set') and the abstract's phrasing should more clearly state the scope: the estimator handles evidence that is either replaceable block-by-block or necessary block-by-block, and fails when neither holds. This does not undermine the routing-ordering result, which uses annotated labels for the headline multi-hop comparison, but it tempers the annotation-free contribution.
minor comments (5)
- [Abstract] The phrase 'the same selector trained on causal evidence sets' could be misread as the same trained weights; rephrase to 'the same selector architecture trained on causal evidence sets.'
- [§2.1] The protocol detail about direct value supervision (no answer marker) is critical to interpreting the multi-hop results; consider moving it from Appendix B to the main text.
- [Table 3] The random baseline for duplicate evidence (0.16) is notably higher than other random rows; a short footnote explaining why (e.g., multiple copies increase the chance that a random selection includes a correct record) would be helpful.
- [§7] The sentence 'The causal router matches the dense model on both tasks and stays there when the record count doubles past training' applies to Qwen2.5-3B; specify this in the main text, as the next sentence transitions to 7B.
- [Appendix C] 'Adam at 10^-3' should be 'Adam with learning rate 10^-3' for clarity.
Circularity Check
No significant circularity: the causal evidence labels come from interventions on frozen teachers, not from the router's own outputs, and the routing comparisons are evaluated on held-out examples with matched architecture and budget.
full rationale
The paper's central derivation chain is self-contained. The causal evidence set is defined operationally by masking interventions on frozen teachers (Section 2.3), independently of any router prediction. The claimed improvement of causal supervision over attention distillation is tested by training routers on these labels and evaluating them on held-out examples (Section 5, Table 4), so the result is not forced by construction. The annotation-free recovery estimator uses a masking-effect floor that is a hyperparameter, not a fitted version of the target quantity, and its robustness is swept in Appendices E and J; the final routers still generalize to held-out examples. The pretrained-model experiments are empirical transfers, and the paper's acknowledged limitations are scope concerns (synthetic tasks, small teachers, limited natural-language tasks), not circular reasoning. There are no self-citations, no imported uniqueness theorems, and no load-bearing appeal to the authors' prior work. The only way the result could be circular would be if the causal labels were derived from the router's own selections or if the evaluation reused training labels, neither of which occurs.
Assumptions & free parameters
free parameters (6)
- 0.25-nat floor for recovery estimator =
0.25 nats
- Block width and count (n=32, w=8) =
32 blocks, 8 tokens
- Router budget k = ceil(0.1 n) =
3-4 blocks depending on n
- Two-record budget for pretrained routers =
2 records
- Softmin annealing schedule for causal coverage loss =
anneals linearly to zero over first 80% of training
- Teacher/rotary-only configuration =
6 layers, 8 heads, width 384, RoPE theta=10^4, 30k-45k steps
assumptions (6)
- domain assumption Sufficiency is verified by masking attention with a large negative bias (-10^4) at every layer, and this operator preserves token positions and information removal semantics.
- domain assumption The synthetic tasks train circuits representative of real retrieval/multi-hop behavior.
- domain assumption Direct value supervision without an answer marker is required for retrieval circuits to form at this scale.
- domain assumption Answer-position attention readout is the relevant distillation signal to compare.
- domain assumption Causal evidence sets are per-example and per-teacher, and the teacher is frozen.
- domain assumption SQuAD evidence sentences carry a counterfactual substitute answer so that only reading the kept evidence supports the correct choice.
invented entities (3)
-
Causal evidence set
independent evidence
-
Floored estimator / 0.25-nat floor
independent evidence
-
Chain router (offset-aware projection + two transformer layers over block summaries)
independent evidence
Cite this review
Pith. "Pith review of Learning What Matters: Supervising Global Context Pruning with Causal Evidence Sets." pith.science (2026). https://pith.science/paper/TKU5IVBS
@misc{pith2026260721692,
author = {Pith},
title = {Pith review of: Learning What Matters: Supervising Global Context Pruning with Causal Evidence Sets},
year = {2026},
howpublished = {\url{https://pith.science/paper/TKU5IVBS}},
note = {Machine review of arXiv:2607.21692}
}
read the original abstract
Pruning a long context means committing to the blocks a model will keep, and the usual selector is distilled from a dense teacher's attention. That assumes attention shows which context the answer depends on. We test the assumption on retrieval tasks where the evidence is known exactly, by masking context and measuring whether the answer changes. Attention and causal dependence disagree, and selectors inherit the disagreement: teachers attend to outdated facts that answer-preserving restrictions drop, and attend differently across training runs that use the same evidence. In a two-step reference task, a selector distilled from attention routes at 36% to 98% depending on the training run, the same selector trained on causal evidence sets reaches 99% or better on every one, and dense accuracy does not say which teacher you have. On the topologies our estimator covers, the causal sets need no annotation: masking alone recovers them from the frozen teacher. Pretrained models show the same conflict. Qwen2.5-3B attends more to an outdated fact than its replacement on 58% of the examples it answers correctly (48% past a first-token attention sink), a causal router lifts Gemma-2-9B from 56% to 98%, and no readout we test recovers a two-hop chain that all three tested models solve. On our teachers a one-pass cross-layer trace supervises chains as well as the annotated sets, so the readout fails rather than the weights; interventions alone separate current from obsolete evidence, survive redundancy, and stay stable across training runs.
Figures
Reviewed August 1, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.