20 citations · 43 across the 31 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
stat.ML2019★ 1 cited
A Simple Heuristic for Bayesian Optimization with A Low Budget
Masahiro Nomura, Kenshi Abe
The aim of black-box optimization is to optimize an objective function within the constraints of a given evaluation budget. In this problem, it is generally assumed that the comput…
cs.LG2019★ 20 cited
Solving NP-Hard Problems on Graphs with Extended AlphaGo Zero
Kenshin Abe, Zijian Xu, Issei Sato +1
There have been increasing challenges to solve combinatorial optimization problems by machine learning. Khalil et al. proposed an end-to-end reinforcement learning framework, S2V-D…