✦ LIBER ✦

On Learning Monotone DNF Formulae under Uniform Distributions

✍ Scribed by L. Kucera; A. Marchettispaccamela; M. Protasi

Book ID: 112252070
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 443 KB
Volume: 110
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1994.1024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On learning monotone DNF under product d

On learning monotone DNF under product distributions

✍ Rocco A Servedio 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 250 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

On Learning Visual Concepts and DNF Form

On Learning Visual Concepts and DNF Formulae

✍ Kushilevitz, Eyal; Roth, Dan 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 405 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