Results 21 to 30 of about 497,803 (209)
Contextual bandit algorithms are at the core of many applications, including recommender systems, clinical trials, and optimal portfolio selection. One of the most popular problems studied in the contextual bandit literature is to maximize the sum of the rewards in each round by ensuring a sublinear regret against the best-fixed context-dependent ...
Siddhant Chaudhary, Abhishek Sinha
openaire +3 more sources
Treatment effect optimisation in dynamic environments
Applying causal methods to fields such as healthcare, marketing, and economics receives increasing interest. In particular, optimising the individual-treatment-effect – often referred to as uplift modelling – has peaked in areas such as precision ...
Berrevoets Jeroen +2 more
doaj +1 more source
Contextual Bandit-Based Amplifier IBO Optimization in Massive MIMO Network
Massive Multiple-Input Multiple-Output (MMIMO) is one of the 5G key enablers. Though, most of the works consider MMIMO under assumptions of ideal hardware. It has been shown that Power Amplifiers (PAs) introduce nonlinear distortion while operating close
Marcin Hoffmann, Pawel Kryszkiewicz
doaj +1 more source
We consider the problem of learning to choose actions using contextual information when provided with limited feedback in the form of relative pairwise comparisons. We study this problem in the dueling-bandits framework of Yue et al. (2009), which we extend to incorporate context.
Miroslav Dudík +4 more
openaire +4 more sources
Regularized Contextual Bandits
AISTATS 2019, 23 pages, 2 ...
Xavier Fontaine +2 more
openaire +5 more sources
Robust Contextual Linear Bandits
Model misspecification is a major consideration in applications of statistical methods and machine learning. However, it is often neglected in contextual bandits. This paper studies a common form of misspecification, an inter-arm heterogeneity that is not captured by context.
Rong Zhu, Branislav Kveton
openaire +3 more sources
Resourceful Contextual Bandits
This is the full version of a paper in COLT 2014. Version history: (v2) Added some details to one of the proofs, (v3) a big revision following comments from COLT reviewers (but no new results), (v4) edits in related work, minor edits elsewhere. (v6) A correction for Theorem 3, corollary for contextual dynamic pricing with discretization; updated follow-
Ashwinkumar Badanidiyuru +2 more
openaire +3 more sources
Contextual Bandits is one of the widely popular techniques used in applications such as personalization, recommendation systems, mobile health, causal marketing etc . As a dynamic approach, it can be more efficient than standard A/B testing in minimizing regret.
Praneet Dutta +3 more
openaire +2 more sources
Adapting to Misspecification in Contextual Bandits
Appeared at NeurIPS ...
Dylan J. Foster +3 more
openaire +4 more sources
Optimizing Neural Spike Train Prediction Using Contextual Bandit Algorithms Within Dqn Frameworks [PDF]
This study addresses key challenges in applying Deep Q-Networks (DQN) to neural spike train prediction by introducing a novel Contextual Bandit-enhanced DQN (CB-DQN) approach.
Feng Xingzhe
doaj +1 more source

