Ising bandits with side information
Abstract
References
Recommendations
Dueling bandits with weak regret
ICML'17: Proceedings of the 34th International Conference on Machine Learning - Volume 70We consider online content recommendation with implicit feedback through pairwise comparisons, formalized as the so-called dueling bandit problem. We study the dueling bandit problem in the Condorcet winner setting, and consider two notions of regret: ...
Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments
The nonstochastic multi-armed bandit problem, first studied by Auer, Cesa-Bianchi, Freund, and Schapire in 1995, is a game of repeatedly choosing one decision from a set of decisions (''experts''), under partial observation: In each round t, only the ...
Information-gathering in latent bandits
AbstractIn the latent bandit problem, the learner has access to reward distributions and – for the non-stationary variant – transition models of the environment. The reward distributions are conditioned on the arm and unknown latent states. ...
Highlights- We investigate the use of information gathering in latent bandits.
- We develop a ...
Comments
Information & Contributors
Information
Published In
Sponsors
- Huawei Technologies Co. Ltd.: Huawei Technologies Co. Ltd.
- Zalando: Zalando
- ONRGlobal: U.S. Office of Naval Research Global
- BNPPARIBAS: BNP PARIBAS
- Amazon: Amazon.com
Publisher
Springer
Gewerbestrasse 11 CH-6330, Cham (ZG), Switzerland
Publication History
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in