Learning intersection-closed classes with signatures
From MaRDI portal
Recommendations
Cites work
- A dichotomy theorem for learning quantified Boolean formulas
- A theory of the learnable
- Computer Science Logic
- Computer Science Logic
- Constraints, consistency and closure
- Exploring learnability between exact and PAC
- Galois connections and applications
- Learnability of quantified formulas.
- Learning Integer Lattices
- On-line learning with malicious noise and the closure algorithm
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
- Queries and concept learning
Cited in
(5)
This page was built for publication: Learning intersection-closed classes with signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2381578)