paper-with-me

홈 › Papers

On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs

2015-12-01 · NeurIPS 2015 12 · Wei Cao, Jian Li, Yufei Tao, Zhize Li

This paper discusses how to efficiently choose from $n$ unknowndistributions the $k$ ones whose means are the greatest by a certainmetric, up to a small relative error. We study the topic under twostandard settings---multi-armed bandits and hidden bipartitegraphs---which differ in the nature of the input distributions. In theformer setting, each distribution can be sampled (in the i.i.d.manner) an arbitrary number of times, whereas in the latter, eachdistribution is defined on a population of a finite size $m$ (andhence, is fully revealed after $m$ samples). For both settings, weprove lower bounds on the total number of samples needed, and proposeoptimal algorithms whose sample complexities match those lower bounds.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Multi-Armed Bandits

Similar Papers 제목 키워드 기반

OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits

2019-05-24 · Niladri S. Chatterji, Vidya Muthukumar, Peter L. Bartlett

We consider the stochastic linear (multi-armed) contextual bandit problem with the possibility of hidden simple multi-armed bandit structure in which the rewards are independent of the contextual information. Algorithms …

Multi-Armed Bandits

Observation-Augmented Contextual Multi-Armed Bandits for Robotic Search and Exploration

2023-12-19 · Shohei Wakayama, Nisar Ahmed

We introduce a new variant of contextual multi-armed bandits (CMABs) called observation-augmented CMABs (OA-CMABs) wherein a robot uses extra outcome observations from an external information source, e.g. humans. In OA-C…

Bayesian InferenceDecision MakingDecision Making Under UncertaintyMulti-Armed Bandits

Risk averse non-stationary multi-armed bandits

2021-09-28 · Leo Benac, Frédéric Godin

This paper tackles the risk averse multi-armed bandits problem when incurred losses are non-stationary. The conditional value-at-risk (CVaR) is used as the objective function. Two estimation methods are proposed for this…

Multi-Armed Bandits

Autonomous Drug Design with Multi-Armed Bandits

2022-07-04 · Hampus Gummesson Svensson, Esben Jannik Bjerrum, Christian Tyrchan, Ola Engkvist 외

Recent developments in artificial intelligence and automation support a new drug design paradigm: autonomous drug design. Under this paradigm, generative models can provide suggestions on thousands of molecules with spec…

Drug DesignMulti-Armed Bandits

Diversity-Driven Selection of Exploration Strategies in Multi-Armed Bandits

2018-08-23 · Fabien C. Y. Benureau, Pierre-Yves Oudeyer

We consider a scenario where an agent has multiple available strategies to explore an unknown environment. For each new interaction with the environment, the agent must select which exploration strategy to use. We provid…

DiversityMulti-Armed Bandits