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. 2108.00230
  4. Cited By
Pure Exploration and Regret Minimization in Matching Bandits

Pure Exploration and Regret Minimization in Matching Bandits

31 July 2021
Flore Sentenac
Jialin Yi
Clément Calauzènes
Vianney Perchet
Milan Vojnović
ArXiv (abs)PDFHTML

Papers citing "Pure Exploration and Regret Minimization in Matching Bandits"

2 / 2 papers shown
Title
UniRank: Unimodal Bandit Algorithm for Online Ranking
UniRank: Unimodal Bandit Algorithm for Online Ranking
Camille-Sovanneary Gauthier
Romaric Gaudel
Elisa Fromont
48
2
0
02 Aug 2022
Choosing Answers in $\varepsilon$-Best-Answer Identification for Linear
  Bandits
Choosing Answers in ε\varepsilonε-Best-Answer Identification for Linear Bandits
Marc Jourdan
Rémy Degenne
37
1
0
09 Jun 2022
1