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

Shinsaku Sakaue, Masakazu Ishihata, Shin-ichi Minato

Abstract: 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...