ResearchTrend.AI
Regret Bounds for Generalized Linear Bandits under Parameter Drift

Regret Bounds for Generalized Linear Bandits under Parameter Drift

Louis Faury
Yoan Russac
Marc Abeille
Clément Calauzènes
ArXiv (abs)PDFHTML

Papers citing "Regret Bounds for Generalized Linear Bandits under Parameter Drift"

3 / 3 papers shown
Title
Right Now, Wrong Then: Non-Stationary Direct Preference Optimization under Preference Drift
Right Now, Wrong Then: Non-Stationary Direct Preference Optimization under Preference Drift
Seongho Son
William Bankes
Sayak Ray Chowdhury
Brooks Paige
Ilija Bogunovic
131
4
0
26 Jul 2024
BOF-UCB: A Bayesian-Optimistic Frequentist Algorithm for Non-Stationary Contextual Bandits
BOF-UCB: A Bayesian-Optimistic Frequentist Algorithm for Non-Stationary Contextual Bandits
Nicklas Werge
Abdullah Akgul
M. Kandemir
88
0
0
07 Jul 2023
Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approach
Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approach
Chen-Yu Wei
Haipeng Luo
OffRL
187
107
0
10 Feb 2021

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.