English
Related papers

Related papers: Stochastic Bandit Models for Delayed Conversions

200 papers

In a recent work, Laforgue et al. introduce the model of last switch dependent (LSD) bandits, in an attempt to capture nonstationary phenomena induced by the interaction between the player and the environment. Examples include satiation,…

Machine Learning · Computer Science 2023-06-02 Ayoub Foussoul , Vineet Goyal , Orestis Papadigenopoulos , Assaf Zeevi

Non-stationary multi-armed bandits enable agents to adapt to changing environments by incorporating mechanisms to detect and respond to shifts in reward distributions, making them well-suited for dynamic settings. However, existing…

Machine Learning · Computer Science 2025-09-19 Shaoang Li , Jian Li

Interactive recommender systems that enable the interactions between users and the recommender system have attracted increasing research attentions. Previous methods mainly focus on optimizing recommendation accuracy. However, they usually…

Information Retrieval · Computer Science 2019-07-04 Yong Liu , Yingtai Xiao , Qiong Wu , Chunyan Miao , Juyong Zhang

We consider a novel variant of the contextual bandit problem (i.e., the multi-armed bandit with side-information, or context, available to a decision-maker) where the reward associated with each context-based decision may not always be…

Machine Learning · Computer Science 2020-07-21 Djallel Bouneffouf , Sohini Upadhyay , Yasaman Khazaeni

The multi-armed bandit (MAB) models have attracted significant research attention due to their applicability and effectiveness in various real-world scenarios such as resource allocation, online advertising, and dynamic pricing. As an…

Machine Learning · Computer Science 2024-02-13 Yandi Li , Jianxiong Guo , Yupeng Li , Tian Wang , Weijia Jia

We consider a sequential decision-making problem where an agent can take one action at a time and each action has a stochastic temporal extent, i.e., a new action cannot be taken until the previous one is finished. Upon completion, the…

Machine Learning · Computer Science 2020-03-26 P Sharoff , Nishant A. Mehta , Ravi Ganti

In this paper we initiate the study of optimization of bandit type problems in scenarios where the feedback of a play is not immediately known. This arises naturally in allocation problems which have been studied extensively in the…

Data Structures and Algorithms · Computer Science 2015-03-17 Sudipto Guha , Kamesh Munagala , Martin Pal

We study a distributed stochastic multi-armed bandit where a client supplies the learner with communication-constrained feedback based on the rewards for the corresponding arm pulls. In our setup, the client must encode the rewards such…

Machine Learning · Computer Science 2023-06-07 Prathamesh Mayekar , Jonathan Scarlett , Vincent Y. F. Tan

The goal of online display advertising is to entice users to "convert" (i.e., take a pre-defined action such as making a purchase) after clicking on the ad. An important measure of the value of an ad is the probability of conversion. The…

Machine Learning · Statistics 2017-10-25 Abdollah Safari , Rachel MacKay Altman , Thomas M. Loughin

Contextual bandits are incredibly useful in many practical problems. We go one step further by devising a more realistic problem that combines: (1) contextual bandits with dense arm features, (2) non-linear reward functions, and (3) a…

Machine Learning · Computer Science 2026-03-18 Wei Min Loh , Sajib Kumer Sinha , Ankur Agarwal , Pascal Poupart

In a conventional contextual multi-armed bandit problem, the feedback (or reward) is immediately observable after an action. Nevertheless, delayed feedback arises in numerous real-life situations and is particularly crucial in…

Machine Learning · Computer Science 2024-05-21 Kweiguu Liu , Setareh Maghsudi

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…

Methodology · Statistics 2023-03-01 Dae Woong Ham , Iavor Bojinov , Michael Lindon , Martin Tingley

For sponsored search auctions, we consider contextual multi-armed bandit problem in the presence of strategic agents. In this setting, at each round, an advertising platform (center) runs an auction to select the best-suited ads relevant to…

Computer Science and Game Theory · Computer Science 2020-02-27 Kumar Abhishek , Shweta Jain , Sujit Gujar

A search engine usually outputs a list of $K$ web pages. The user examines this list, from the first web page to the last, and chooses the first attractive page. This model of user behavior is known as the cascade model. In this paper, we…

Machine Learning · Computer Science 2015-05-19 Branislav Kveton , Csaba Szepesvari , Zheng Wen , Azin Ashkan

Companies like Google and Microsoft run billions of auctions every day to sell advertising opportunities. Any change to the rules of these auctions can have a tremendous effect on the revenue of the company and the welfare of the…

Computer Science and Game Theory · Computer Science 2019-11-07 Saeed Alaei , Ashwinkumar Badanidiyuru , Mohammad Mahdian , Sadra Yazdanbod

In the multiarmed bandit problem a gambler chooses an arm of a slot machine to pull considering a tradeoff between exploration and exploitation. We study the stochastic bandit problem where each arm has a reward distribution supported in a…

Statistics Theory · Mathematics 2013-03-29 Junya Honda , Akimichi Takemura

We study the problem of an online advertising system that wants to optimally spend an advertiser's given budget for a campaign across multiple platforms, without knowing the value for showing an ad to the users on those platforms. We model…

Computer Science and Game Theory · Computer Science 2021-03-26 Vashist Avadhanula , Riccardo Colini-Baldeschi , Stefano Leonardi , Karthik Abinav Sankararaman , Okke Schrijvers

Recommendation systems are dynamic economic systems that balance the needs of multiple stakeholders. A recent line of work studies incentives from the content providers' point of view. Content providers, e.g., vloggers and bloggers,…

Machine Learning · Computer Science 2023-11-13 Omer Ben-Porat , Rotem Torkan

Motivated by applications such as online labor markets we consider a variant of the stochastic multi-armed bandit problem where we have a collection of arms representing strategic agents with different performance characteristics. The…

Computer Science and Game Theory · Computer Science 2025-03-11 Seyed A. Esmaeili , Suho Shin , Aleksandrs Slivkins

We consider a general online resource allocation model with bandit feedback and time-varying demands. While online resource allocation has been well studied in the literature, most existing works make the strong assumption that the demand…

Machine Learning · Computer Science 2023-06-13 Lixing Lyu , Wang Chi Cheung