ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 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 G. Jamieson
S. Katariya
Atul Deshpande
Robert D. Nowak
ArXivPDFHTML

Papers citing "Sparse Dueling Bandits"

22 / 22 papers shown
Title
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
51
0
0
14 Mar 2025
Biased Dueling Bandits with Stochastic Delayed Feedback
Biased Dueling Bandits with Stochastic Delayed Feedback
Bongsoo Yi
Yue Kang
Yao Li
40
1
0
26 Aug 2024
Multi-Player Approaches for Dueling Bandits
Multi-Player Approaches for Dueling Bandits
Or Raveh
Junya Honda
Masashi Sugiyama
46
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
34
1
0
16 Apr 2024
Reinforcement Learning from Human Feedback with Active Queries
Reinforcement Learning from Human Feedback with Active Queries
Kaixuan Ji
Jiafan He
Quanquan Gu
29
17
0
14 Feb 2024
Borda Regret Minimization for Generalized Linear Dueling Bandits
Borda Regret Minimization for Generalized Linear Dueling Bandits
Yue Wu
Tao Jin
Hao Lou
Farzad Farnoud
Quanquan Gu
34
11
0
15 Mar 2023
Dueling Convex Optimization with General Preferences
Dueling Convex Optimization with General Preferences
Aadirupa Saha
Tomer Koren
Yishay Mansour
30
3
0
27 Sep 2022
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit
  Problem
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem
Arpit Agarwal
R. Ghuge
V. Nagarajan
25
1
0
25 Sep 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
41
8
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
42
35
0
24 Nov 2021
Preference learning along multiple criteria: A game-theoretic
  perspective
Preference learning along multiple criteria: A game-theoretic perspective
Kush S. Bhatia
A. Pananjady
Peter L. Bartlett
Anca Dragan
Martin J. Wainwright
38
13
0
05 May 2021
Active embedding search via noisy paired comparisons
Active embedding search via noisy paired comparisons
Gregory H. Canal
A. Massimino
Mark A. Davenport
Christopher Rozell
36
23
0
10 May 2019
KLUCB Approach to Copeland Bandits
KLUCB Approach to Copeland Bandits
Nischal Agrawal
P. Chaporkar
16
1
0
07 Feb 2019
Ordinal Monte Carlo Tree Search
Ordinal Monte Carlo Tree Search
Tobias Joppen
Johannes Furnkranz
13
2
0
14 Jan 2019
Adaptive Sampling for Coarse Ranking
Adaptive Sampling for Coarse Ranking
S. Katariya
Lalit P. Jain
Nandana Sengupta
James A. Evans
Robert D. Nowak
13
25
0
20 Feb 2018
Regret Analysis for Continuous Dueling Bandit
Regret Analysis for Continuous Dueling Bandit
Wataru Kumagai
34
27
0
21 Nov 2017
Multi-dueling Bandits with Dependent Arms
Multi-dueling Bandits with Dependent Arms
Yanan Sui
Vincent Zhuang
J. W. Burdick
Yisong Yue
25
80
0
29 Apr 2017
Preferential Bayesian Optimization
Preferential Bayesian Optimization
Javier I. González
Zhenwen Dai
Andreas C. Damianou
Neil D. Lawrence
23
110
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
19
10
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
19
39
0
05 May 2016
Double Thompson Sampling for Dueling Bandits
Double Thompson Sampling for Dueling Bandits
Huasen Wu
Xin Liu
22
87
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
35
173
0
30 Dec 2015
1