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. 2012.15584
  4. Cited By
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond:
  Solving Combinatorial Optimization under Uncertainty with Limited Observation
v1v2 (latest)

Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation

31 December 2020
Yuko Kuroki
Junya Honda
Masashi Sugiyama
    OffRL
ArXiv (abs)PDFHTML

Papers citing "Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation"

1 / 1 papers shown
Title
Towards Optimal and Efficient Best Arm Identification in Linear Bandits
Towards Optimal and Efficient Best Arm Identification in Linear Bandits
Mohammadi Zaki
Avinash Mohan
Aditya Gopalan
77
12
0
05 Nov 2019
1