2 citations · 5 across the 17 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
stat.ML2018
Causal Bandits with Propagating Inference
Akihiro Yabe, Daisuke Hatano, Hanna Sumita +4
Bandit is a framework for designing sequential experiments. In each experiment, a learner selects an arm and obtains an observation corresponding to . Theore…
cs.DS2018
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization
Chien-Chung Huang, Naonori Kakimura
We consider maximizing a monotone submodular function under a cardinality constraint or a knapsack constraint in the streaming setting. In particular, the elements arrive sequentia…
cs.DM2018
The -branching problem in digraphs
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
In this paper, we introduce the concept of -branchings in digraphs, which is a generalization of branchings serving as a counterpart of -matchings. Here is a positive int…