Schemata Bandits for MAXSAT
Nixon Ronoh, Edna Chelangat Milgo, Ambrose Kipchumba Kiprop, Bernard Manderick · 2016
In this paper, we propose the use of schemata bandits for optimisation. This technique is a subclass of hierarchical bandits where the bandits are schemata. We investigate its use on a benchmark of binary combinatorial optimization problems, the Maximum Satisfiability (MAXSAT) problem. We compare performance with hierarchical Bayesian Optimization Algorithms (hBOAs), namely GSAT and WALKSAT. Results suggest that using a bandit strategy enhances solver performance.