On the limits of proper learnability of subclasses of DNF formulas
From MaRDI portal
Publication:676245
DOI10.1007/BF00114011zbMath0869.68091OpenAlexW4232533940MaRDI QIDQ676245
Krishnan Pillaipakkamnatt, Vijay Raghavan
Publication date: 16 March 1997
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00114011
Related Items (6)
Integer equal flows ⋮ Self-improved gaps almost everywhere for the agnostic approximation of monomials ⋮ An optimal algorithm for proper learning of unions of two rectangles with queries ⋮ Learning conditional preference networks ⋮ Exact learning of DNF formulas using DNF hypotheses ⋮ The learnability of unions of two rectangles in the two-dimensional discretized space
Cites Work
- Fast learning of \(k\)-term DNF formulas with queries.
- When won't membership queries help?
- Asking questions to minimize errors
- Read-twice DNF formulas are properly learnable
- A theory of the learnable
- Computational limitations on learning from examples
- Learning read-once formulas with queries
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the limits of proper learnability of subclasses of DNF formulas
