中文
相关论文

相关论文: Learning When to Trust in Contextual Bandits

200 篇论文

In learning problems, the noise inherent to the task at hand hinders the possibility to infer without a certain degree of uncertainty. Quantifying this uncertainty, regardless of its wide use, assumes high relevance for security-sensitive…

Large language models internalize a structural trade-off between truthfulness and obsequious flattery, emerging from reward optimization that conflates helpfulness with polite submission. This latent bias, known as sycophancy, manifests as…

计算与语言 · 计算机科学 2026-05-19 Sanskar Pandey , Ruhaan Chopra , Angkul Puniya , Sohom Pal

We study contextual bandit learning with an abstract policy class and continuous action space. We obtain two qualitatively different regret bounds: one competes with a smoothed version of the policy class under no continuity assumptions,…

机器学习 · 统计学 2020-06-23 Akshay Krishnamurthy , John Langford , Aleksandrs Slivkins , Chicheng Zhang

Large Language Models (LLMs) exhibit impressive capabilities yet suffer from sensitivity to slight input context variations, hampering reliability. Conventional metrics like accuracy and perplexity fail to assess local prediction…

计算与语言 · 计算机科学 2026-02-12 Deyuan Liu , Zecheng Wang , Zhanyue Qin , Zhiying Tu , Dianhui Chu , Dianbo Sui

Large Language Models often generate unfaithful responses in knowledge intensive tasks due to knowledge conflict,that is,a preference for relying on internal parametric knowledge rather than the provided context.To address this issue,we…

计算与语言 · 计算机科学 2025-09-15 Shengqiang Fu

A standard practice when using large language models is for users to supplement their instruction with an input context containing new information for the model to process. However, models struggle to reliably follow the input context,…

机器学习 · 计算机科学 2025-04-22 Sachin Goyal , Christina Baek , J. Zico Kolter , Aditi Raghunathan

When training most modern reading comprehension models, all the questions associated with a context are treated as being independent from each other. However, closely related questions and their corresponding answers are not independent,…

计算与语言 · 计算机科学 2021-04-20 Dheeru Dua , Pradeep Dasigi , Sameer Singh , Matt Gardner

In contested domains, instruction-tuned language models must balance user-alignment pressures against faithfulness to the in-context evidence. To evaluate this tension, we introduce a controlled epistemic-conflict framework grounded in the…

计算与语言 · 计算机科学 2026-03-23 Sai Koneru , Elphin Joe , Christine Kirchhoff , Jian Wu , Sarah Rajtmajer

Contextual bandits are widely used in industrial personalization systems. These online learning frameworks learn a treatment assignment policy in the presence of treatment effects that vary with the observed contextual features of the…

机器学习 · 计算机科学 2022-05-11 Claudia Roberts , Maria Dimakopoulou , Qifeng Qiao , Ashok Chandrashekhar , Tony Jebara

Recent techniques in Question Answering (QA) have gained remarkable performance improvement with some QA models even surpassed human performance. However, the ability of these models in truly understanding the language still remains dubious…

计算与语言 · 计算机科学 2022-03-01 Weiwen Xu , Bowei Zou , Wai Lam , Ai Ti Aw

We considered a novel practical problem of online learning with episodically revealed rewards, motivated by several real-world applications, where the contexts are nonstationary over different episodes and the reward feedbacks are not…

机器学习 · 计算机科学 2020-10-27 Baihan Lin

There is extensive interest in metric learning methods for image retrieval. Many metric learning loss functions focus on learning a correct ranking of training samples, but strongly overfit semantically inconsistent labels and require a…

机器学习 · 计算机科学 2023-06-05 Christopher Liao , Theodoros Tsiligkaridis , Brian Kulis

Designing efficient general-purpose contextual bandit algorithms that work with large -- or even continuous -- action spaces would facilitate application to important scenarios such as information retrieval, recommendation systems, and…

机器学习 · 计算机科学 2022-07-14 Yinglun Zhu , Paul Mineiro

We study a generalization of the problem of online learning in adversarial linear contextual bandits by incorporating loss functions that belong to a reproducing kernel Hilbert space, which allows for a more flexible modeling of complex…

机器学习 · 统计学 2023-10-04 Gergely Neu , Julia Olkhovskaya , Sattar Vakili

Adaptively collected data has become ubiquitous within modern practice. However, even seemingly benign adaptive sampling schemes can introduce severe biases, rendering traditional statistical inference tools inapplicable. This can be…

统计理论 · 数学 2025-12-02 Wei Fan , Kevin Tan , Yuting Wei

Learning effective negotiation strategies poses two key challenges: the exploration-exploitation dilemma and dealing with large action spaces. However, there is an absence of learning-based approaches that effectively address these…

人工智能 · 计算机科学 2024-07-02 Yexin Li , Zhancun Mu , Siyuan Qi

Large reasoning models with reasoning capabilities achieve state-of-the-art performance on complex tasks, but their robustness under multi-turn adversarial pressure remains underexplored. We evaluate nine frontier reasoning models under…

人工智能 · 计算机科学 2026-03-13 Yubo Li , Ramayya Krishnan , Rema Padman

Large Language Models (LLMs) struggle with long-horizon tasks due to the "context bottleneck" and the "lost-in-the-middle" phenomenon, where accumulated noise from verbose environments degrades reasoning over multi-turn interactions. To…

人工智能 · 计算机科学 2026-04-14 Xiaozhe Li , Tianyi Lyu , Yizhao Yang , Liang Shan , Siyi Yang , Ligao Zhang , Zhuoyi Huang , Qingwen Liu , Yang Li

Large language models (LLMs) are rapidly transitioning into medical clinical use, yet their reliability under realistic, multi-turn interactions remains poorly understood. Existing evaluation frameworks typically assess single-turn question…

计算与语言 · 计算机科学 2025-10-15 Blazej Manczak , Eric Lin , Francisco Eiras , James O' Neill , Vaikkunth Mugunthan

This paper addresses the poor finite-horizon performance of existing online \emph{restless bandit} (RB) algorithms, which stems from the prohibitive sample complexity of learning a full \emph{Markov decision process} (MDP) for each agent.…

机器学习 · 计算机科学 2026-04-07 Jiamin Xu , Ivan Nazarov , Aditya Rastogi , África Periáñez , Kyra Gan