Learning unions of high-dimensional boxes over the reals
From MaRDI portal
Publication:294744
DOI10.1016/S0020-0190(00)00024-7zbMATH Open1338.68133MaRDI QIDQ294744FDOQ294744
Authors: Amos Beimel, Eyal Kushilevitz 
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
Recommendations
Cites Work
- Learnability and the Vapnik-Chervonenkis dimension
- Queries and concept learning
- Title not available (Why is that?)
- A theory of the learnable
- Efficient noise-tolerant learning from statistical queries
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Learning union of integer hypercubes with queries (with applications to monadic decomposition)
- Learning Unions of ω(1)-Dimensional Rectangles
- The learnability of unions of two rectangles in the two-dimensional discretized space
- Finding the Rare Cube
- Inferring Symbolic Automata
- Learning unions of \(\omega(1)\)-dimensional rectangles
This page was built for publication: Learning unions of high-dimensional boxes over the reals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294744)
