Learning unions of high-dimensional boxes over the reals
From MaRDI portal
Publication:294744
Recommendations
Cites work
- scientific article; zbMATH DE number 1256730 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1559548 (Why is no real title available?)
- A theory of the learnable
- Approximating hyper-rectangles: Learning and pseudorandom sets
- Composite geometric concepts and polynomial predictability
- Efficient learning with virtual threshold gates
- Efficient noise-tolerant learning from statistical queries
- Learnability and the Vapnik-Chervonenkis dimension
- Learning boxes in high dimension
- Learning from a consistently ignorant teacher
- PAC learning intersections of halfspaces with membership queries
- Queries and concept learning
Cited in
(6)- Learning Unions of ω(1)-Dimensional Rectangles
- Learning union of integer hypercubes with queries (with applications to monadic decomposition)
- Finding the Rare Cube
- Learning unions of \(\omega(1)\)-dimensional rectangles
- Inferring Symbolic Automata
- The learnability of unions of two rectangles in the two-dimensional discretized space
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)