The complexity of learning concept classes with polynomial general dimension
From MaRDI portal
Publication:817832
Recommendations
Cites Work
- scientific article; zbMATH DE number 1804113 (Why is no real title available?)
- scientific article; zbMATH DE number 67616 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1563912 (Why is no real title available?)
- A framework for polynomial-time query learnability
- A new abstract combinatorial dimension for exact learning via queries
- Complexity theoretic hardness results for query learning
- Cryptographic limitations on learning Boolean formulae and finite automata
- How many queries are needed to learn?
- Learning read-once formulas with queries
- Oracles and queries that are sufficient for exact learning
- Queries and concept learning
- Structural analysis of polynomial-time query learnability
- When won't membership queries help?
Cited In (3)
This page was built for publication: The complexity of learning concept classes with polynomial general dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817832)