Separating distribution-free and mistake-bound learning models over the Boolean domain
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 211-218
- https://doi.org/10.1109/fscs.1990.89540
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Crytographic limitations on learning Boolean formulae and finite automataPublished by Association for Computing Machinery (ACM) ,1989
- Pseudo-random generation from one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- The strength of weak learnabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- On the complexity of learning from counterexamplesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmMachine Learning, 1988
- Occam's RazorInformation Processing Letters, 1987
- On the learnability of Boolean formulaePublished by Association for Computing Machinery (ACM) ,1987
- Recent Results on Boolean Concept LearningPublished by Elsevier ,1987
- One-way functions and pseudorandom generatorsPublished by Association for Computing Machinery (ACM) ,1985
- A theory of the learnableCommunications of the ACM, 1984