ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1502.00133
  4. Cited By
Sparse Dueling Bandits

Sparse Dueling Bandits

31 January 2015
Kevin Jamieson
S. Katariya
Atul Deshpande
Robert D. Nowak
ArXiv (abs)PDFHTML

Papers citing "Sparse Dueling Bandits"

42 / 42 papers shown
Preference-based Reinforcement Learning beyond Pairwise Comparisons: Benefits of Multiple Options
Preference-based Reinforcement Learning beyond Pairwise Comparisons: Benefits of Multiple Options
Joongkyu Lee
Seouh-won Yi
Min-hwan Oh
OffRL
238
0
0
21 Oct 2025
Clustering Items through Bandit Feedback: Finding the Right Feature out of Many
Clustering Items through Bandit Feedback: Finding the Right Feature out of Many
Maximilian Graf
Victor Thuot
Nicolas Verzélen
325
1
0
14 Mar 2025
QuACK: A Multipurpose Queuing Algorithm for Cooperative $k$-Armed
  Bandits
QuACK: A Multipurpose Queuing Algorithm for Cooperative kkk-Armed BanditsInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2024
Benjamin Howson
Sarah Filippi
Ciara Pike-Burke
350
2
0
31 Oct 2024
Biased Dueling Bandits with Stochastic Delayed Feedback
Biased Dueling Bandits with Stochastic Delayed Feedback
Bongsoo Yi
Yue Kang
Yao Li
454
3
0
26 Aug 2024
Adversarial Multi-dueling Bandits
Adversarial Multi-dueling Bandits
Pratik Gajane
243
1
0
18 Jun 2024
Multi-Player Approaches for Dueling Bandits
Multi-Player Approaches for Dueling Bandits
Or Raveh
Junya Honda
Masashi Sugiyama
431
1
0
25 May 2024
Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
Qiwei Di
Jiafan He
Quanquan Gu
517
5
0
16 Apr 2024
Feel-Good Thompson Sampling for Contextual Dueling Bandits
Feel-Good Thompson Sampling for Contextual Dueling Bandits
Xuheng Li
Heyang Zhao
Quanquan Gu
263
17
0
09 Apr 2024
Reinforcement Learning from Human Feedback with Active Queries
Reinforcement Learning from Human Feedback with Active Queries
Kaixuan Ji
Jiafan He
Quanquan Gu
527
40
0
14 Feb 2024
Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
Variance-Aware Regret Bounds for Stochastic Contextual Dueling BanditsInternational Conference on Learning Representations (ICLR), 2023
Qiwei Di
Tao Jin
Yue Wu
Heyang Zhao
Farzad Farnoud
Quanquan Gu
311
20
0
02 Oct 2023
Active Ranking of Experts Based on their Performances in Many Tasks
Active Ranking of Experts Based on their Performances in Many TasksInternational Conference on Machine Learning (ICML), 2023
E. Saad
Nicolas Verzélen
Alexandra Carpentier
185
7
0
05 Jun 2023
Borda Regret Minimization for Generalized Linear Dueling Bandits
Borda Regret Minimization for Generalized Linear Dueling BanditsInternational Conference on Machine Learning (ICML), 2023
Yue Wu
Tao Jin
Hao Lou
Farzad Farnoud
Quanquan Gu
413
16
0
15 Mar 2023
When Can We Track Significant Preference Shifts in Dueling Bandits?
When Can We Track Significant Preference Shifts in Dueling Bandits?Neural Information Processing Systems (NeurIPS), 2023
Joe Suk
Arpit Agarwal
534
5
0
13 Feb 2023
Dueling Convex Optimization with General Preferences
Dueling Convex Optimization with General Preferences
Aadirupa Saha
Tomer Koren
Yishay Mansour
223
6
0
27 Sep 2022
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit
  Problem
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit ProblemNeural Information Processing Systems (NeurIPS), 2022
Arpit Agarwal
R. Ghuge
V. Nagarajan
289
2
0
25 Sep 2022
Batched Dueling Bandits
Batched Dueling BanditsInternational Conference on Machine Learning (ICML), 2022
Arpit Agarwal
R. Ghuge
V. Nagarajan
420
12
0
22 Feb 2022
Versatile Dueling Bandits: Best-of-both-World Analyses for Online
  Learning from Preferences
Versatile Dueling Bandits: Best-of-both-World Analyses for Online Learning from Preferences
Aadirupa Saha
Pierre Gaillard
246
9
0
14 Feb 2022
Efficient and Optimal Algorithms for Contextual Dueling Bandits under
  Realizability
Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability
Aadirupa Saha
A. Krishnamurthy
330
44
0
24 Nov 2021
Statistical Consequences of Dueling Bandits
Statistical Consequences of Dueling Bandits
Nayan Saxena
Pan Chen
Emmy Liu
117
1
0
16 Oct 2021
Preference learning along multiple criteria: A game-theoretic
  perspective
