English
Related papers

Related papers: Contextual Information-Directed Sampling

200 papers

We study sequential decision making in environments where rewards are only partially observed, but can be modeled as a function of observed contexts and the chosen action by the decision maker. This setting, known as contextual bandits,…

Methodology · Statistics 2015-03-11 Miroslav Dudík , Dumitru Erhan , John Langford , Lihong Li

We address the problem of conformal selection, where an agent must select a minimal subset of options to ensure that at least one ``success'' is identified with a pre-specified target probability $\phi$. While traditional online conformal…

Machine Learning · Computer Science 2026-05-15 Sreenivas Gollapudi , Kostas Kollias , Kamesh Munagala , Ali Sinop

We introduce the problem of model selection for contextual bandits, where a learner must adapt to the complexity of the optimal policy while balancing exploration and exploitation. Our main result is a new model selection guarantee for…

Machine Learning · Computer Science 2019-11-15 Dylan J. Foster , Akshay Krishnamurthy , Haipeng Luo

The information ratio offers an approach to assessing the efficacy with which an agent balances between exploration and exploitation. Originally, this was defined to be the ratio between squared expected regret and the mutual information…

Machine Learning · Computer Science 2021-02-19 Adithya M. Devraj , Benjamin Van Roy , Kuang Xu

Metamorphic Testing is a software testing paradigm which aims at using necessary properties of a system-under-test, called metamorphic relations, to either check its expected outputs, or to generate new test cases. Metamorphic Testing has…

Software Engineering · Computer Science 2020-06-23 Helge Spieker , Arnaud Gotlieb

Contextual bandit algorithms are applied in a wide range of domains, from advertising to recommender systems, from clinical trials to education. In many of these domains, malicious agents may have incentives to attack the bandit algorithm…

Neural contextual bandits are vulnerable to adversarial attacks, where subtle perturbations to rewards, actions, or contexts induce suboptimal decisions. We introduce AdvBandit, a black-box adaptive attack that formulates context poisoning…

Machine Learning · Computer Science 2026-03-03 Ray Telikani , Amir H. Gandomi

Decision-makers often simultaneously face many related but heterogeneous learning problems. For instance, a large retailer may wish to learn product demand at different stores to solve pricing or inventory problems, making it desirable to…

Machine Learning · Statistics 2024-07-30 Kan Xu , Hamsa Bastani

We formulate a new problem at the intersectionof semi-supervised learning and contextual bandits,motivated by several applications including clini-cal trials and ad recommendations. We demonstratehow Graph Convolutional Network (GCN), a…

Machine Learning · Computer Science 2020-10-26 Sohini Upadhyay , Mikhail Yurochkin , Mayank Agarwal , Yasaman Khazaeni , DjallelBouneffouf

Transferring knowledge from one environment to another is an essential ability of intelligent systems. Nevertheless, when two environments are different, naively transferring all knowledge may deteriorate the performance, a phenomenon known…

Machine Learning · Computer Science 2025-02-28 Mingwei Deng , Ville Kyrki , Dominik Baumann

We explore a stochastic contextual linear bandit problem where the agent observes a noisy, corrupted version of the true context through a noise channel with an unknown noise parameter. Our objective is to design an action policy that can…

Machine Learning · Computer Science 2024-03-26 Sharu Theresa Jose , Shana Moothedath

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

The contextual bandit has been identified as a powerful framework to formulate the recommendation process as a sequential decision-making process, where each item is regarded as an arm and the objective is to minimize the regret of $T$…

Machine Learning · Computer Science 2024-09-30 Yikun Ban , Yunzhe Qi , Tianxin Wei , Lihui Liu , Jingrui He

In this work we consider adversarial contextual bandits with risk constraints. At each round, nature prepares a context, a cost for each arm, and additionally a risk for each arm. The learner leverages the context to pull an arm and then…

Machine Learning · Computer Science 2016-10-18 Wen Sun , Debadeepta Dey , Ashish Kapoor

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

We study the problem of contextual combinatorial semi-bandits, where input contexts are mapped into subsets of size $m$ of a collection of $K$ possible actions. In each round, the learner observes the realized reward of the predicted…

Machine Learning · Computer Science 2026-02-24 Liad Erez , Tomer Koren

We study decision making in environments where the reward is only partially observed, but can be modeled as a function of an action and an observed context. This setting, known as contextual bandits, encompasses a wide variety of…

Machine Learning · Computer Science 2011-05-09 Miroslav Dudik , John Langford , Lihong Li

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

Bayesian strategies for contextual bandits have proved promising in single-state reinforcement learning tasks by modeling uncertainty using context information from the environment. In this paper, we propose Greedy Bandits with Sampled…

Machine Learning · Computer Science 2020-08-03 Dom Huh

Spurred by advancements in scale, large language models (LLMs) have demonstrated strong few-shot learning ability via in-context learning (ICL). However, the performance of ICL has been shown to be highly sensitive to the selection of…

Computation and Language · Computer Science 2024-12-31 Chengwei Qin , Aston Zhang , Chen Chen , Anirudh Dagar , Wenming Ye
‹ Prev 1 8 9 10 Next ›