Skip to main content
Article thumbnail
Location of Repository

− 1.

By Scribe Alex Sherstov

Abstract

This lecture presents a polynomial-time algorithm based on boosting for learning DNF formulas to arbitrary precision. The algorithm is due to Jackson [1]. 14.1 Preliminaries Let f = T1 ∨ T2 ∨ · · · ∨ Ts be a Boolean function in DNF on n variables. One of T1, T2,..., Ts must be true on at least 1/s of the satisfying assignments to f; denote some such term by T. The analysis below treats f and T as Boolean functions from {−1, 1} n to {−1, 1}; we denote by f {0,1} and T {0,1} their counterparts from {−1, 1} n to {0, 1}. Let D be an arbitrary distribution over {−1, 1} n. We start by relating E D [f] and E D Thus, E [f] = −1 · Pr[f = −1] + 1 · Pr[

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.157
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.utexas.edu/~kliv... (external link)
  • Suggested articles


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