Sciweavers

IPL
2010
92views more  IPL 2010»
13 years 3 months ago
Learning parities in the mistake-bound model
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
Harry Buhrman, David García-Soriano, Arie M...
FOCS
1990
IEEE
13 years 9 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum