Ballooning multi-armed bandits
From MaRDI portal
Publication:2238588
DOI10.1016/j.artint.2021.103485OpenAlexW3130258820MaRDI QIDQ2238588
Sujit Gujar, Swapnil Dhamal, Shweta Jain, Ganesh Ghalme, Yadati Narahari
Publication date: 2 November 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.10055
Cites Work
- Unnamed Item
- Unnamed Item
- Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges
- UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem
- Asymptotically efficient adaptive allocation rules
- Arm-acquiring bandits
- Bandit problems with infinitely many arms
- A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing
- On the Lambert \(w\) function
- Regret bounds for sleeping experts and bandits
- Learning and incentives in user-generated content
- Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis
- On the Distribution of the Number of Successes in Independent Trials
- A Tutorial on Thompson Sampling
- A minimax and asymptotically optimal algorithm for stochastic bandits
- 10.1162/153244303321897663
- Bandit Algorithms
- Introduction to Multi-Armed Bandits
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: Ballooning multi-armed bandits
