On the complexity of teaching
From MaRDI portal
Recommendations
Cited in
(97)- DNF are teachable in the average case
- A model of interactive teaching
- Approximate testing and its relationship to learning
- Queries revisited.
- Exact learning via teaching assistants
- On the limits of efficient teachability
- A new abstract combinatorial dimension for exact learning via queries
- On the teaching complexity of linear sets
- Uniform characterizations of polynomial-query learnabilities
- Online learning of binary and \(n\)-ary relations over clustered domains.
- On specifying Boolean functions by labelled examples
- Optimization problems for machine learning: a survey
- Beneficial and harmful explanatory machine learning
- On Boolean threshold functions with minimum specification number
- The complexity of exact learning of acyclic conditional preference networks from swap examples
- The power of random counterexamples
- Finitely distinguishable erasing pattern languages
- When are epsilon-nets small?
- The teaching size: computable teachers and learners for universal languages
- LARS: a learning algorithm for rewriting systems
- Distinguishing pattern languages with membership examples
- The subsumption lattice and query learning
- Exact learning from an honest teacher that answers membership queries
- A general dimension for query learning
- PAC learning under helpful distributions
- On version space compression
- Classifying the arithmetical complexity of teaching models
- The teaching dimension of linear learners
- On the Teaching Complexity of Linear Sets
- Learning Tree Languages
- Massive online teaching to bounded learners
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- Low-weight halfspaces for sparse boolean vectors
- Learnability of DNF with representation-specific queries
- Can theories be tested?
- Making evolution rigorous: the error threshold
- On the convergence of the Hegselmann-Krause system
- Is privacy compatible with truthfulness?
- Differentially private data analysis of social networks via restricted sensitivity
- Characterizing the sample complexity of private learners
- Barriers in cryptography with weak, correlated and leaky sources
- On the possibilities and limitations of pseudodeterministic algorithms
- Evasiveness through a circuit lens (extended abstract)
- The garden-hose model
- Space-bounded communication complexity
- Towards an optimal query efficient PCP?
- A characterization of approximation resistance for even k-partite CSPs
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction
- On the power of many one-bit provers
- Approaching utopia, strong truthfulness and externality-resistant mechanisms
- Learning and incentives in user-generated content: multi-armed bandits with endogenous arms
- Welfare maximization and the supermodular degree
- Reachability in graph timelines
- Runtime guarantees for regression problems
- An energy complexity model for algorithms
- Streaming computations with a loquacious prover
- Adversary lower bound for the k-sum problem
- Stronger methods of making quantum interactive proofs perfectly complete
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- An equational approach to secure multi-party computation
- Publicly verifiable proofs of sequential work
- On the power of nonuniformity in proofs of security
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Resource-based corruptions and the combinatorics of hidden diversity
- Time hierarchies for sampling distributions
- Properties and applications of Boolean function composition
- Pseudo-partitions, transversality and locality, a combinatorial characterization for the space measure in algebraic proof systems
- Competing provers protocols for circuit evaluation
- Catch them if you can
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
- Robust optimization in the presence of uncertainty
- Sorting noisy data with partial information
- New affine-invariant codes from lifting
- H-wise independence
- Sparse extractor families for all the entropy
- Recent Developments in Algorithmic Teaching
- scientific article; zbMATH DE number 67797 (Why is no real title available?)
- Teaching and Compressing for Low VC-Dimension
- Preference-based teaching of unions of geometric objects
- Algebraic methods proving Sauer's bound for teaching complexity
- scientific article; zbMATH DE number 7626725 (Why is no real title available?)
- Learning qualitative constraint networks
- On Polynomial Time Constructions of Minimum Height Decision Tree
- Combinatorial results on the complexity of teaching and learning
- Models of cooperative teaching and learning
- Teaching Dimension and the Complexity of Active Learning
- Teaching randomized learners with feedback
- Decision lists and related Boolean functions
- Order compression schemes
- From undecidability of non-triviality and finiteness to undecidability of learnability
- A note on hardness of computing recursive teaching dimension
- When redundancy matters: machine teaching of representations
- Tournaments, Johnson graphs and NC-teaching
- Distinguishing relational pattern languages with a small number of short strings
- Optimal collusion-free teaching
- Teachability in computational learning
- Measuring teachability using variants of the teaching dimension
This page was built for publication: On the complexity of teaching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892202)
