Generalized teaching dimensions and the query complexity of learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
PAC learning intersections of halfspaces with membership queries (extended abstract)
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Exact Learning of Formulas in Parallel
Machine Learning
Learning atomic formulas with prescribed properties
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
| Hi-index | 0.00 |
The complexity of on-line learning is investigated for the basic classes of geometrical objects over a discrete (“digitized”) domain. In particular, upper and lower bounds are derived for the complexity of learning algorithms for axis-parallel rectangles, rectangles in general position, balls, half-spaces, intersections of half-spaces, and semi-algebraic sets. The learning model considered is the standard model for on-line learning from counterexamples.