Theory of linear and integer programming
Theory of linear and integer programming
Lower Bound Methods and Separation Results for On-Line Learning Models
Machine Learning - Computational learning theory
Geometrical concept learning and convex polytopes
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Fast identification of geometric objects with membership queries
Information and Computation
On specifying Boolean functions by labelled examples
Discrete Applied Mathematics
Generalized teaching dimensions and the query complexity of learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Machine Learning
Machine Learning
| Hi-index | 0.00 |
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from all the other ones of the concept class under consideration. For a domain consisting of all integer points of some polytope we give non-trivial lower bounds on the complexity of exact identification of half-spaces. These bounds are near to known upper bounds.