Shaping the Document, Not the Model: Optimized Suffixes for Context Following
When a user supplies a document and wants the answer drawn from it, a language model is expected to follow it even when it contradicts its parametric knowledge.
ProofPaper ↗
Key points
- Prior work has focused on making the model rely on context by steering activations, contrasting logits during decoding, or instructing it in plain language.
- We optimize a document suffix by discrete token search, starting from the answer to a single question and extending the objective to a set of passages, to multi-hop questions that follow from the planted fact, and to later turns of a conversation.
- On counterfactual passages that contradict parametric knowledge of the model, the suffix flips nearly all items the model resists across three instruction-tuned model families, in most settings outperforms the decoding baseline and the strongest instruction we could write, and matches activation steering.
- Controls show that the suffix largely acts through the passage rather than injecting the answer, and a single suffix per model transfers to unseen passages.
Sources (1)
- [1]Shaping the Document, Not the Model: Optimized Suffixes for Context FollowingarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 19, 12:01 PM
When a user supplies a document and wants the answer drawn from it, a language model is expected to follow it even when it contradicts its parametric knowledge.
Prior work has focused on making the model rely on context by steering activations, contrasting logits during decoding, or instructing it in plain language.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 19, 2026A GPU-Resident Pipeline for Multi-Robot 3D Inspection with Limited Perception
- Oct 19, 2026SWIFT: Self-guided Weak-to-strong dIFfusion models via Target extrapolation
- Oct 19, 2026From Short Clips to Real-Time Streams: Identity-Aware Supervision and Context-Efficient Generation for Video Face Swapping
- Oct 18, 2026Google Open-Sources Harness2, a Recursive Agent Harnessing Framework
- Oct 17, 2026Nemotron 3.5 Bolt, Muse Spark Open, and a Fast LFM2.5 24B
- Oct 16, 2026Bootstrap Stochastic Interpolant Tree for Inference-time Search Under Sparse Reward
