Asking Forever: Universal Activations Behind Turn Amplification in Conversational LLMs
Zachary Coalson, Bo Fang, Sanghyun Hong

TL;DR
This paper uncovers a universal activation mechanism in conversational LLMs that leads to turn amplification, where models prolong interactions without completing tasks, revealing a new failure mode exploitable across prompts and models.
Contribution
The study identifies a universal, query-independent activation subspace linked to clarification-seeking, enabling scalable turn amplification attacks in conversational LLMs beyond prompt-level manipulations.
Findings
Turn amplification can be systematically induced across models and prompts.
Existing defenses are limited against this universal activation-based attack.
The attack increases interaction length while maintaining task compliance.
Abstract
Multi-turn interaction length is a dominant factor in the operational costs of conversational LLMs. In this work, we present a new failure mode in conversational LLMs: turn amplification, in which a model consistently prolongs multi-turn interactions without completing the underlying task. We show that an adversary can systematically exploit clarification-seeking behaviorcommonly encouraged in multi-turn conversation settingsto scalably prolong interactions. Moving beyond prompt-level behaviors, we take a mechanistic perspective and identify a query-independent, universal activation subspace associated with clarification-seeking responses. Unlike prior cost-amplification attacks that rely on per-turn prompt optimization, our attack arises from conversational dynamics and persists across prompts and tasks. We show that this mechanism provides a scalable pathway to induce turn…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Topic Modeling · Security and Verification in Computing
