English
Related papers

Related papers: To update or not to update? Delayed Nonparametric …

200 papers

Sponsored search positions are typically allocated through real-time auctions, where the outcomes depend on advertisers' quality-adjusted bids - the product of their bids and quality scores. Although quality scoring helps promote ads with…

Computer Science and Game Theory · Computer Science 2025-09-01 Mohammad Rashid , Omid Rafieian , Soheil Ghili

The multi-armed bandit (MAB) problem is a classic example of the exploration-exploitation dilemma. It is concerned with maximising the total rewards for a gambler by sequentially pulling an arm from a multi-armed slot machine where each arm…

Machine Learning · Statistics 2018-05-16 Xue Lu , Niall Adams , Nikolas Kantas

Motivated by the fact that humans like some level of unpredictability or novelty, and might therefore get quickly bored when interacting with a stationary policy, we introduce a novel non-stationary bandit problem, where the expected reward…

Machine Learning · Computer Science 2022-03-08 Pierre Laforgue , Giulia Clerici , Nicolò Cesa-Bianchi , Ran Gilad-Bachrach

The celebrated multi-armed bandit problem in decision theory models the basic trade-off between exploration, or learning about the state of a system, and exploitation, or utilizing the system. In this paper we study the variant of the…

Data Structures and Algorithms · Computer Science 2013-06-19 Sudipto Guha , Kamesh Munagala

Multi-Armed Bandit (MAB) algorithms are widely used in recommender systems that require continuous, incremental learning. A core aspect of MABs is the exploration-exploitation trade-off: choosing between exploiting items likely to be…

Machine Learning · Computer Science 2026-04-20 Pedro R. Pires , Gregorio F. Azevedo , Pietro L. Campos , Rafael T. Sereicikas , Tiago A. Almeida

Reinforcement learning typically assumes that the state update from the previous actions happens instantaneously, and thus can be used for making future decisions. However, this may not always be true. When the state update is not…

Machine Learning · Computer Science 2021-02-23 Mridul Agarwal , Vaneet Aggarwal

We study the Improving Multi-Armed Bandit (IMAB) problem, where the reward obtained from an arm increases with the number of pulls it receives. This model provides an elegant abstraction for many real-world problems in domains such as…

Machine Learning · Computer Science 2022-08-22 Vishakha Patil , Vineet Nair , Ganesh Ghalme , Arindam Khan

We initiate the study of tradeoffs between exploration and exploitation in online learning of properties of quantum states. Given sequential oracle access to an unknown quantum state, in each round, we are tasked to choose an observable…

Quantum Physics · Physics 2022-06-29 Josep Lumbreras , Erkka Haapasalo , Marco Tomamichel

Recommendation systems when employed in markets play a dual role: they assist users in selecting their most desired items from a large pool and they help in allocating a limited number of items to the users who desire them the most. Despite…

Machine Learning · Computer Science 2022-08-01 Yigit Efe Erginbas , Soham Phade , Kannan Ramchandran

Stochastic delays in feedback lead to unstable sequential learning using multi-armed bandits. Recently, empirical Bayesian shrinkage has been shown to improve reward estimation in bandit learning. Here, we propose a novel adaptation to…

Machine Learning · Computer Science 2021-06-23 Srivas Chennu , Jamie Martin , Puli Liyanagama , Phil Mohr

Sequential experiments are often characterized by an exploration-exploitation tradeoff that is captured by the multi-armed bandit (MAB) framework. This framework has been studied and applied, typically when at each time period feedback is…

Machine Learning · Computer Science 2020-12-22 Yonatan Gur , Ahmadreza Momeni

There is a rising interest in industrial online applications where data becomes available sequentially. Inspired by the recommendation of playlists to users where their preferences can be collected during the listening of the entire…

Machine Learning · Computer Science 2022-06-02 Giulia Romano , Andrea Agostini , Francesco Trovò , Nicola Gatti , Marcello Restelli

We study two-sided matching markets in which one side of the market (the players) does not have a priori knowledge about its preferences for the other side (the arms) and is required to learn its preferences from experience. Also, we assume…

Machine Learning · Computer Science 2021-06-23 Lydia T. Liu , Feng Ruan , Horia Mania , Michael I. Jordan

Proper balance between exploitation and exploration is what makes good decisions, which achieve high rewards like payoff or evolutionary fitness. The Infomax principle postulates that maximization of information directs the function of…

Machine Learning · Computer Science 2016-05-25 Gautam Reddy , Antonio Celani , Massimo Vergassola

We study nonstochastic bandits and experts in a delayed setting where delays depend on both time and arms. While the setting in which delays only depend on time has been extensively studied, the arm-dependent delay setting better captures…

Machine Learning · Computer Science 2021-12-22 Dirk van der Hoeven , Nicolò Cesa-Bianchi

Evolutionary game theory has been widely used to study the evolution of cooperation in social dilemmas where imitation-led strategy updates are typically assumed. However, results of recent behavioral experiments are not compatible with the…

Physics and Society · Physics 2018-12-19 Ik Soo Lim , Peter Wittek

Standard approaches to decision-making under uncertainty focus on sequential exploration of the space of decisions. However, \textit{simultaneously} proposing a batch of decisions, which leverages available resources for parallel…

Machine Learning · Statistics 2023-02-07 Jeffrey Chan , Aldo Pacchiano , Nilesh Tripuraneni , Yun S. Song , Peter Bartlett , Michael I. Jordan

We consider a bandit problem where at any time, the decision maker can add new arms to her consideration set. A new arm is queried at a cost from an "arm-reservoir" containing finitely many "arm-types," each characterized by a distinct mean…

Machine Learning · Computer Science 2022-10-10 Anand Kalvit , Assaf Zeevi

Autonomous exploration in mobile robotics often involves a trade-off between two objectives: maximizing environmental coverage and minimizing the total path length. In the widely used information gain paradigm, exploration is guided by the…

Robotics · Computer Science 2025-04-22 Ludvig Ericson , José Pedro , Patric Jensfelt

Modern recommendation systems ought to benefit by probing for and learning from delayed feedback. Research has tended to focus on learning from a user's response to a single recommendation. Such work, which leverages methods of supervised…

Information Retrieval · Computer Science 2023-08-01 Zheqing Zhu , Benjamin Van Roy
‹ Prev 1 3 4 5 6 7 10 Next ›