ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 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
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
347
12
0
05 Nov 2019
1
Page 1 of 1