Abstract
We describe a polynomial-time algorithm for learning axis-aligned rectangles in Qd with respect to product distributions from multiple-instance examples in the PAC model. Here, each example consists of n elements of Qd 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 Qd 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 (d5 n12/∈20 log2 nd/∈δ time.
Article PDF
Similar content being viewed by others
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.
Blum, A. & Kalai, A. (this issue). A note on learning from multiple-instance examples. Machine Learning.
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuthm M.K. (1989). Learnability and the Vapnik-Chervonenkis dimension. JACM, 36(4):929–965.
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.
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.
Kearns, M.J. (1993). Efficient noise-tolerant learning from statistical queries. Proceedings of the 25th ACM Symposium on the Theory of Computing.
Kearns, M.J. & Schapire, R. E. (1994). Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences, 48(3):464–497.
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.
Long, P.M. & Warmuth, M.K. (1994). Composite geometric concepts and polynomial predictability. Information and Computation, 113(2):203–252.
Pitt, L. & Valiant, L.G. (1988). Computational limitations on learning from examples. Journal of the Association for Computing Machinery, 35(4):965–984.
Pollard, D. (1984). Convergence of Stochastic Processes. Springer Verlag.
Valiant, L.G. (1984). A theory of the learnable. Communications of the ACM, 27(11):1134–1142.
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.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Long, P.M., Tan, L. PAC Learning Axis-aligned Rectangles with Respect to Product Distributions from Multiple-Instance Examples. Machine Learning 30, 7–21 (1998). https://doi.org/10.1023/A:1007450326753
Issue Date:
DOI: https://doi.org/10.1023/A:1007450326753