Preference learning along multiple criteria: A game-theoretic perspectiveNeural Information Processing Systems (NeurIPS), 2021
Kush S. Bhatia
A. Pananjady
Peter L. Bartlett
Anca Dragan
Martin J. Wainwright
330
15
0
05 May 2021
Adversarial Dueling Bandits
Adversarial Dueling BanditsInternational Conference on Machine Learning (ICML), 2020
Aadirupa Saha
Tomer Koren
Yishay Mansour
398
34
0
27 Oct 2020
Combinatorial Pure Exploration of Dueling Bandit
Combinatorial Pure Exploration of Dueling BanditInternational Conference on Machine Learning (ICML), 2020
Wei Chen
Yihan Du
Longbo Huang
Haoyu Zhao
277
14
0
23 Jun 2020
Preferential Batch Bayesian Optimization
Preferential Batch Bayesian OptimizationInternational Workshop on Machine Learning for Signal Processing (MLSP), 2020
E. Siivola
Akash Kumar Dhaka
Michael Riis Andersen
Javier I. González
Pablo G. Moreno
Aki Vehtari
291
25
0
25 Mar 2020
Simple Algorithms for Dueling Bandits
Simple Algorithms for Dueling Bandits
Tyler Lekang
Andrew G. Lamperski
131
6
0
18 Jun 2019
Active embedding search via noisy paired comparisons
Active embedding search via noisy paired comparisonsInformation Theory and Applications Workshop (ITA), 2019
Gregory H. Canal
A. Massimino
Mark A. Davenport
Christopher Rozell
274
27
0
10 May 2019
KLUCB Approach to Copeland Bandits
KLUCB Approach to Copeland Bandits
Nischal Agrawal
P. Chaporkar
270
1
0
07 Feb 2019
Ordinal Monte Carlo Tree Search
Ordinal Monte Carlo Tree Search
Tobias Joppen
Johannes Furnkranz
205
2
0
14 Jan 2019
MergeDTS: A Method for Effective Large-Scale Online Ranker Evaluation
MergeDTS: A Method for Effective Large-Scale Online Ranker Evaluation
Chang Li
Ilya Markov
Maarten de Rijke
M. Zoghi
175
7
0
11 Dec 2018
Duelling Bandits with Weak Regret in Adversarial Environments
Duelling Bandits with Weak Regret in Adversarial Environments
Lennard Hilgendorf
127
1
0
10 Dec 2018
Dueling Bandits with Qualitative Feedback
Dueling Bandits with Qualitative Feedback
Liyuan Xu
Junya Honda
Masashi Sugiyama
180
3
0
14 Sep 2018
Preference-based Online Learning with Dueling Bandits: A Survey
Preference-based Online Learning with Dueling Bandits: A Survey
Viktor Bengs
R. Busa-Fekete
Adil El Mesaoudi-Paul
Eyke Hüllermeier
507
133
0
30 Jul 2018
Adaptive Sampling for Coarse Ranking
Adaptive Sampling for Coarse Ranking
S. Katariya
Lalit P. Jain
Nandana Sengupta
James A. Evans
Robert D. Nowak
194
26
0
20 Feb 2018
Approximate Ranking from Pairwise Comparisons
Approximate Ranking from Pairwise Comparisons
Reinhard Heckel
Max Simchowitz
Kannan Ramchandran
Martin J. Wainwright
209
46
0
04 Jan 2018
Regret Analysis for Continuous Dueling Bandit
Regret Analysis for Continuous Dueling Bandit
Wataru Kumagai
434
33
0
21 Nov 2017
Correlational Dueling Bandits with Application to Clinical Treatment in
  Large Decision Spaces
Correlational Dueling Bandits with Application to Clinical Treatment in Large Decision Spaces
Yanan Sui
Yisong Yue
J. W. Burdick
215
19
0
08 Jul 2017
Multi-dueling Bandits with Dependent Arms
Multi-dueling Bandits with Dependent Arms
Yanan Sui
Vincent Zhuang
J. W. Burdick
Yisong Yue
434
86
0
29 Apr 2017
Preferential Bayesian Optimization
Preferential Bayesian Optimization
Javier I. González
Zhenwen Dai
Andreas C. Damianou
Neil D. Lawrence
302
143
0
12 Apr 2017
Active Ranking from Pairwise Comparisons and when Parametric Assumptions
  Don't Help
Active Ranking from Pairwise Comparisons and when Parametric Assumptions Don't Help
Reinhard Heckel
Nihar B. Shah
Kannan Ramchandran
Martin J. Wainwright
202
12
0
28 Jun 2016
Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm,
  and Computationally Efficient Algorithm
Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm
Junpei Komiyama
Junya Honda
Hiroshi Nakagawa
225
41
0
05 May 2016
Double Thompson Sampling for Dueling Bandits
Double Thompson Sampling for Dueling Bandits
Huasen Wu
Xin Liu
498
98
0
25 Apr 2016
Simple, Robust and Optimal Ranking from Pairwise Comparisons
Simple, Robust and Optimal Ranking from Pairwise Comparisons
Nihar B. Shah
Martin J. Wainwright
744
208
0
30 Dec 2015
Noisy Submodular Maximization via Adaptive Sampling with Applications to
  Crowdsourced Image Collection Summarization
Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization
Adish Singla
Sebastian Tschiatschek
Andreas Krause
234
70
0
23 Nov 2015
1
Page 1 of 1