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. 1711.08018
  4. Cited By
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity
  Bounds and an Efficient Algorithm

Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm

21 November 2017
Tongyi Cao
A. Krishnamurthy
ArXivPDFHTML

Papers citing "Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm"

1 / 1 papers shown
Title
On combinatorial testing problems
On combinatorial testing problems
L. Addario-Berry
N. Broutin
Luc Devroye
Gábor Lugosi
107
114
0
24 Aug 2009
1