Learning When to Trust via Selective Context Preference Optimization
Xian Sun, Wei Chow, Yingshuo Wang, Junhao Liu, Wei Gao, Qing Wu, Lingdong Kong
Abstract
Language models increasingly condition their answers on external signals, and a single misleading one can turn a correct answer wrong. The obvious remedy, training models to resist such signals, hides a failure mode: a model that ignores all context looks robust yet is useless when the context is worth trusting. We recast the problem as selective trust and introduce MIST, a human-annotated benchmark that renders each reasoning item under four matched conditions (clean, misleading, correct-context, and irrelevant-context), together with SC2W, a paired metric counting how often a misleading signal flips a clean-correct answer to wrong. Across a comprehensive benchmark study, we observe that such a susceptibility is universal. We then propose SCOPE, which mines clean-correct/misleading-wrong failures and optimizes a standard Direct Preference Optimization (DPO) objective over matched preference pairs balanced equally across all four conditions, rather than over misleading items alone. Our approach substantially reduces SC2W on popular open-sourced models while preserving accuracy when the added context is clean, correct, or irrelevant. With this work, we argue that models should be judged on selective trust, not on resistance alone.
Create a lesson
Related papers
The Bitter Lesson of Tool Calling
Ishan Patel, Sahil Sen, Elias Lumer et al.
RP-OPSD: Reasoning-Pivot-Guided On-Policy Self-Distillation for Multilingual Reasoning Transfer
Xinye Wang, Junxiao Liu, Shujian Huang
Benchmarking the Benchmarks: Evaluating Benchmarks for Conversational Agents
Noam Koren, Roy Bar-Haim, Abigail Goldsteen
Benchmarking and Enhancing LLMs for Rule-Intensive Review of National Standard Documents
Tao Wang, Qihao Yang, Rongjiao Liang et al.
NeSy-RAG: Neuro-Symbolic RAG for Explainable Question Answering
Jonas Gann, Michael Gertz
Routing Is Least Learnable Where It Is Most Valuable: Bounds on Representation Routing for Web Agents
Jiaming Wei, Zekun Wu, Adriano Koshiyama et al.