ResearchTrend.AI
Nonstationary Stochastic Multiarmed Bandits: UCB Policies and Minimax Regret

Nonstationary Stochastic Multiarmed Bandits: UCB Policies and Minimax Regret

Lai Wei
Vaibhav Srivastava
ArXiv (abs)PDFHTML

Papers citing "Nonstationary Stochastic Multiarmed Bandits: UCB Policies and Minimax Regret"

6 / 6 papers shown
Title
Maximizing Success Rate of Payment Routing using Non-stationary Bandits
Maximizing Success Rate of Payment Routing using Non-stationary Bandits
A. Chaudhary
Abhinav Rai
Abhishek Gupta
18
2
0
02 Aug 2023
Improving Few-Shot Generalization by Exploring and Exploiting Auxiliary Data
Improving Few-Shot Generalization by Exploring and Exploiting Auxiliary Data
Alon Albalak
Colin Raffel
William Yang Wang
89
12
0
01 Feb 2023
Preference-Learning Emitters for Mixed-Initiative Quality-Diversity Algorithms
Preference-Learning Emitters for Mixed-Initiative Quality-Diversity Algorithms
R. Gallotta
Kai Arulkumaran
Lisa Soros
65
5
0
25 Oct 2022
Representation Learning for Context-Dependent Decision-Making
Representation Learning for Context-Dependent Decision-Making
Yuzhen Qin
Tommaso Menara
Samet Oymak
ShiNung Ching
Fabio Pasqualetti
57
3
0
12 May 2022
Stochastic Multi-armed Bandits with Non-stationary Rewards Generated by a Linear Dynamical System
Stochastic Multi-armed Bandits with Non-stationary Rewards Generated by a Linear Dynamical System
J. Gornet
M. Hosseinzadeh
Bruno Sinopoli
41
7
0
06 Apr 2022
Non-Stationary Representation Learning in Sequential Linear Bandits
Non-Stationary Representation Learning in Sequential Linear Bandits
Yuzhen Qin
Tommaso Menara
Samet Oymak
ShiNung Ching
Fabio Pasqualetti
OffRL
61
17
0
13 Jan 2022

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.