dueling bandit

Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits ICML 2022 Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Models ICML 2022 Versatile Dueling Bandits: Best-of-both World Analyses for Learning from Relative Preferences ICML 2022 Adversarial Dueling Bandits ICML 2021 Bias-Robust Bayesian Optimization via Dueling Bandits ICML 2021 Dueling Bandits with Adversarial Sleeping NeurIPS 2021 Dueling Bandits with Team Comparisons NeurIPS 2021 Identification of the Generalized Condorcet Winner in Multi-dueling Bandits NeurIPS 2021 Preference-based Online Learning with Dueling Bandits: A Survey JMLR 2021 Stochastic Dueling Bandits with Adversarial Corruption ALT 2021 Testification of Condorcet Winners in dueling bandits UAI 2021 Choice Bandits NeurIPS 2020 Combinatorial Pure Exploration for Dueling Bandit ICML 2020 Preference-based Reinforcement Learning with Finite-Time Guarantees NeurIPS 2020 Thresholding Bandit Problem with Both Duels and Pulls AISTATS 2020 Zeroth Order Non-convex optimization with Dueling-Choice Bandits UAI 2020 Dueling Bandits with Qualitative Feedback AAAI 2019 Advancements in Dueling Bandits IJCAI 2018 Efficient Mechanisms for Peer Grading and Dueling Bandits ACML 2018 Factored Bandits NeurIPS 2018 Preference Based Adaptation for Learning Objectives NeurIPS 2018 Bandits Dueling on Partially Ordered Sets NeurIPS 2017 Correlational Dueling Bandits with Application to Clinical Treatment in Large Decision Spaces IJCAI 2017 Dueling Bandits with Weak Regret ICML 2017 Regret Analysis for Continuous Dueling Bandit NeurIPS 2017