Learning unions of high-dimensional boxes over the reals

DOI10.1016/S0020-0190(00)00024-7zbMath1338.68133MaRDI QIDQ294744

Eyal Kushilevitz, Amos Beimel

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000247?np=y

zbMATH Keywords

computational complexitygeometric objectsPAC learningcomputational learningboxesmembership queries

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Inferring Symbolic Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• PAC learning intersections of halfspaces with membership queries
• Learning boxes in high dimension
• Approximating hyper-rectangles: Learning and pseudorandom sets
• Composite geometric concepts and polynomial predictability
• Efficient learning with virtual threshold gates
• 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

This page was built for publication: Learning unions of high-dimensional boxes over the reals