Efficient bandit combinatorial optimization algorithm with zero-suppressed binary decision diagrams

Apr 9, 2018·

Shinsaku Sakaue

,

Masakazu Ishihata

,

Shin‑ichi Minato

· 0 min read

Type

Conference paper

Publication

International Conference on Artificial Intelligence and Statistics (AISTATS)

Last updated on Apr 9, 2018

← Provable fast greedy compressive summarization with any monotone submodular function Jun 1, 2018

Accelerated best-first search with upper-bound computation for submodular function maximization Jan 1, 2018 →