17 citations · 43 across the 16 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.LG2020
Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation
Yuko Kuroki, Junya Honda, Masashi Sugiyama
Combinatorial optimization is one of the fundamental research fields that has been extensively studied in theoretical computer science and operations research. When developing an a…
cs.LG2020★ 10 cited
Online Dense Subgraph Discovery via Blurred-Graph Feedback
Yuko Kuroki, Atsushi Miyauchi, Junya Honda +1
Dense subgraph discovery aims to find a dense component in edge-weighted graphs. This is a fundamental graph-mining task with a variety of applications and thus has received much a…
cs.LG2020★ 3 cited
Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback
Yihan Du, Yuko Kuroki, Wei Chen
In this paper, we first study the problem of combinatorial pure exploration with full-bandit feedback (CPE-BL), where a learner is given a combinatorial action space $\mathcal{X} \…