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

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
ArXivPDFHTML

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

2 / 2 papers shown
Title
Best Arm Identification for Cascading Bandits in the Fixed Confidence
  Setting
Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting
Zixin Zhong
Wang Chi Cheung
Vincent Y. F. Tan
21
8
0
23 Jan 2020
Robust Influence Maximization
Robust Influence Maximization
Wei Chen
Tian Lin
Zihan Tan
Mingfei Zhao
Xuren Zhou
48
169
0
25 Jan 2016
1