English
Related papers

Related papers: Utility-based Dueling Bandits as a Partial Monitor…

200 papers

Partial monitoring is an expressive framework for sequential decision-making with an abundance of applications, including graph-structured and dueling bandits, dynamic pricing and transductive feedback models. We survey and extend recent…

Machine Learning · Computer Science 2023-11-15 Johannes Kirschner , Tor Lattimore , Andreas Krause

Partial monitoring is a generalization of the well-known multi-armed bandit framework where the loss is not directly observed by the learner. We complete the classification of finite adversarial partial monitoring to include all games,…

Machine Learning · Computer Science 2018-05-24 Tor Lattimore , Csaba Szepesvari

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

Research on the multi-armed bandit problem has studied the trade-off of exploration and exploitation in depth. However, there are numerous applications where the cardinal absolute-valued feedback model (e.g. ratings from one to five) is not…

Machine Learning · Computer Science 2018-12-12 Lennard Hilgendorf

The dueling bandit problem, an essential variation of the traditional multi-armed bandit problem, has become significantly prominent recently due to its broad applications in online advertising, recommendation systems, information…

Machine Learning · Computer Science 2025-04-08 Bongsoo Yi , Yue Kang , Yao Li

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

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

We consider online learning in partial-monitoring games against an oblivious adversary. We show that when the number of actions available to the learner is two and the game is nontrivial then it is reducible to a bandit-like game and thus…

Machine Learning · Computer Science 2011-08-26 András Antos , Gábor Bartók , Csaba Szepesvári

We study the problem of online learning in adversarial bandit problems under a partial observability model called off-policy feedback. In this sequential decision making problem, the learner cannot directly observe its rewards, but instead…

Machine Learning · Computer Science 2022-07-20 Germano Gabbianelli , Matteo Papini , Gergely Neu

We present algorithms for reducing the Dueling Bandits problem to the conventional (stochastic) Multi-Armed Bandits problem. The Dueling Bandits problem is an online model of learning with ordinal feedback of the form "A is preferred to B"…

Machine Learning · Computer Science 2014-05-15 Nir Ailon , Thorsten Joachims , Zohar Karnin

Partial monitoring is a general model for sequential learning with limited feedback formalized as a game between two players. In this game, the learner chooses an action and at the same time the opponent chooses an outcome, then the learner…

Machine Learning · Statistics 2015-10-01 Junpei Komiyama , Junya Honda , Hiroshi Nakagawa

The dueling bandits problem is an online learning framework for learning from pairwise preference feedback, and is particularly well-suited for modeling settings that elicit subjective or implicit human feedback. In this paper, we study the…

Machine Learning · Computer Science 2017-05-02 Yanan Sui , Vincent Zhuang , Joel W. Burdick , Yisong Yue

Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss…

Computer Science and Game Theory · Computer Science 2011-10-13 András Antos , Gábor Bartók , Dávid Pál , Csaba Szepesvári

New ranking algorithms are continually being developed and refined, necessitating the development of efficient methods for evaluating these rankers. Online ranker evaluation focuses on the challenge of efficiently determining, from implicit…

Information Retrieval · Computer Science 2016-08-23 Brian Brost , Yevgeny Seldin , Ingemar J. Cox , Christina Lioma

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 in multi-player games can model a large variety of practical scenarios, where each player seeks to optimize its own local objective function, which at the same time relies on the actions taken by others. Motivated by the frequent…

Optimization and Control · Mathematics 2023-09-08 Yuanhanqing Huang , Jianghai Hu

We formulate and study a novel multi-armed bandit problem called the qualitative dueling bandit (QDB) problem, where an agent observes not numeric but qualitative feedback by pulling each arm. We employ the same regret as the dueling bandit…

Machine Learning · Statistics 2018-09-19 Liyuan Xu , Junya Honda , Masashi Sugiyama

Decision-making problems of sequential nature, where decisions made in the past may have an impact on the future, are used to model many practically important applications. In some real-world applications, feedback about a decision is…

Machine Learning · Computer Science 2023-03-02 Ronald C. van den Broek , Rik Litjens , Tobias Sagis , Luc Siecker , Nina Verbeeke , Pratik Gajane

Uncertainty quantification is crucial in safety-critical systems, where decisions must be made under uncertainty. In particular, we consider the problem of online uncertainty quantification, where data points arrive sequentially. Online…

Machine Learning · Computer Science 2026-04-21 Junyoung Yang , Kyungmin Kim , Sangdon Park

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
‹ Prev 1 2 3 10 Next ›