- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper investigates mechanistically how LLMs handle negation. The paper first finds that LLMs (including frontier ones) in general are brittle on negated questions across several tasks. To understand this behaviour, the authors then focus on negated questions where LLMs answer correctly, and through mechanistic interventions find that (among many observations): (1) negation appears to introduce a consistent negation direction; (2) there exists attention heads that suppress original answers and MLP neurons that promote alternative answers but answer category is generally preserved; and (3) most interestingly, negation masks the answer token and encourages the model to find alternative candidates, but this second step of alternative search appears to be question- and answer-agnostic - that is, across different questions with different answers (but in the same answer category), the model has similar preference for the alternative candidates. This last finding explains why LLMs sometimes fail to answer negated questions correctly, because it ISN'T using the original answer to exclude this alternative candidate search. In other words, when the alternative candidate that LLMs prefer matches the original answer, they will generate an answer that will not change under negation. Given these findings, the authors propose a post-training process to fix negation handling, and they found positive results.
Critical strengths
-
The authors found clear mechanisms how LLMs handle negation and why they fail - this is perhaps the most important contribution of this work.
-
The writing is generally clear.
Critical weaknesses
-
A lot of important intuitions are not fleshed out and many technical details are buried in Appendix; this makes it difficult to readers/reviewers to carefully scrutinise them. That said, at a high level most of the design choices (particularly the intervention approaches and metrics) appear sound to me.
-
The findings of the suppression vs. support mechanism isn't entirely new and there are other papers that found similar observations in other tasks (e.g. https://aclanthology.org/2024.acl-long.458.pdf).
-
It's not a big surprise that the post-training method works (given that the metric is closely related to the training objective). It'd be interesting to see whether it would generalise to other types of negations, beyond the somewhat restricted forms of negation in the training data.
Questions for authors
-
Answer generation: Are answers generated with sampling? Asuming that's the case, what's the sampling configuration, and do you run multiple times? if there is variation, how do you select the final answer?
-
Figure 2 right: Isn't it given that when the model's most frequent negated answer = original answer, that we're not going to see answer change? In fact what is strange is that why isn't the answer change% not always 0 for these cases?
-
How do you find the prompt tokens (answer tokens, answer category tokens, etc) given a question?
-
Normalised log-prob gap shift (line 233) missing x_i in the numerator.
-
normalised log-prob gap shift formulation: What is the intuition of the formula? Presumably, if the value is small, that means the intervention didn't do anything, and if the value is large, the intervention has shifted the model to give the original answer for negated questions? But this assumes expect g_{i,f}(x^neg) to be small or close to zero when we look at instances where the model generates an appropriate answer given the negated question? Did you validate that? It might be that there is still a big gap between them (e.g. if the model is a lot less confident in generating the answer for the negated question). It seems like it may be possible to use a simpler formulation that looks at probability shift for the original answer?
-
Figure 9 should be in the main, given its importance
Other relevant papers:
6 comments
Official Rebuttal (2/4)
W3. It's not a big surprise that the post-training method works (given that the metric is closely related to the training objective). It'd be interesting to see whether it would generalise to other types of negations, beyond the somewhat restricted forms of negation in the training data.
TL;DR: ALiT outperforms all evaluated baselines on both accuracy and consistency across all three models on CondaQA, which tests broader negation forms and reasoning within passages.
Thank you for the suggestion! To examine whether our findings extend to more varied forms and uses of negation, we evaluated the post-trained models on CondaQA [5]. CondaQA covers over 200 distinct negation cues and requires reasoning about negation in passages. It also provides three types of passage edits: paraphrasing the negated statement, changing its scope, and reversing the negation.
For illustration, consider the following constructed example with the fixed question, “Could the owner retrieve the cash stored in the safe after the fire?”
| Passage version | Passage | Answer |
|---|---|---|
| Original | The fire destroyed all possessions except the cash in the safe. | Yes |
| Paraphrase | The cash in the safe survived the fire, while all other possessions were destroyed. | Yes |
| Scope change | The fire destroyed all possessions except the jewelry in the safe. | No |
| Negation reversal | The fire destroyed all possessions, including the cash in the safe. | No |
Answering requires inferring whether the cash remains recoverable from what the passage says was destroyed or spared. The model must preserve its answer under paraphrasing and adjust it when the passage’s implications change.
To evaluate generalization to this setting, we directly tested the checkpoints already trained in our original benchmark setting, without any additional training on CondaQA. We evaluated all three models (Gemma-3-12/27B-IT, Qwen3.5-9B) including those added in this revision. For baselines, we evaluated checkpoints trained with SFT, unlikelihood training, and DPO, alongside the corresponding base checkpoints. Each cell reports test-set accuracy / overall consistency (%), where consistency requires correct answers to the same question for the original passage and all three edited versions.
| Method | Gemma-3-12B-IT | Gemma-3-27B-IT | Qwen-3.5-9B |
|---|---|---|---|
| Base | 44.25 / 18.76 | 35.44 / 12.13 | 31.10 / 7.28 |
| SFT | 41.70 / 17.62 | 11.08 / 0.43 | 39.27 / 10.20 |
| Unlikelihood | 43.80 / 18.12 | 1.01 / 0.00 | 37.20 / 10.70 |
| DPO | 42.10 / 17.40 | 17.07 / 1.64 | 33.85 / 7.99 |
| ALiT | 45.59 / 18.90 | 37.38 / 13.55 | 45.30 / 16.05 |
For each of the three models, the checkpoint trained with ALiT achieves higher accuracy and consistency than both the base checkpoint and those trained with the other methods. Even though CondaQA’s evaluation metrics are less closely tied to our training objective, ALiT achieves these gains without any additional training. These results suggest that ALiT’s benefits extend beyond the training setting to more varied negation forms and to reasoning about negation within passages.
We also found evidence that the negation mechanism identified in our original benchmark generalizes to CondaQA. For the corresponding analyses, please see our response to Reviewer sRo6 (W3).
We have revised the manuscript to include the above findings (Section 5.2).
[5] Ravichander, A., Gardner, M., and Marasović, A. (2022). CONDAQA: A Contrastive Reading Comprehension Dataset for Reasoning about Negation. EMNLP 2022.
Q1. Answer generation: Are answers generated with sampling? Asuming that's the case, what's the sampling configuration, and do you run multiple times? if there is variation, how do you select the final answer?
We use greedy decoding and generate a single response for each input. Thus, we do not run multiple sampling trials or select a final answer from multiple generated responses.
We have explicitly stated these decoding settings in Appendix C (“Evaluation Details”) of the revised manuscript.
Official Rebuttal (3/4)
Q2. Figure 2 right: Isn't it given that when the model's most frequent negated answer = original answer, that we're not going to see answer change? In fact what is strange is that why isn't the answer change% not always 0 for these cases?
TL;DR: The most frequent negated answer is defined across different negated questions in the same category, so individual questions can still receive another answer and the answer-change rate need not be zero.
We apologize for the ambiguity in our description of this setup. To clarify, the “most frequent negated answer” is NOT the most common response obtained by repeatedly asking the same negated question. Instead, it is the answer generated most frequently across different negated questions that share the same answer category (e.g., questions asking about people).
For example, if the model most frequently answers “Red” across different negated questions asking about colors, then “Red” is the most frequent negated answer for that category. The model may still generate a different answer for a particular question whose original answer is “Red”. Therefore, the answer change rate can be greater than zero even when the original answer matches the category’s most frequent negated answer.
We have changed the manuscript to more clearly explain the definitions (Section 2).
Q3. How do you find the prompt tokens (answer tokens, answer category tokens, etc) given a question?
TL;DR: We identify answer and category tokens using source metadata for factual questions and document/image and question tokens, respectively, for reasoning tasks; the remaining groups are the inserted negation tokens and the last input token.
Thank you for asking about this. We had not clearly explained how these token groups were identified in the manuscript. Below, we describe how we identify the four groups: (1) answer tokens, (2) answer category tokens, (3) negation tokens, and (4) the final prompt token.
(1) Answer tokens and (2) answer category tokens. We identify these groups using the metadata from the benchmarks used to construct ours. The procedure differs across the three benchmark types.
For factual association (PopQA and RippleEdits), the questions are typically single sentences, such as “What is the capital of Spain?” The source datasets provide information identifying both “capital”, which indicates the answer category, and “Spain”, which is used to retrieve the original answer, “Madrid”. We use the corresponding tokens as answer category tokens and answer tokens, respectively.
For logical reasoning (PhantomWiki and SynthWorlds), the input consists of a document and a question about it. The document contains the information needed to answer, while the question indicates what is being asked. We therefore treat all document tokens as answer tokens and all question tokens as answer category tokens.
Finally, for visual reasoning (GQA and PTR), the input consists of an image and a question about it. Here, the information needed to answer comes from the image, while the question indicates what is being asked. We therefore treat the image tokens as answer tokens and all question tokens as answer category tokens.
(3) Negation tokens. These correspond to the negation expression introduced during benchmark construction. As described in Appendix B.1, we use spaCy’s syntactic analysis to identify the relevant predicate and determine where to introduce negation. We then identify the prompt tokens corresponding to that expression.
(4) Final prompt token. This is the last token of the input prompt, whose representation is used to predict the first answer token.
We have added this explanation to Section 3 and Appendix D.1.
Q4. Normalised log-prob gap shift (line 233) missing x_i in the numerator.
We have corrected the numerator of the normalized log-probability gap shift to include the missing . Thank you for catching this omission.
Official Rebuttal (1/4)
Thank you for your careful reading and thoughtful review. We especially appreciate how well your review summary captures the intent of our work.
Below, we address the weaknesses (W) and questions (Q) you raised and explain how we have strengthened the paper in response. We note the changes in our responses and highlight them in blue in the revised manuscript
TL;DR: We have expanded Sections 4.1–4.2 to explain the intuition and procedures behind our core interventions in the main text.
Thank you for pointing this out. We are glad that you found our intervention approaches and metrics broadly sound. In covering several aspects of the problem, we left some methodological explanations too brief. We have therefore expanded these explanations in Sections 4.1 and 4.2, which present our core mechanistic analyses, to provide clearer intuitions and more technical detail in the main text.
Specifically, Section 4.1 now explains how we rank heads and neurons, fix the selected components before validation, and test their causal effects against matched random controls. Section 4.2 clarifies how we learn the answer-category and candidate-preference spaces through interventions that favor another category or another answer within the same category, respectively.
TL;DR: Our novelty lies in explaining how support and suppression mechanisms jointly implement negation and, more importantly, using this understanding to explain negation failures.
Thank you for pointing us to these relevant papers. We would like to take this opportunity to clarify the novelty of our findings.
We agree that support and suppression mechanisms have already been reported in prior work [1–3]. However, our analysis goes beyond examining the effects of individual mechanisms to explain how these relatively simple mechanisms work together to implement a more complex behavior such as negation.
Furthermore, our main contribution is to use this mechanistic understanding to explain why the model’s handling of negation is unreliable. Specifically, we find that the way the suppression mechanism operates is closely linked to negation failures. The model suppresses retrieval of the original answer and promotes candidates within the same category, but does not reliably use information about the original answer to determine what should be excluded. A favored candidate can therefore be the original answer itself, leading the model to repeat it under negation.
We have revised the related works section (Appendix A.2) to discuss these connections to prior mechanistic studies [1–3] and clarify the distinction from our findings. We have also incorporated FLUKE [4] into Appendix A.1 alongside prior evaluations of robustness to negation.
[1] Ortu et al. (2024). Competition of Mechanisms: Tracing How Language Models Handle Facts and Counterfactuals. ACL 2024.
[2] Sun et al. (2025). ReDeEP: Detecting Hallucination in Retrieval-Augmented Generation via Mechanistic Interpretability. ICLR 2025.
[3] Li, Chen, and Tong (2025). Taming Knowledge Conflicts in Language Models. ICML 2025.
[4] Otmakhova et al. (2026). FLUKE: A Linguistically-Driven and Task-Agnostic Framework for Robustness Evaluation. Findings of EACL 2026.