General lower bounds on the query complexity within the exact learning model
From MaRDI portal
Recommendations
- A new abstract combinatorial dimension for exact learning via queries
- An algebraic view on exact learning from queries
- Complexity theoretic hardness results for query learning
- Learning via finitely many queries
- Oracles and queries that are sufficient for exact learning
- Lower bounds on learning random structures with statistical queries
- New lower bounds for statistical query learning
- New lower bounds for statistical query learning
- Lower bounds for the complexity of learning half-spaces with membership queries
- A general dimension for exact learning
Cites work
- A combinatorial problem; stability and order for models and theories in infinitary languages
- General lower bounds on the query complexity within the exact learning model
- scientific article; zbMATH DE number 67631 (Why is no real title available?)
- Learning from examples with unspecified attribute values.
- Lower bound methods and separation results for on-line learning models
- On the density of families of sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Queries and concept learning
- Simulating access to hidden information while learning
Cited in
(10)- Lower bound methods and separation results for on-line learning models
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
- How many queries are needed to learn one bit of information?
- A general lower bound on the number of examples needed for learning
- General lower bounds on the query complexity within the exact learning model
- How many queries are needed to learn one bit of information?
- On the Complexity of Learning Minimum Time-Bounded Turing Machines
- Structural analysis of polynomial-time query learnability
- A Lower Bound for Agnostically Learning Disjunctions
- Comparison of query learning and Gold-style learning in dependence of the hypothesis space
This page was built for publication: General lower bounds on the query complexity within the exact learning model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1841883)