Context or Knowledge: How LLMs Attribute Their Own Answers
Read the original on arXiv Computation and Language →The Flow has not summarised this story yet — read it at arXiv Computation and Language.
The Flow has not summarised this story yet — read it at arXiv Computation and Language.
The paper investigates where fine‑tuned behaviors in language models are instantiated by patching the key‑value (KV) cache between a LoRA‑fine‑tuned model and its base version. Results show that certain behaviors, such as German responses or emergent misalignment, can be transferred or removed by swapping KV cache segments, and that the impact grows with the amount patched and is concentrated at a few pivotal positions like system‑prompt and chat‑template tokens.
arXiv:2606. 28358v1 Announce Type: cross Abstract: Retrieval-Augmented Generation (RAG) aims to enhance the trustworthiness of Large Language Models (LLMs) by grounding their outputs in external documents, often using inline citations for verifiability.
The paper investigates whether language models truly reveal their internal decision process when faced with conflicting evidence. In a conflicting‑context question‑answering task, the authors find that models can silently commit to one source, a hidden source commitment that can be detected via a residual source‑choice direction. They show that steering this direction can change the chosen source, while conflict disclosure behaves differently and is only partially steerable.
arXiv:2603.13911v2 Announce Type: replace Abstract: A language model can give the wrong answer even when the correct answer is decodable from its intermediate states. To study this gap between decoda...
arXiv:2607. 04572v2 Announce Type: replace Abstract: Large language model (LLM) tutors may have access to teacher notes, answer keys, rubrics, or retrieved solutions while producing student-facing explanations.
The paper investigates how entity‑replacement responses can be reused across different English factual questions when model weights are fixed. By injecting hidden‑state changes from two source questions into a target question about the same entity, the authors compare predicted log‑probability shifts with actual measurements, finding that hidden reuse can reduce no‑change error by up to 49% on certain models and that a later protocol can achieve 58‑68% success on three cohorts. The study also notes that larger checkpoints, chat formats, and new entities affect replication, and that relation‑neutral changes at entity tokens lower relation‑selective error more effectively than random changes.