English
Related papers

Related papers: Optimal Conditional Inference in Adaptive Experime…

200 papers

The treatment assignment mechanism in a randomized clinical trial can be optimized for statistical efficiency within a specified class of randomization mechanisms. Optimal designs of this type have been characterized in terms of the…

Methodology · Statistics 2025-09-03 Wei Zhang , Zhiwei Zhang , Aiyi Liu

Bandits with covariates, a.k.a. contextual bandits, address situations where optimal actions (or arms) at a given time $t$, depend on a context $x_t$, e.g., a new patient's medical history, a consumer's past purchases. While it is…

Machine Learning · Statistics 2021-02-23 Joseph Suk , Samory Kpotufe

We examine a multi-armed bandit problem with contextual information, where the objective is to ensure that each arm receives a minimum aggregated reward across contexts while simultaneously maximizing the total cumulative reward. This…

Machine Learning · Computer Science 2025-10-15 Ahmed Ben Yahmed , Hafedh El Ferchichi , Marc Abeille , Vianney Perchet

We consider the problem of contextual bandits and imitation learning, where the learner lacks direct knowledge of the executed action's reward. Instead, the learner can actively query an expert at each round to compare two actions and…

Machine Learning · Computer Science 2023-07-25 Ayush Sekhari , Karthik Sridharan , Wen Sun , Runzhe Wu

In this paper, we study the problem of estimating uniformly well the mean values of several distributions given a finite budget of samples. If the variance of the distributions were known, one could design an optimal sampling strategy by…

Machine Learning · Computer Science 2015-07-17 Alexandra Carpentier , Alessandro Lazaric , Mohammad Ghavamzadeh , Rémi Munos , Peter Auer , András Antos

A contextual bandit problem is studied in a highly non-stationary environment, which is ubiquitous in various recommender systems due to the time-varying interests of users. Two models with disjoint and hybrid payoffs are considered to…

Machine Learning · Computer Science 2020-03-03 Xiao Xu , Fang Dong , Yanghua Li , Shaojian He , Xin Li

We consider the problem of best arm identification in the multi-armed bandit model, under fixed confidence. Given a confidence input $\delta$, the goal is to identify the arm with the highest mean reward with a probability of at least 1 --…

Machine Learning · Statistics 2023-12-21 El Mehdi Saad , Gilles Blanchard , Nicolas Verzelen

We adopt an optimal-control framework for addressing the undiscounted infinite-horizon discrete-time restless $N$-armed bandit problem. Unlike most studies that rely on constructing policies based on the relaxed single-armed Markov Decision…

Optimization and Control · Mathematics 2024-03-19 Chen YAN

Much of the recent literature on bandit learning focuses on algorithms that aim to converge on an optimal action. One shortcoming is that this orientation does not account for time sensitivity, which can play a crucial role when learning an…

Machine Learning · Computer Science 2020-01-09 Daniel Russo , Benjamin Van Roy

Many economic panel and dynamic models, such as rational behavior and Euler equations, imply that the parameters of interest are identified by conditional moment restrictions. We introduce a novel inference method without any prior…

Econometrics · Economics 2024-11-01 Xiaohong Chen , Sokbae Lee , Myung Hwan Seo , Myunghyun Song

Learning for animals or humans is the process that leads to behaviors better adapted to the environment. This process highly depends on the individual that learns and is usually observed only through the individual's actions. This article…

Machine Learning · Statistics 2025-02-20 Julien Aubert , Louis Köhler , Luc Lehéricy , Giulia Mezzadri , Patricia Reynaud-Bouret

This study investigates the contextual best arm identification (BAI) problem, aiming to design an adaptive experiment to identify the best treatment arm conditioned on contextual information (covariates). We consider a decision-maker who…

Machine Learning · Computer Science 2025-06-23 Masahiro Kato , Kyohei Okumura , Takuya Ishihara , Toru Kitagawa

We study the offline contextual bandit problem, where we aim to acquire an optimal policy using observational data. However, this data usually contains two deficiencies: (i) some variables that confound actions are not observed, and (ii)…

Machine Learning · Computer Science 2023-03-21 Siyu Chen , Yitan Wang , Zhaoran Wang , Zhuoran Yang

Most contextual bandit algorithms minimize regret against the best fixed policy, a questionable benchmark for non-stationary environments that are ubiquitous in applications. In this work, we develop several efficient contextual bandit…

Machine Learning · Computer Science 2019-04-05 Haipeng Luo , Chen-Yu Wei , Alekh Agarwal , John Langford

Adaptive experiments use preliminary analyses of the data to inform further course of action and are commonly used in many disciplines including medical and social sciences. Because the null hypothesis and experimental design are…

Methodology · Statistics 2026-05-26 Tobias Freidling , Qingyuan Zhao , Zijun Gao

A key feature of sequential decision making under uncertainty is a need to balance between exploiting--choosing the best action according to the current knowledge, and exploring--obtaining information about values of other actions. The…

Machine Learning · Computer Science 2021-08-27 Dimitrije Markovic , Hrvoje Stojic , Sarah Schwoebel , Stefan J. Kiebel

We consider the setup of stochastic multi-armed bandits in the case when reward distributions are piecewise i.i.d. and bounded with unknown changepoints. We focus on the case when changes happen simultaneously on all arms, and in stark…

Machine Learning · Computer Science 2019-06-10 Subhojyoti Mukherjee , Odalric-Ambrym Maillard

When an experimenter has the option of running an adaptive trial, is it admissible to ignore this option and run a non-adaptive trial instead? We provide a negative answer to this question in the best-arm identification problem, where the…

Machine Learning · Statistics 2025-06-06 Guido Imbens , Chao Qin , Stefan Wager

We consider adaptive decision-making problems where an agent optimizes a cumulative performance objective by repeatedly choosing among a finite set of options. Compared to the classical prediction-with-expert-advice set-up, we consider…

Machine Learning · Computer Science 2023-04-10 Michael Muehlebach

I describe a framework for adaptive scientific exploration based on iterating an Observation--Inference--Design cycle that allows adjustment of hypotheses and observing protocols in response to the results of observation on-the-fly, as data…

Astrophysics · Physics 2009-11-10 Thomas J. Loredo
‹ Prev 1 4 5 6 7 8 10 Next ›