Noise-tolerant parallel learning of geometric concepts
From MaRDI portal
Publication:1281499
DOI10.1006/inco.1998.2737zbMath0927.68118MaRDI QIDQ1281499
Sally A. Goldman, Nader H. Bshouty, H. David Mathias
Publication date: 29 November 1999
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://openscholarship.wustl.edu/cgi/viewcontent.cgi?article=1434&context=cse_research
68T05: Learning and adaptive systems in artificial intelligence
68W10: Parallel algorithms in computer science
Related Items
Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions, Intrinsic complexity of learning geometrical concepts from positive data
Cites Work
- Unnamed Item
- Unnamed Item
- On learning a union of half spaces
- Equivalence of models for polynomial learnability
- Learning in parallel
- Lower bound methods and separation results for on-line learning models
- Composite geometric concepts and polynomial predictability
- A general lower bound on the number of examples needed for learning
- The bounded injury priority method and the learnability of unions of rectangles
- Learning from a consistently ignorant teacher
- Queries and concept learning
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Efficient noise-tolerant learning from statistical queries
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
