✦ LIBER ✦

On learning monotone DNF under product distributions

✍ Scribed by Rocco A Servedio

Book ID: 113641523
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 250 KB
Volume: 193
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.04.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Learning Monotone DNF Formulae under

On Learning Monotone DNF Formulae under Uniform Distributions

✍ L. Kucera; A. Marchettispaccamela; M. Protasi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 443 KB

On the learnability of monotone kμ-DNF f

On the learnability of monotone kμ-DNF formulae under product distributions

✍ Michele Flammini 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 625 KB

Learning Monotone Log-Term DNF Formulas

Learning Monotone Log-Term DNF Formulas under the Uniform Distribution

✍ Y. Sakai; A. Maruoka 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 81 KB

More efficient PAC-learning of DNF with

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

✍ Nader H. Bshouty; Jeffrey C. Jackson; Christino Tamon 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 532 KB

An O(nlog log n) Learning Algorithm for

An O(nlog log n) Learning Algorithm for DNF under the Uniform Distribution

✍ Y. Mansour 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 571 KB

We show that a DNF with terms of size at most \(d\) can be approximated by a function at most \(d^{O(d \log 1 / \epsilon)}\) nonzero Fourier coefficients such that the expected error squared, with respect to the uniform distribution, is at most \(\epsilon\). This property is used to derive a learnin

On learning multivariate polynomials und

On learning multivariate polynomials under the uniform distribution

✍ Nader H. Bshouty 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 511 KB

We present a PAC-learning algorithm with membership queries for learning any multivariate polynomial over any finite field F under the uniform distribution. The algorithm runs in polynomial time and asks t"('~""% IF') log n queries where I is the number of terms in the polynomial, n is the number of