✦ LIBER ✦

More efficient PAC-learning of DNF with membership queries under the uniform distribution

✍ Scribed by Nader H. Bshouty; Jeffrey C. Jackson; Christino Tamon

Book ID: 108166473
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 532 KB
Volume: 68
Category: Article
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2003.10.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Membership-Query Algorithm

An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution

✍ Jeffrey C Jackson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 566 KB

We present a membership-query algorithm for efficiently learning DNF with respect to the uniform distribution. In fact, the algorithm properly learns with respect to uniform the class TOP of Boolean functions expressed as a majority vote over parity functions. We also describe extensions of this alg

An upper bound on the sample complexity

An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution

✍ Philip M. Long 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 103 KB

We show that halfspaces in n dimensions can be PAC-learned with respect to the uniform distribution with accuracy ε and confidence δ using O( 1 ε (n + log 1 δ )) examples.

MAGNA CARTAThe Great CharterPreamble

📂 Fiction 🌐 English ⚖ 11 KB 👁 18 views