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. 1806.08182
  4. Cited By
Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept,
  Accept, Strong Accept: Which Papers get in?

Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?

21 June 2018
Vincent Cohen-Addad
Frederik Mallmann-Trenn
Claire Mathieu
ArXivPDFHTML

Papers citing "Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?"

2 / 2 papers shown
Title
A Nearly Instance Optimal Algorithm for Top-k Ranking under the
  Multinomial Logit Model
A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model
Xi Chen
Yuanzhi Li
Jieming Mao
37
41
0
25 Jul 2017
On the Complexity of Best Arm Identification in Multi-Armed Bandit
  Models
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models
E. Kaufmann
Olivier Cappé
Aurélien Garivier
166
1,025
0
16 Jul 2014
1