✦ LIBER ✦

Optimal Mistake Bound Learning Is Hard

✍ Scribed by Moti Frances; Ami Litman

Book ID: 112252349
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 341 KB
Volume: 144
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1998.2709

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Learning parities in the mistake-bound m

Learning parities in the mistake-bound model

✍ Harry Buhrman; David García-Soriano; Arie Matsliah 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Attribute-Efficient Learning in Query an

Attribute-Efficient Learning in Query and Mistake-Bound Models

✍ Nader Bshouty; Lisa Hellerstein 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 351 KB

We consider the problem of attribute-efficient learning in query and mistake-bound models. Attribute-efficient algorithms make a number of queries or mistakes that is polynomial in the number of relevant variables in the target function, but only sublinear in the number of irrelevant variables. We c

Learning Local Transductions Is Hard

✍ Martin Jansche 📂 Article 📅 2004 🏛 Springer Netherlands 🌐 English ⚖ 111 KB

Why is science hard to learn?

✍ R. Millar 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 540 KB

Learning from your mistakes: is aneuploi

Learning from your mistakes: is aneuploidy so bad, after all?

✍ David F. Albertini 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 69 KB

When learning the hard way is expensive

✍ Alan Burrows 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 234 KB

In the L&A. Users may clear permesions and make payments through the Copyright Clearance Center, Inc., 222 Rosewood Driw, i%nW% MA 01923. UZA; phone: (97817508400, fax: (978) 7504744, and in the UK through the Copyright Licensing Agency Rapid &learaMe Service (CLARCS), 90 Tottenham Court Road, i.ond