Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits

6 November 2021

Papers citing "Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits"

7 / 7 papers shown

Title
DP-Dueling: Learning from Preference Feedback without Compromising User Privacy Aadirupa Saha Hilal Asi 36 1 0 22 Mar 2024
Think Before You Duel: Understanding Complexities of Preference Learning under Constrained Resources Rohan Deb Aadirupa Saha 25 0 0 28 Dec 2023
Identifying Copeland Winners in Dueling Bandits with Indifferences Viktor Bengs Björn Haddenhorst Eyke Hüllermeier 38 0 0 01 Oct 2023
When Can We Track Significant Preference Shifts in Dueling Bandits? Joe Suk Arpit Agarwal 10 3 0 13 Feb 2023
ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits Thomas Kleine Buening Aadirupa Saha 38 6 0 25 Oct 2022
Versatile Dueling Bandits: Best-of-both-World Analyses for Online Learning from Preferences Aadirupa Saha Pierre Gaillard 28 8 0 14 Feb 2022
Non-Stationary Dueling Bandits Patrick Kolpaczki Viktor Bengs Eyke Hüllermeier 30 7 0 02 Feb 2022