AIarXiv

Ranked by formulaVerdict: Notable

Did the Model Use That? Counterfactual Training Boosts Self-Attribution in Language Models

A fundamental challenge for explainable and accountable language models is revealing how external information influences their answers.

By Zhou, Sang, Xu +2

Score████░░░░░░4.1

Caveats

  • Preprint; not yet peer reviewed.

VerdictWorth a reader's time today.

Read the originalPDFCode

Abstract

A fundamental challenge for explainable and accountable language models is revealing how external information influences their answers. This paper examines whether models are self-attributive: that is, whether they indicate when -- and only when -- their responses to questions are influenced by information provided alongside the question. Furthermore, we explore how self-attribution can be improved through counterfactual training, which explicitly teaches models to distinguish between answers that do and do not depend on supplied information. We found that most of the eleven frontier models rarely attribute influential information in their answers, and the rest attribute non-influential information. Training acknowledgment into reasoning does not fix this: the acknowledgment does not reach the final answer. We introduce CREDIT, which directly supervises final-answer self-attribution with counterfactual labels, without the need for human annotation. CREDIT substantially improves attribution in four open models, including two distilled reasoning models, and outperforms reasoning-level fine-tuning and prompting baselines. Among answers that agree with a user's suggestion, CREDIT distinguishes those changed by the suggestion from those the model would have given anyway. Gains transfer partly to unseen information types and prompts containing sources that support conflicting answers.

Zikai Zhou, Jiacheng Sang, Yilin Xu, Yufei Jin, Monica S. Lam

The editor's rubric

Heuristic review

Leverage3 / 5
A method or resource many groups across the field will adopt within a year.
24% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
18% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
14% of this desk’s rubric
Novelty3 / 5
A genuinely new approach to an open problem.
16% of this desk’s rubric
Trajectory2 / 5
Some room to improve with obvious engineering.
18% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
10% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); gains (outperforms); novelty (alternative to status quo); verification (multiple benchmarks, held-out test, code released); stakes (general AI).

How the score was computed

rank-2026-10-18

Score████░░░░░░4.1

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
5.4 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.6 / 10
Shrunk toward the desk prior by editor confidence (42%).
Attention
17%
Citations, upvotes, points, mentions.
Freshness
65%
Half-life decay since publication.
  • Hugging Face upvotes5 (reference 25, via hf-daily, Oct 28, 2026, 01:23 UTC)
  • GitHub stars1 (reference 250, via hf-daily, Oct 28, 2026, 01:23 UTC)

The record

  • Reviewed by heuristic-v10 on Oct 27, 2026, 13:49 UTC. Paper type: method.
  • Categories: cs.CL, cs.AI
  • BRIEF, No.1 in the Artificial Intelligence edition of October 28, 2026.