English
Related papers

Related papers: IntelligentPooling: Practical Thompson Sampling fo…

200 papers

Recent advances in deep reinforcement learning have made significant strides in performance on applications such as Go and Atari games. However, developing practical methods to balance exploration and exploitation in complex domains remains…

Machine Learning · Statistics 2018-02-27 Carlos Riquelme , George Tucker , Jasper Snoek

Thompson Sampling has been widely used for contextual bandit problems due to the flexibility of its modeling power. However, a general theory for this class of methods in the frequentist setting is still lacking. In this paper, we present a…

Machine Learning · Computer Science 2021-10-05 Tong Zhang

We study the problem of finding the optimal dosage in early stage clinical trials through the multi-armed bandit lens. We advocate the use of the Thompson Sampling principle, a flexible algorithm that can accommodate different types of…

Machine Learning · Statistics 2020-04-09 Maryam Aziz , Emilie Kaufmann , Marie-Karelle Riviere

Personalisation of products and services is fast becoming the driver of success in banking and commerce. Machine learning holds the promise of gaining a deeper understanding of and tailoring to customers' needs and preferences. Whereas…

Machine Learning · Computer Science 2022-06-30 Charl Maree , Christian Omlin

While robot learning has demonstrated promising results for enabling robots to automatically acquire new skills, a critical challenge in deploying learning-based systems is scale: acquiring enough data for the robot to effectively…

We study the problem of online multi-task learning where the tasks are performed within similar but not necessarily identical multi-armed bandit environments. In particular, we study how a learner can improve its overall performance across…

Machine Learning · Computer Science 2022-06-20 Zhi Wang , Chicheng Zhang , Kamalika Chaudhuri

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

We consider incentivized exploration: a version of multi-armed bandits where the choice of arms is controlled by self-interested agents, and the algorithm can only issue recommendations. The algorithm controls the flow of information, and…

Computer Science and Game Theory · Computer Science 2022-06-14 Mark Sellke , Aleksandrs Slivkins

Dental disease is a prevalent chronic condition associated with substantial financial burden, personal suffering, and increased risk of systemic diseases. Despite widespread recommendations for twice-daily tooth brushing, adherence to…

Artificial Intelligence · Computer Science 2024-12-20 Anna L. Trella , Kelly W. Zhang , Hinal Jajal , Inbal Nahum-Shani , Vivek Shetty , Finale Doshi-Velez , Susan A. Murphy

Many interventions, such as vaccines in clinical trials or coupons in online marketplaces, must be assigned sequentially without full knowledge of their effects. Multi-armed bandit algorithms have proven successful in such settings.…

Machine Learning · Statistics 2026-05-07 Aidan Gleich , Eric Laber , Alexander Volfovsky

Thompson Sampling is one of the most widely used and studied bandit algorithms, known for its simple structure, low regret performance, and solid theoretical guarantees. Yet, in stark contrast to most other families of bandit algorithms,…

Machine Learning · Computer Science 2026-05-28 Yanlin Qu , Hongseok Namkoong , Assaf Zeevi

Thompson sampling provides a solution to bandit problems in which new observations are allocated to arms with the posterior probability that an arm is optimal. While sometimes easy to implement and asymptotically optimal, Thompson sampling…

Machine Learning · Computer Science 2014-10-16 Dean Eckles , Maurits Kaptein

Thompson Sampling (TS) and its variants are powerful Multi-Armed Bandit algorithms used to balance exploration and exploitation strategies in active learning. Yet, their probabilistic nature often turns them into a "black box", hindering…

Human-Computer Interaction · Computer Science 2025-08-22 Parsa Vares , Éloi Durant , Jun Pang , Nicolas Médoc , Mohammad Ghoniem

Intelligent systems have the ability to improve their behaviour over time taking observations, experiences or explicit feedback into account. Traditional approaches separate the learning problem and make isolated use of techniques from…

Machine Learning · Computer Science 2022-01-12 Simon Reichhuber , Sven Tomforde

In this paper we consider an online recommendation setting, where a platform recommends a sequence of items to its users at every time period. The users respond by selecting one of the items recommended or abandon the platform due to…

Machine Learning · Computer Science 2019-04-16 Yunjuan Wang , Theja Tulabandhula

We study the effects of approximate inference on the performance of Thompson sampling in the $k$-armed bandit problems. Thompson sampling is a successful algorithm for online decision-making but requires posterior inference, which often…

Machine Learning · Computer Science 2020-01-16 My Phan , Yasin Abbasi-Yadkori , Justin Domke

Thompson sampling is an efficient algorithm for sequential decision making, which exploits the posterior uncertainty to address the exploration-exploitation dilemma. There has been significant recent interest in integrating Bayesian neural…

Machine Learning · Statistics 2020-08-07 Zhendong Wang , Mingyuan Zhou

Timely decision making is critical to the effectiveness of mobile health (mHealth) interventions. At predefined timepoints called "decision points," intelligent mHealth systems such as just-in-time adaptive interventions (JITAIs) estimate…

Artificial Intelligence · Computer Science 2025-09-16 Asim H. Gazi , Bhanu Teja Gullapalli , Daiqi Gao , Benjamin M. Marlin , Vivek Shetty , Susan A. Murphy

Users of recommender systems often behave in a non-stationary fashion, due to their evolving preferences and tastes over time. In this work, we propose a practical approach for fast personalization to non-stationary users. The key idea is…

Machine Learning · Computer Science 2020-12-02 Joey Hong , Branislav Kveton , Manzil Zaheer , Yinlam Chow , Amr Ahmed , Mohammad Ghavamzadeh , Craig Boutilier

A common challenge for decision makers is selecting actions whose rewards are unknown and evolve over time based on prior policies. For instance, repeated use may reduce an action's effectiveness (habituation), while inactivity may restore…

Machine Learning · Computer Science 2025-11-06 Fengxu Li , Stephanie M. Carpenter , Matthew P. Buman , Yonatan Mintz