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. 1909.03194
  4. Cited By
On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy
  Comparisons

On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons

7 September 2019
Wenbo Ren
Jia Liu
Ness B. Shroff
ArXivPDFHTML

Papers citing "On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons"

3 / 3 papers shown
Title
Reinforcement Learning from Human Feedback with Active Queries
Reinforcement Learning from Human Feedback with Active Queries
Kaixuan Ji
Jiafan He
Quanquan Gu
24
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
26
11
0
15 Mar 2023
Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise
  Comparisons
Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons
Yue Wu
Tao Jin
Hao Lou
Pan Xu
Farzad Farnoud
Quanquan Gu
21
5
0
08 Oct 2021
1