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?
v1v2 (latest)

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
ArXiv (abs)PDFHTML

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

4 / 4 papers shown
Title
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
71
2
0
25 Sep 2022
Regret Minimization with Noisy Observations
Regret Minimization with Noisy Observations
Mohammad Mahdian
Jieming Mao
Kangning Wang
55
1
0
19 Jul 2022
Exploration with Limited Memory: Streaming Algorithms for Coin Tossing,
  Noisy Comparisons, and Multi-Armed Bandits
Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits
Sepehr Assadi
Chen Wang
105
17
0
09 Apr 2020
Locally Private Hypothesis Selection
Locally Private Hypothesis Selection
Sivakanth Gopi
Gautam Kamath
Janardhan Kulkarni
Aleksandar Nikolov
Zhiwei Steven Wu
Huanyu Zhang
91
27
0
21 Feb 2020
1