ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits

25 October 2022

Papers citing "ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits"

8 / 8 papers shown

Title
Tracking Most Significant Shifts in Infinite-Armed Bandits Joe Suk Jung-hun Kim 48 0 0 31 Jan 2025
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 33 0 0 01 Oct 2023
When Can We Track Significant Preference Shifts in Dueling Bandits? Joe Suk Arpit Agarwal 8 3 0 13 Feb 2023
Non-Stationary Dueling Bandits Patrick Kolpaczki Viktor Bengs Eyke Hüllermeier 16 7 0 02 Feb 2022
Algorithms for Non-Stationary Generalized Linear Bandits Yoan Russac Olivier Cappé Aurélien Garivier 30 23 0 23 Mar 2020
Weighted Linear Bandits for Non-Stationary Environments Yoan Russac Claire Vernade Olivier Cappé 77 101 0 19 Sep 2019