The following pages link to On the complexity of teaching (Q1892202):
Displayed 50 items.
- Algebraic methods proving Sauer's bound for teaching complexity (Q465250) (← links)
- Teaching randomized learners with feedback (Q553294) (← links)
- Measuring teachability using variants of the teaching dimension (Q924171) (← links)
- DNF are teachable in the average case (Q1009216) (← links)
- A model of interactive teaching (Q1362340) (← links)
- Approximate testing and its relationship to learning (Q1389650) (← links)
- Queries revisited. (Q1426146) (← links)
- Exact learning via teaching assistants (Q1575459) (← links)
- On the limits of efficient teachability (Q1603392) (← links)
- A new abstract combinatorial dimension for exact learning via queries (Q1604216) (← links)
- On the teaching complexity of linear sets (Q1704564) (← links)
- Uniform characterizations of polynomial-query learnabilities (Q1870533) (← links)
- Online learning of binary and \(n\)-ary relations over clustered domains. (Q1872704) (← links)
- On specifying Boolean functions by labelled examples (Q1897365) (← links)
- Optimization problems for machine learning: a survey (Q2029894) (← links)
- Beneficial and harmful explanatory machine learning (Q2051274) (← links)
- On Boolean threshold functions with minimum specification number (Q2105416) (← links)
- The complexity of exact learning of acyclic conditional preference networks from swap examples (Q2289025) (← links)
- The power of random counterexamples (Q2290678) (← links)
- Finitely distinguishable erasing pattern languages (Q2290682) (← links)
- When are epsilon-nets small? (Q2304628) (← links)
- The teaching size: computable teachers and learners for universal languages (Q2320594) (← links)
- LARS: a learning algorithm for rewriting systems (Q2384128) (← links)
- Distinguishing pattern languages with membership examples (Q2407113) (← links)
- The subsumption lattice and query learning (Q2581757) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- A general dimension for query learning (Q2641869) (← links)
- PAC Learning under Helpful Distributions (Q2771492) (← links)
- On Version Space Compression (Q2830266) (← links)
- Classifying the Arithmetical Complexity of Teaching Models (Q2830273) (← links)
- On the Teaching Complexity of Linear Sets (Q2835620) (← links)
- Learning Tree Languages (Q2963598) (← links)
- Massive online teaching to bounded learners (Q2986853) (← links)
- Learning mixtures of spherical gaussians (Q2986854) (← links)
- Low-weight halfspaces for sparse boolean vectors (Q2986855) (← links)
- Learnability of DNF with representation-specific queries (Q2986856) (← links)
- Can theories be tested? (Q2986857) (← links)
- Making evolution rigorous (Q2986858) (← links)
- On the convergence of the Hegselmann-Krause system (Q2986859) (← links)
- Is privacy compatible with truthfulness? (Q2986860) (← links)
- Differentially private data analysis of social networks via restricted sensitivity (Q2986861) (← links)
- Characterizing the sample complexity of private learners (Q2986862) (← links)
- Barriers in cryptography with weak, correlated and leaky sources (Q2986863) (← links)
- On the possibilities and limitations of pseudodeterministic algorithms (Q2986864) (← links)
- Evasiveness through a circuit lens (Q2986865) (← links)
- The garden-hose model (Q2986866) (← links)
- Space-bounded communication complexity (Q2986867) (← links)
- Towards an optimal query efficient PCP? (Q2986868) (← links)
- A characterization of approximation resistance for even k-partite CSPs (Q2986869) (← links)
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction (Q2986870) (← links)