Skip navigation
Skip navigation

Online Learning of k-CNF Boolean Functions

Veness, Joel; Hutter, Marcus; Orseau, Laurent; Bellemare, Marc

Description

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...[Show more]

CollectionsANU Research Publications
Date published: 2015
Type: Conference paper
URI: http://hdl.handle.net/1885/154194
Source: Exploiting Symmetries by Planning for a Descriptive Quotient
Access Rights: Open Access

Download

File Description SizeFormat Image
01_Veness_Online_Learning_of_k-CNF_2015.pdf424.85 kBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator