中文
相关论文

相关论文: Bayesian Collaborative Bandits with Thompson Sampl…

200 篇论文

Mobile health (mHealth) interventions often aim to improve distal outcomes, such as clinical conditions, by optimizing proximal outcomes through just-in-time adaptive interventions. Contextual bandits provide a suitable framework for…

机器学习 · 统计学 2024-07-31 Xueqing Liu , Nina Deliu , Tanujit Chakraborty , Lauren Bell , Bibhas Chakraborty

We consider the multi armed bandit problem in non-stationary environments. Based on the Bayesian method, we propose a variant of Thompson Sampling which can be used in both rested and restless bandit scenarios. Applying discounting to the…

机器学习 · 统计学 2017-08-01 Vishnu Raj , Sheetal Kalyani

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…

机器学习 · 计算机科学 2014-10-16 Dean Eckles , Maurits Kaptein

Contextual bandits are a core technology for personalized mobile health interventions, where decision-making requires adapting to complex, non-linear user behaviors. While Thompson Sampling (TS) is a preferred strategy for these problems,…

机器学习 · 统计学 2026-02-10 Ruizhe Deng , Bibhas Chakraborty , Ran Chen , Yan Shuo Tan

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…

机器学习 · 统计学 2018-02-27 Carlos Riquelme , George Tucker , Jasper Snoek

We consider a Bayesian budgeted multi-armed bandit problem, in which each arm consumes a different amount of resources when selected and there is a budget constraint on the total amount of resources that can be used. Budgeted Thompson…

机器学习 · 计算机科学 2024-08-29 Woojin Jeong , Seungki Min

How to explore efficiently is a central problem in multi-armed bandits. In this paper, we introduce the metadata-based multi-task bandit problem, where the agent needs to solve a large number of related multi-armed bandit tasks and can…

机器学习 · 计算机科学 2021-08-17 Runzhe Wan , Lin Ge , Rui Song

Multi-task learning in contextual bandits has attracted significant research interest due to its potential to enhance decision-making across multiple related tasks by leveraging shared structures and task-specific heterogeneity. In this…

机器学习 · 计算机科学 2025-11-07 Xia Jiang , Rong J. B. Zhu

We address the problem of online sequential decision making, i.e., balancing the trade-off between exploiting the current knowledge to maximize immediate performance and exploring the new information to gain long-term benefits using the…

机器学习 · 计算机科学 2022-09-20 Kartik Anand Pant , Amod Hegde , K. V. Srinivas

In mobile health (mHealth) smart devices deliver behavioral treatments repeatedly over time to a user with the goal of helping the user adopt and maintain healthy behaviors. Reinforcement learning appears ideal for learning how to optimally…

机器学习 · 计算机科学 2020-12-15 Sabina Tomkins , Peng Liao , Predrag Klasnja , Susan Murphy

We study a decentralized cooperative multi-agent multi-armed bandit problem with $K$ arms and $N$ agents connected over a network. In our model, each arm's reward distribution is same for all agents, and rewards are drawn independently…

机器学习 · 统计学 2020-10-29 Anusha Lalitha , Andrea Goldsmith

Recent advances in contextual bandit optimization and reinforcement learning have garnered interest in applying these methods to real-world sequential decision making problems. Real-world applications frequently have constraints with…

机器学习 · 计算机科学 2019-11-05 Samuel Daulton , Shaun Singh , Vashist Avadhanula , Drew Dimmery , Eytan Bakshy

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…

机器学习 · 统计学 2020-08-07 Zhendong Wang , Mingyuan Zhou

Thompson sampling (TS) is widely used in sequential decision making due to its ease of use and appealing empirical performance. However, many existing analytical and empirical results for TS rely on restrictive assumptions on reward…

机器学习 · 计算机科学 2023-06-16 Amin Karbasi , Nikki Lijing Kuang , Yi-An Ma , Siddharth Mitra

Thompson Sampling provides an efficient technique to introduce prior knowledge in the multi-armed bandit problem, along with providing remarkable empirical performance. In this paper, we revisit the Thompson Sampling algorithm under rewards…

机器学习 · 计算机科学 2019-12-09 Abhimanyu Dubey , Alex Pentland

Reinforcement learning studies how to balance exploration and exploitation in real-world systems, optimizing interactions with the world while simultaneously learning how the world operates. One general class of algorithms for such learning…

机器学习 · 统计学 2018-08-10 Iñigo Urteaga , Chris H. Wiggins

This paper considers the use of a simple posterior sampling algorithm to balance between exploration and exploitation when learning to optimize actions such as in multi-armed bandit problems. The algorithm, also known as Thompson Sampling,…

机器学习 · 计算机科学 2014-02-04 Daniel Russo , Benjamin Van Roy

As two popular schools of machine learning, online learning and evolutionary computations have become two important driving forces behind real-world decision making engines for applications in biomedicine, economics, and engineering fields.…

神经与进化计算 · 计算机科学 2022-05-24 Baihan Lin

In algorithm optimization in reinforcement learning, how to deal with the exploration-exploitation dilemma is particularly important. Multi-armed bandit problem can optimize the proposed solutions by changing the reward distribution to…

机器学习 · 统计学 2022-03-28 Zhendong Shi , Ercan E. Kuruoglu , Xiaoli Wei

The long runtime associated with simulating multidisciplinary systems challenges the use of Bayesian optimization for multidisciplinary design optimization (MDO). This is particularly the case if the coupled system is modeled in a…

计算工程、金融与科学 · 计算机科学 2024-08-19 Susanna Baars , Jigar Parekh , Ihar Antonau , Philipp Bekemeyer , Ulrich Römer
‹ 上一页 1 2 3 10 下一页 ›