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
✦ LIBER ✦
Learning parities in the mistake-bound model
✍ Scribed by Harry Buhrman; David García-Soriano; Arie Matsliah
- Book ID
- 108154727
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 164 KB
- Volume
- 111
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Attribute-Efficient Learning in Query an
✍
Nader Bshouty; Lisa Hellerstein
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 351 KB
Learning with bounded memory in stochast
✍
Seppo Honkapohja; Kaushik Mitra
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 206 KB
Learning with bounded memory in stochastic frameworks is incomplete in the sense that the learning dynamics cannot converge to a rational expectations equilibrium (REE). The properties of dynamics arising from such rules are studied for standard models with steady states. If the REE in linear models
The culture of learning from mistakes: H
✍
Christian Harteis; Johannes Bauer; Hans Gruber
📂
Article
📅
2008
🏛
Elsevier Science
🌐
English
⚖ 145 KB
Noise-tolerant learning, the parity prob
✍
Blum, Avrim; Kalai, Adam; Wasserman, Hal
📂
Article
📅
2003
🏛
Association for Computing Machinery
🌐
English
⚖ 130 KB
Parity constraints in the Veneziano mode
✍
P.G.O. Freund; E. Schonberg
📂
Article
📅
1969
🏛
Elsevier Science
🌐
English
⚖ 242 KB
Learning from Mistakes: Resources of Tol
✍
MENACHEM LORBERBAUM
📂
Article
📅
1995
🏛
John Wiley and Sons
🌐
English
⚖ 815 KB