Models Recall What They Violate: Constraint Adherence in Multi-Turn LLM Ideation
Not on the map. Why?
Abstract (arXiv)
When researchers iteratively refine ideas with large language models, do the models preserve fidelity to the original objective? We introduce DriftBench, a benchmark for evaluating constraint adherence in multi-turn LLM-assisted scientific ideation. Across 2,146 scored benchmark runs spanning seven models from five providers (including two open-weight), four interaction conditions, and 38 research briefs from 24 scientific domains, we find that iterative pressure reliably increases structural complexity and often reduces adherence to original constraints. A restatement probe reveals a dissociation between declarative recall and behavioral adherence, as models accurately restate constraints they simultaneously violate. The knows-but-violates (KBV) rate, measuring constraint non-compliance despite preserved recall, ranges from 8% to 99% across models. Structured checkpointing partially reduces KBV rates but does not close the dissociation, and complexity inflation persists. Human validation against blind raters confirms that the LLM judge under-detects constraint violations, making reported constraint adherence scores conservative. Sensitivity analyses confirm the findings are robust to temperature (0.7 vs. 1.0) and pressure type (novelty vs. rigor). We release all briefs, prompts, rubrics, transcripts, and scores as an open benchmark.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 22 of its 23 references that are in the map. First posted on arXiv 30 Apr 2026.
Builds on
22 of 23 references.
References · 22
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,455
- 2023Self-Refine: Iterative Refinement with Self-Feedbackcited by 3,442
- 2023AgentBench: Evaluating LLMs as Agentscited by 1,267
- 2024LongMemEval: Benchmarking Chat Assistants on Long-Term Interactive Memorycited by 707
- 2025LLMs Get Lost In Multi-Turn Conversationcited by 429
- 2024AgentBoard: An Analytical Evaluation Board of Multi-turn LLM Agentscited by 339
- 2023MINT: Evaluating LLMs in Multi-turn Interaction with Tools and Language Feedbackcited by 297
- 2024ToolSandbox: A Stateful, Conversational, Interactive Evaluation Benchmark for LLM Tool Use Capabilitiescited by 295
- 2024MT-Bench-101: A Fine-Grained Benchmark for Evaluating Large Language Models in Multi-Turn Dialoguescited by 250
- 2025MultiChallenge: A Realistic Multi-Turn Conversation Evaluation Benchmark Challenging to Frontier LLMscited by 180
- 2024DISCOVERYWORLD: A Virtual Environment for Developing and Evaluating Automated Scientific Discovery Agentscited by 100
10 more
- 2024MT-Eval: A Multi-Turn Capabilities Evaluation Benchmark for Large Language Modelscited by 81
- 2025Beyond Single-Turn: A Survey on Multi-Turn Interactions with Large Language Modelscited by 62
- 2025HypoBench: Towards Systematic and Principled Benchmarking for Hypothesis Generationcited by 37
- 2023CoQuest: Exploring Research Question Co-Creation with an LLM-based Agentcited by 34
- 2024Evaluating LLMs' Divergent Thinking Capabilities for Scientific Idea Generation with Minimal Contextcited by 28
- 2025Drift No More? Context Equilibria in Multi-Turn LLM Interactionscited by 22
- 2024PersonaFlow: Designing LLM-Simulated Expert Perspectives for Enhanced Research Ideationcited by 16
- 2025TurnBench-MS: A Benchmark for Evaluating Multi-Turn, Multi-Step Reasoning in Large Language Modelscited by 13
- 2026TRACE: Trajectory-Aware Comprehensive Evaluation for Deep Research Agentscited by 8
- 2026Evaluating Performance Drift from Model Switching in Multi-Turn LLM Systemscited by 6
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026MAIGO: Mitigating Lost-in-Conversation with History-Cleaned On-Policy Self-Distillationcited by 6
- 2026Dead text or binding clause? Measuring and restoring constraint influence in black-box LLM dialoguescited by 0
- 2026Visible but Not Avoided: State-Dependent Re-Proposal of Rejected Candidates in Catalog-Based LLM Optimization Loopscited by 0
- 2026Visible but Not Avoided: State-Dependent Re-Proposal of Rejected Candidates in Catalog-Based LLM Optimization Loops11 Oct 2026
- 2026Dead text or binding clause? Measuring and restoring constraint influence in black-box LLM dialogues12 Aug 2026
- 2026MAIGO: Mitigating Lost-in-Conversation with History-Cleaned On-Policy Self-Distillation26 May 2026