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. 2310.00750
  4. Cited By
Identifying Copeland Winners in Dueling Bandits with Indifferences

Identifying Copeland Winners in Dueling Bandits with Indifferences

1 October 2023
Viktor Bengs
Björn Haddenhorst
Eyke Hüllermeier
ArXivPDFHTML

Papers citing "Identifying Copeland Winners in Dueling Bandits with Indifferences"

3 / 3 papers shown
Title
ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive
  Non-Stationary Dueling Bandits
ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits
Thomas Kleine Buening
Aadirupa Saha
38
6
0
25 Oct 2022
Non-Stationary Dueling Bandits
Non-Stationary Dueling Bandits
Patrick Kolpaczki
Viktor Bengs
Eyke Hüllermeier
30
7
0
02 Feb 2022
Sequential Preference-Based Optimization
Sequential Preference-Based Optimization
Ian Dewancker
Jakob Bauer
M. McCourt
25
6
0
09 Jan 2018
1