# PAC Learning Axis-aligned Rectangles with Respect to Product Distributions from Multiple-Instance Examples

Article

- 799 Downloads
- 28 Citations

## Abstract

We describe a polynomial-time algorithm for learning axis-aligned rectangles in Q^{ d } with respect to product distributions from multiple-instance examples in the PAC model. Here, each example consists of *n* elements of Q^{d} together with a label indicating whether any of the *n* points is in the rectangle to be learned. We assume that there is an unknown product distribution *D* over Q^{ d } such that all instances are independently drawn according to *D*. The accuracy of a hypothesis is measured by the probability that it would incorrectly predict whether one of *n* more points drawn from *D* was in the rectangle to be learned. Our algorithm achieves accuracy ∈ with probability *1-*δ in O (d^{5} n^{12}/∈^{20} log^{2} nd/∈δ time.

PAC learning multiple-instance examples axis-aligned hyperrectangles

Download
to read the full article text

## References

- Auer, P., Long, P.M. & Srinivasan, A. (1997). Approximating hyper-rectangles: learning and pseudo-random sets.
*Proceedings of the 29th ACM Symposium on the Theory of Computing*.Google Scholar - Blum, A. & Kalai, A. (this issue). A note on learning from multiple-instance examples.
*Machine Learning*.Google Scholar - Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuthm M.K. (1989). Learnability and the Vapnik-Chervonenkis dimension.
*JACM*, 36(4):929–965.Google Scholar - Dietterich, T.G., Lathrop, R.H. & Lozano-Perez, T. (1997). Solving the multiple-instance problem with axisparallel rectangles.
*Artificial Intelligence*, 89(1–2):31–71.CrossRefGoogle Scholar - Ehrenfeucht, A., Haussler, D., Kearns, M. & Valiant, L.G. (1989). A general lower bound on the number of examples needed for learning.
*Information and Computation*, 82(3):247–251.Google Scholar - Kearns, M.J. (1993). Efficient noise-tolerant learning from statistical queries.
*Proceedings of the 25th ACM Symposium on the Theory of Computing*.Google Scholar - Kearns, M.J. & Schapire, R. E. (1994). Efficient distribution-free learning of probabilistic concepts.
*Journal of Computer and System Sciences*, 48(3):464–497.Google Scholar - Long, P.M. & Tan, L. (1996). PAC learning axis-aligned rectangles with respect to product distributions from multiple-instance examples.
*The 1995 Conference on Computational Learning Theory*, pages 228–234, 1996.Google Scholar - Long, P.M. & Warmuth, M.K. (1994). Composite geometric concepts and polynomial predictability.
*Information and Computation*, 113(2):203–252.Google Scholar - Pitt, L. & Valiant, L.G. (1988). Computational limitations on learning from examples.
*Journal of the Association for Computing Machinery*, 35(4):965–984.Google Scholar - Pollard, D. (1984).
*Convergence of Stochastic Processes*. Springer Verlag.Google Scholar - Valiant, L.G. (1984). A theory of the learnable.
*Communications of the ACM*, 27(11):1134–1142.Google Scholar - Yamanishi, K. (1992). A learning criterion for stochastic rules.
*Machine Learning*. Special Issue on the Proceedings of the 3nd Workshop on Computational Learning Theory, to appear.Google Scholar

## Copyright information

© Kluwer Academic Publishers 1998