- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies how a language model should revise its conclusions when the supporting evidence changes. Conclusions that lose their support should be withdrawn; conclusions that are unaffected should be kept; conclusions for which a different proof exists in the new world should be kept but given a new justification. The authors construct EviPair, which links audited evidence worlds through typed intervention edges and scores Change, Preserve, and Switch on eligibility sets frozen before any model runs.
The diagnostic part shows that reinforcement learning with only node-level semantic and evidence rewards improves endpoint scores while consistently hurting preservation across all three datasets. The training part proposes PTPO, which credits each node with the cross-world relational return on each of its incident edges and centers these credits with a node-local leave-one-out baseline, reusing trajectories across edges. The main experiments use Qwen3-4B-Base as the backbone, run on three datasets and five seeds, with a macro-average Change/Preserve/Switch of 57.75/66.58/33.42 against 44.63/60.95/17.48 for the SFT start. Forced Switch edges are excluded from the training curriculum.
Critical strengths
-
The coordinate decomposition turns an unobservable response into a scorable object. Eligibility sets are frozen before evaluation and do not depend on model success, so denominators cannot drift. The endpoint-only baseline gains 5.68, 4.68, and 3.71 endpoint points on the three datasets while losing 3.18, 3.17, and 3.51 on preservation (Table S27) — exactly the "better answering, worse preservation" pattern that aggregate scores cannot see. I expect this evaluation design to outlast the training method.
-
The pre-registered Switch result is strong and stable. SwitchAcc rises from 17.48 to 33.42, with a paired difference of +13.39 [9.90, 16.88] against the endpoint baseline and +4.28 [2.21, 6.35] against CRPO-Evidence, Holm-corrected at p = 1.02e-4; all five seeds are positive (Table S15b). Ablations over pairing and edge sampling (27.94–29.73) rule out these two implementation choices as the source of the gain.
-
The largest gain appears on a relation never seen in training. Forced Switch edges never enter the RL curriculum, yet SwitchAcc on them rises substantially. This is the strongest argument for acceptance.
Critical weaknesses
-
The paper is difficult to read. Worlds, edges, atoms, certificates, eligibility sets, and the four intervention types are all introduced in Section 3 at high symbol density, and the reader must shuttle between the main text and Appendices A.2–A.6 to assemble the full decision procedure. The fact that Equation (8) is an existential test rather than an equality is precisely what determines how Switch should be read, yet the main text disposes of it in half a sentence. For a paper whose contribution is a construction, this substantially raises the evaluation bar.
-
A rise in SwitchAcc does not by itself show that the model re-grounded its proof. Equation (8) only asks whether the certificate contains some minimal sufficient set, not whether it equals one, so a policy that cites every document visible in the target world passes the same test. Equation (10) rules out any complete source proof surviving in the target world, but the new proof lies inside , hence inside such a certificate, so the old proof cannot simply be copied and the all-cite strategy still succeeds. If that is so, the gain over SFT and the gain over GRPO-Marginal do not establish that the model learned to switch proofs rather than to cite more broadly. Appendix A.2 notes that over-citation is a separate citation-precision question and reports no measurement of it, and Equations (11)–(12) never require . Switch is the coordinate where this matters most: it is constructed so that the answer set is unchanged while every source proof is invalidated, which leaves the citation as the only observable difference between the two worlds. The authors need not have erred, but without the corresponding measurement the reported improvement cannot be separated from this alternative explanation.
Questions for authors
-
I would like to understand how the reward design induces the three behaviours of withdrawing what should be withdrawn, keeping what should be kept, and changing the justification when the evidence changes, especially the last. Section 5 gives an additive return, but from the main text I could not reconstruct how the rewards on Necessary Drop and Irrelevant Preserve edges distinguish correct from incorrect withdrawal, nor why support adaptation on natural redundancy should teach reconstruction on replaced evidence. The Switch definition also raises a question of its own. An edge is eligible only if the source proof cannot be reused in the target world, which seems to require evidence that was not available before, whereas the training curriculum appears to consist only of removal-based edges. Are there training edges that require introducing new evidence? If not, where does the model learn this? Please explain the mechanism, supplementing with a control experiment if necessary
-
Since Equation (8) only requires the certificate to contain some minimal sufficient set, a policy that cites every visible document would also pass, and its SwitchAcc could be reported directly. Could you add that baseline, together with a measure of certificate minimality on the 485 Forced Switch edges?