Proceedings Abstracts of the Twenty-Fourth International Joint Conference on Artificial Intelligence

Online Learning of k-CNF Boolean Functions / 3865
Joel Veness, Marcus Hutter, Laurent Orseau, Marc Bellemare

This paper revisits the problem of learning a k-CNF Boolean function from examples, for fixed k, in the context of online learning under the logarithmic loss. We give a Bayesian interpretation to one of Valiant’s classic PAC learning algorithms, which we then build upon to derive three efficient, online, probabilistic, supervised learning algorithms for predicting the output of an unknown k-CNF Boolean function. We analyze the loss of our methods, and show that the cumulative log-loss can be upper bounded by a polynomial function of the size of each example.