Safe and Efficient In-Context Learning via Risk Control
Andrea Wynn, Metod Jazbec, Charith Peris, Rinat Khaziev, Anqi Liu, Daniel Khashabi, Eric Nalisnick
TL;DR
This work addresses safety in in-context learning by bounding harmful influence below a safe zero-shot baseline. It introduces a distribution-free risk control (DFRC) framework combined with dynamic early exits to cap risk through a per-example threshold $\lambda$, while preserving benefits from helpful demonstrations and improving efficiency. The authors define a safe ICL predictor, an overthinking loss $\ell_{ICL}$, and a risk-transformation adaptation of Learn-Then-Test to handle non-monotonic and negative losses, offering theoretical guarantees and empirical risk control across eight tasks and four models with substantial speedups. Overall, the approach provides a principled mechanism to manage mixed-quality prompts, enabling safer and more efficient deployment of LLMs in real-world settings.
Abstract
Large language models (LLMs) demonstrate a remarkable ability to learn new tasks from a few in-context examples. However, this flexibility introduces safety concerns: LLMs can be influenced by incorrect or malicious demonstrations -- for example, if an adversary tampers with or injects harmful examples without a human supervisor noticing. This motivates principled designs in which the system itself includes built-in mechanisms to guard against such attacks. We propose a novel approach to limit the degree to which harmful demonstrations can degrade model performance. First, we define a baseline ``safe'' behavior for the model -- the model's performance given no in-context demonstrations (zero-shot). Next, we apply distribution-free risk control (DFRC) to control the extent to which in-context samples can decay performance below zero-shot. We achieve this by leveraging dynamic early exit prediction, ignoring later attention heads that attend the most to the unsafe inputs. Finally, we propose modifications to DFRC that allow it to both control risk for harmful inputs \textit{and} leverage performance and efficiency gains on helpful inputs. We present both theoretical and empirical results showing that our approach can effectively control risk for harmful in-context demonstrations while simultaneously achieving substantial computational efficiency gains with helpful demonstrations.
