Location of Repository

The sample complexity and computational complexity of Boolean function learning

By Martin Anthony

Abstract

This report surveys some key results on the learning of Boolean functions in a probabilistic model that is a generalization of the well-known ‘PAC’ model. A version of this is to appear as a chapter in a book on Boolean functions, but the report itself is relatively self-contained

Topics: QA Mathematics
Publisher: Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science
Year: 2002
OAI identifier: oai:eprints.lse.ac.uk:13569
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.cdam.lse.ac.uk (external link)
  • http://eprints.lse.ac.uk/13569... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.