Shin-ichi Minato

Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams

We consider bandit combinatorial optimization (BCO) problems. A BCO instance generally has a huge set of all feasible solutions, which we call the action set. To avoid dealing with such huge action sets directly, we propose an algorithm that takes advantage of zero-suppressed binary decision diagram…