conftrace_

dueling bandit

57 papers

Explore in graph

Also known as

DB

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) preference learning (418) pairwise comparison (187) condorcet winner (12) bandit algorithm (108) sample complexity (1169) online algorithm (445) regret minimization (315)

Papers

Dueling Bandits with Adversarial Sleeping NIPS 2021
Adversarial Dueling Bandits ICML 2021
Bias-Robust Bayesian Optimization via Dueling Bandits ICML 2021
Stochastic Dueling Bandits with Adversarial Corruption ALT 2021
Testification of Condorcet Winners in dueling bandits UAI 2021
Preference-based Reinforcement Learning with Finite-Time Guarantees NIPS 2020
Combinatorial Pure Exploration for Dueling Bandit ICML 2020
Thresholding Bandit Problem with Both Duels and Pulls AISTATS 2020
Zeroth Order Non-convex optimization with Dueling-Choice Bandits UAI 2020
Choice Bandits NIPS 2020
Dueling Bandits with Qualitative Feedback AAAI 2019
Advancements in Dueling Bandits IJCAI 2018
Factored Bandits NIPS 2018
Preference Based Adaptation for Learning Objectives NIPS 2018
Efficient Mechanisms for Peer Grading and Dueling Bandits ACML 2018
Regret Analysis for Continuous Dueling Bandit NIPS 2017
Correlational Dueling Bandits with Application to Clinical Treatment in Large Decision Spaces IJCAI 2017
Bandits Dueling on Partially Ordered Sets NIPS 2017
Dueling Bandits with Weak Regret ICML 2017
Dueling Bandits: Beyond Condorcet Winners to General Tournament Solutions NIPS 2016
Instance-dependent Regret Bounds for Dueling Bandits COLT 2016
Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm ICML 2016
Verification Based Solution for Structured MAB Problems NIPS 2016
Sparse Dueling Bandits AISTATS 2015
Copeland Dueling Bandits NIPS 2015