English
Related papers

Related papers: An Opportunistic Bandit Approach for User Interfac…

200 papers

Most online platforms strive to learn from interactions with users, and many engage in exploration: making potentially suboptimal choices for the sake of acquiring new information. We study the interplay between exploration and competition:…

Computer Science and Game Theory · Computer Science 2024-10-15 Guy Aridor , Yishay Mansour , Aleksandrs Slivkins , Zhiwei Steven Wu

Most modern systems strive to learn from interactions with users, and many engage in exploration: making potentially suboptimal choices for the sake of acquiring new information. We initiate a study of the interplay between exploration and…

Computer Science and Game Theory · Computer Science 2017-11-21 Yishay Mansour , Aleksandrs Slivkins , Zhiwei Steven Wu

We empirically study the interplay between exploration and competition. Systems that learn from interactions with users often engage in exploration: making potentially suboptimal decisions in order to acquire new information for future…

Computer Science and Game Theory · Computer Science 2019-05-03 Guy Aridor , Kevin Liu , Aleksandrs Slivkins , Zhiwei Steven Wu

We propose a contextual bandit based model to capture the learning and social welfare goals of a web platform in the presence of myopic users. By using payments to incentivize these agents to explore different items/recommendations, we show…

Machine Learning · Computer Science 2020-01-23 Priyank Agrawal , Theja Tulabandhula

In this paper, we propose and study opportunistic contextual bandits - a special case of contextual bandits where the exploration cost varies under different environmental conditions, such as network load or return variation in…

Machine Learning · Computer Science 2019-05-29 Xueying Guo , Xiaoxiao Wang , Xin Liu

In this paper, we propose and study opportunistic bandits - a new variant of bandits where the regret of pulling a suboptimal arm varies under different environmental conditions, such as network load or produce price. When the load/price is…

Machine Learning · Computer Science 2018-12-03 Huasen Wu , Xueying Guo , Xin Liu

Exploration is often necessary in online learning to maximize long-term reward, but it comes at the cost of short-term 'regret'. We study how this cost of exploration is shared across multiple groups. For example, in a clinical trial…

Machine Learning · Computer Science 2022-07-11 Jackie Baek , Vivek F. Farias

Contextual bandits have become an increasingly popular solution for personalized recommender systems. Despite their growing use, the interpretability of these systems remains a significant challenge, particularly for the often non-expert…

Machine Learning · Computer Science 2024-09-24 Andrew Maher , Matia Gobbo , Lancelot Lachartre , Subash Prabanantham , Rowan Swiers , Puli Liyanagama

Recommender systems trained in a continuous learning fashion are plagued by the feedback loop problem, also known as algorithmic bias. This causes a newly trained model to act greedily and favor items that have already been engaged by…

Machine Learning · Computer Science 2020-08-04 Dalin Guo , Sofia Ira Ktena , Ferenc Huszar , Pranay Kumar Myana , Wenzhe Shi , Alykhan Tejani

In this work, we study sequential choice bandits with feedback. We propose bandit algorithms for a platform that personalizes users' experience to maximize its rewards. For each action directed to a given user, the platform is given a…

Machine Learning · Statistics 2021-01-06 Anshuka Rangi , Massimo Franceschetti , Long Tran-Thanh

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…

Machine Learning · Computer Science 2023-02-03 Bram van den Akker , Olivier Jeunen , Ying Li , Ben London , Zahra Nazari , Devesh Parekh

Adaptive and sequential experiment design is a well-studied area in numerous domains. We survey and synthesize the work of the online statistical learning paradigm referred to as multi-armed bandits integrating the existing research as a…

Machine Learning · Statistics 2015-11-04 Giuseppe Burtini , Jason Loeppky , Ramon Lawrence

Collaborative bandit learning, i.e., bandit algorithms that utilize collaborative filtering techniques to improve sample efficiency in online interactive recommendation, has attracted much research attention as it enjoys the best of both…

Machine Learning · Computer Science 2021-04-16 Chuanhao Li , Qingyun Wu , Hongning Wang

Customer loyalty is crucial for internet services since retaining users of a service to ensure the staying time of the service is of significance for increasing revenue. It demands the retention of customers to be high enough to meet the…

Social and Information Networks · Computer Science 2017-10-20 Junhua Chen , Wei Zeng , Ge Fan , Junmin Shao

Key challenges in running a retail business include how to select products to present to consumers (the assortment problem), and how to price products (the pricing problem) to maximize revenue or profit. Instead of considering these…

Machine Learning · Statistics 2023-09-19 Junhui Cai , Ran Chen , Martin J. Wainwright , Linda Zhao

In retail, there are predictable yet dramatic time-dependent patterns in customer behavior, such as periodic changes in the number of visitors, or increases in customers just before major holidays. The current paradigm of multi-armed bandit…

Machine Learning · Statistics 2021-02-16 Stefano Tracà , Cynthia Rudin , Weiyu Yan

Contextual bandits are widely used in industrial personalization systems. These online learning frameworks learn a treatment assignment policy in the presence of treatment effects that vary with the observed contextual features of the…

Machine Learning · Computer Science 2022-05-11 Claudia Roberts , Maria Dimakopoulou , Qifeng Qiao , Ashok Chandrashekhar , Tony Jebara

The rich body of Bandit literature not only offers a diverse toolbox of algorithms, but also makes it hard for a practitioner to find the right solution to solve the problem at hand. Typical textbooks on Bandits focus on designing and…

Machine Learning · Computer Science 2021-07-05 Yi Liu , Lihong Li

Selecting the optimal recommender via online exploration-exploitation is catching increasing attention where the traditional A/B testing can be slow and costly, and offline evaluations are prone to the bias of history data. Finding the…

Information Retrieval · Computer Science 2022-03-29 Da Xu , Chuanwei Ruan , Evren Korpeoglu , Sushant Kumar , Kannan Achan

The design of personalized incentives or recommendations to improve user engagement is gaining prominence as digital platform providers continually emerge. We propose a multi-armed bandit framework for matching incentives to users, whose…

Machine Learning · Computer Science 2018-07-09 Tanner Fiez , Shreyas Sekar , Liyuan Zheng , Lillian J. Ratliff
‹ Prev 1 2 3 10 Next ›