English
Related papers

Related papers: Preference is More Than Comparisons: Rethinking Du…

200 papers

Contextual dueling bandit is used to model the bandit problems, where a learner's goal is to find the best arm for a given context using observed noisy human preference feedback over the selected arms for the past contexts. However,…

Machine Learning · Computer Science 2025-04-17 Arun Verma , Zhongxiang Dai , Xiaoqiang Lin , Patrick Jaillet , Bryan Kian Hsiang Low

The dramatic improvements in core information retrieval tasks engendered by neural rankers create a need for novel evaluation methods. If every ranker returns highly relevant items in the top ranks, it becomes difficult to recognize…

Information Retrieval · Computer Science 2022-04-25 Xinyi Yan , Chengxi Luo , Charles L. A. Clarke , Nick Craswell , Ellen M. Voorhees , Pablo Castells

Preference-based feedback is important for many applications where direct evaluation of a reward function is not feasible. A notable recent example arises in reinforcement learning from human feedback on large language models. For many of…

Machine Learning · Computer Science 2023-07-24 Viraj Mehta , Ojash Neopane , Vikramjeet Das , Sen Lin , Jeff Schneider , Willie Neiswanger

Optimization problems find widespread use in both single-objective and multi-objective scenarios. In practical applications, users aspire for solutions that converge to the region of interest (ROI) along the Pareto front (PF). While the…

Artificial Intelligence · Computer Science 2025-03-10 Tian Huang , Shengbo Wang , Ke Li

In machine learning, the notion of multi-armed bandits refers to a class of online learning problems, in which an agent is supposed to simultaneously explore and exploit a given set of choice alternatives in the course of a sequential…

Machine Learning · Computer Science 2021-07-13 Viktor Bengs , Robert Busa-Fekete , Adil El Mesaoudi-Paul , Eyke Hüllermeier

We consider the well-studied dueling bandit problem, where a learner aims to identify near-optimal actions using pairwise comparisons, under the constraint of differential privacy. We consider a general class of utility-based preference…

Machine Learning · Computer Science 2024-03-25 Aadirupa Saha , Hilal Asi

Interactive preference learning systems infer human preferences by presenting queries as pairs of options and collecting binary choices. Although binary choices are simple and widely used, they provide limited information about preference…

Machine Learning · Computer Science 2025-01-03 Shen Li , Yuyang Zhang , Zhaolin Ren , Claire Liang , Na Li , Julie A. Shah

Multi-Armed-Bandit frameworks have often been used by researchers to assess educational interventions, however, recent work has shown that it is more beneficial for a student to provide qualitative feedback through preference elicitation…

Machine Learning · Computer Science 2021-11-02 Nayan Saxena , Pan Chen , Emmy Liu

Collecting human preference feedback is often expensive, leading recent works to develop principled algorithms to select them more efficiently. However, these works assume that the underlying reward function is linear, an assumption that…

Machine Learning · Computer Science 2025-07-18 Arun Verma , Xiaoqiang Lin , Zhongxiang Dai , Daniela Rus , Bryan Kian Hsiang Low

We consider Bayesian optimization in settings where observations can be adversarially biased, for example by an uncontrolled hidden confounder. Our first contribution is a reduction of the confounded setting to the dueling bandit model.…

Machine Learning · Statistics 2021-06-10 Johannes Kirschner , Andreas Krause

Learning from human feedback plays an important role in aligning generative models, such as large language models (LLM). However, the effectiveness of this approach can be influenced by adversaries, who may intentionally provide misleading…

Machine Learning · Computer Science 2025-11-13 Qiwei Di , Jiafan He , Quanquan Gu

We consider the problem of reward maximization in the dueling bandit setup along with constraints on resource consumption. As in the classic dueling bandits, at each round the learner has to choose a pair of items from a set of $K$ items…

Machine Learning · Computer Science 2023-12-29 Rohan Deb , Aadirupa Saha

We introduce the problem of sleeping dueling bandits with stochastic preferences and adversarial availabilities (DB-SPAA). In almost all dueling bandit applications, the decision space often changes over time; eg, retail store management,…

Machine Learning · Computer Science 2021-07-07 Aadirupa Saha , Pierre Gaillard

Bandits with preference feedback present a powerful tool for optimizing unknown target functions when only pairwise comparisons are allowed instead of direct value queries. This model allows for incorporating human feedback into online…

Machine Learning · Computer Science 2025-12-19 Barna Pásztor , Parnian Kassraie , Andreas Krause

The contextual multi-armed bandit (MAB) is a widely used framework for problems requiring sequential decision-making under uncertainty, such as recommendation systems. In applications involving a large number of users, the performance of…

Machine Learning · Computer Science 2025-02-05 Zhiyong Wang , Jiahang Sun , Mingze Kong , Jize Xie , Qinghua Hu , John C. S. Lui , Zhongxiang Dai

We study the $K$-armed contextual dueling bandit problem, a sequential decision making setting in which the learner uses contextual information to make two decisions, but only observes \emph{preference-based feedback} suggesting that one…

Machine Learning · Computer Science 2021-11-25 Aadirupa Saha , Akshay Krishnamurthy

With the recent advances of conversational recommendations, the recommender system is able to actively and dynamically elicit user preference via conversational interactions. To achieve this, the system periodically queries users'…

Information Retrieval · Computer Science 2022-08-23 Zhihui Xie , Tong Yu , Canzhe Zhao , Shuai Li

Conversational recommendation systems elicit user preferences by interacting with users to obtain their feedback on recommended commodities. Such systems utilize a multi-armed bandit framework to learn user preferences in an online manner…

Machine Learning · Computer Science 2024-07-29 Shuhua Yang , Hui Yuan , Xiaoying Zhang , Mengdi Wang , Hong Zhang , Huazheng Wang

We study reinforcement learning from human feedback in general Markov decision processes, where agents learn from trajectory-level preference comparisons. A central challenge in this setting is to design algorithms that select informative…

Machine Learning · Computer Science 2025-12-05 Andreas Schlaginhaufen , Reda Ouhamma , Maryam Kamgarpour

For a real-world decision-making problem, the reward function often needs to be engineered or learned. A popular approach is to utilize human feedback to learn a reward function for training. The most straightforward way to do so is to ask…

Machine Learning · Computer Science 2023-10-31 Xiang Ji , Huazheng Wang , Minshuo Chen , Tuo Zhao , Mengdi Wang
‹ Prev 1 2 3 10 Next ›