中文
相关论文

相关论文: Design Principles of Robust Multi-Armed Bandit Fra…

200 篇论文

In a typical stochastic multi-armed bandit problem, the objective is often to maximize the expected sum of rewards over some time horizon $T$. While the choice of a strategy that accomplishes that is optimal with no additional information,…

机器学习 · 计算机科学 2023-11-01 Reda Alami , Mohammed Mahfoud , Mastane Achab

Federated Recommendation Systems (FRS) enable privacy-preserving model training by keeping user data on edge devices. However, the practical deployment of FRS in Edge-Cloud environments faces significant challenges due to system and…

分布式、并行与集群计算 · 计算机科学 2026-05-26 Jintao Liu , Mohammad Goudarzi , Adel Nadjaran Toosi

Multi-arm bandits are gaining popularity as they enable real-world sequential decision-making across application areas, including clinical trials, recommender systems, and online decision-making. Consequently, there is an increased desire…

统计方法学 · 统计学 2023-03-01 Dae Woong Ham , Iavor Bojinov , Michael Lindon , Martin Tingley

Online healthcare communities provide users with various healthcare interventions to promote healthy behavior and improve adherence. When faced with too many intervention choices, however, individuals may find it difficult to decide which…

机器学习 · 计算机科学 2020-09-15 Tongxin Zhou , Yingfei Wang , Lu , Yan , Yong Tan

Online decision-making can be formulated as the popular stochastic multi-armed bandit problem where a learner makes decisions (or takes actions) to maximize cumulative rewards collected from an unknown environment. This paper proposes to…

系统与控制 · 电气工程与系统科学 2025-11-26 Jonathan Gornet , Mehdi Hosseinzadeh , Bruno Sinopoli

Online learning in large-scale structured bandits is known to be challenging due to the curse of dimensionality. In this paper, we propose a unified meta-learning framework for a general class of structured bandit problems where the…

机器学习 · 计算机科学 2022-03-01 Runzhe Wan , Lin Ge , Rui Song

Personalization is pervasive in the online space as it leads to higher efficiency and revenue by allowing the most relevant content to be served to each user. However, recent studies suggest that personalization methods can propagate…

机器学习 · 计算机科学 2018-02-26 L. Elisa Celis , Sayash Kapoor , Farnood Salehi , Nisheeth K. Vishnoi

Bandit algorithms are widely used in sequential decision problems to maximize the cumulative reward. One potential application is mobile health, where the goal is to promote the user's health through personalized interventions based on user…

机器学习 · 统计学 2022-08-23 Gi-Soo Kim , Hyun-Joon Yang , Jane P. Kim

The bandit paradigm provides a unified modeling framework for problems that require decision-making under uncertainty. Because many business metrics can be viewed as rewards (a.k.a. utilities) that result from actions, bandit algorithms…

机器学习 · 计算机科学 2023-02-03 Bram van den Akker , Olivier Jeunen , Ying Li , Ben London , Zahra Nazari , Devesh Parekh

Recommender systems relying on contextual multi-armed bandits continuously improve relevant item recommendations by taking into account the contextual information. The objective of bandit algorithms is to learn the best arm (e.g., best item…

机器学习 · 计算机科学 2025-12-10 Ahmed Sayeed Faruk , Elena Zheleva

In real-world streaming recommender systems, user preferences often dynamically change over time (e.g., a user may have different preferences during weekdays and weekends). Existing bandit-based streaming recommendation models only consider…

信息检索 · 计算机科学 2023-08-17 Chenglei Shen , Xiao Zhang , Wei Wei , Jun Xu

Contextual Multi-Armed Bandits is a well-known and accepted online optimization algorithm, that is used in many Web experiences to tailor content or presentation to users' traffic. Much has been published on theoretical guarantees (e.g.…

信息检索 · 计算机科学 2019-07-12 David Abensur , Ivan Balashov , Shaked Bar , Ronny Lempel , Nurit Moscovici , Ilan Orlov , Danny Rosenstein , Ido Tamir

We study a strategic variant of the multi-armed bandit problem, which we coin the strategic click-bandit. This model is motivated by applications in online recommendation where the choice of recommended items depends on both the…

机器学习 · 计算机科学 2023-11-28 Thomas Kleine Buening , Aadirupa Saha , Christos Dimitrakakis , Haifeng Xu

The recent advances of conversational recommendations provide a promising way to efficiently elicit users' preferences via conversational interactions. To achieve this, the recommender system conducts conversations with users, asking their…

信息检索 · 计算机科学 2022-09-14 Jinhang Zuo , Songwen Hu , Tong Yu , Shuai Li , Handong Zhao , Carlee Joe-Wong

This paper introduces a general framework for risk-sensitive bandits that integrates the notions of risk-sensitive objectives by adopting a rich class of distortion riskmetrics. The introduced framework subsumes the various existing…

机器学习 · 统计学 2025-03-13 Meltem Tatlı , Arpan Mukherjee , Prashanth L. A. , Karthikeyan Shanmugam , Ali Tajer

Deep Reinforcement Learning has been shown to be very successful in complex games, e.g. Atari or Go. These games have clearly defined rules, and hence allow simulation. In many practical applications, however, interactions with the…

机器学习 · 计算机科学 2019-02-12 Andreas Merentitis , Kashif Rasul , Roland Vollgraf , Abdul-Saboor Sheikh , Urs Bergmann

Contextual bandit algorithms have become widely used for recommendation in online systems (e.g. marketplaces, music streaming, news), where they now wield substantial influence on which items get exposed to the users. This raises questions…

机器学习 · 计算机科学 2021-09-14 Lequn Wang , Yiwei Bai , Wen Sun , Thorsten Joachims

Conversational recommendation systems elicit user preferences by interacting with users to obtain their feedback on recommended commodities. Such systems utilize a multi-armed bandit framework to learn user preferences in an online manner…

机器学习 · 计算机科学 2024-07-29 Shuhua Yang , Hui Yuan , Xiaoying Zhang , Mengdi Wang , Hong Zhang , Huazheng Wang

In many digital contexts such as online news and e-tailing with many new users and items, recommendation systems face several challenges: i) how to make initial recommendations to users with little or no response history (i.e., cold-start…

信息检索 · 计算机科学 2023-02-28 Boya Xu , Yiting Deng , Carl Mela

Psychological research shows that enjoyment of many goods is subject to satiation, with short-term satisfaction declining after repeated exposures to the same item. Nevertheless, proposed algorithms for powering recommender systems seldom…

机器学习 · 计算机科学 2021-10-28 Liu Leqi , Fatma Kilinc-Karzan , Zachary C. Lipton , Alan L. Montgomery