Measuring teachability using variants of the teaching dimension
From MaRDI portal
Publication:924171
DOI10.1016/j.tcs.2008.02.025zbMath1145.68020OpenAlexW2029731972MaRDI QIDQ924171
Publication date: 28 May 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.025
Related Items
Massive online teaching to bounded learners, Learning mixtures of spherical gaussians, Low-weight halfspaces for sparse boolean vectors, Learnability of DNF with representation-specific queries, Can theories be tested?, Making evolution rigorous, 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, 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, Learning and incentives in user-generated content, 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, Competing provers protocols for circuit evaluation, Catch them if you can, Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints, 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, On the power of conditional samples in distribution testing, Recent Developments in Algorithmic Teaching, The teaching size: computable teachers and learners for universal languages
Cites Work
- Unnamed Item
- Teachability in computational learning
- Teaching a smarter learner.
- How robust is the n-cube?
- On the power of inductive inference from good examples
- Self-directed learning and its relation to the VC-dimension and to teacher-directed learning
- A model of interactive teaching
- Learning from different teachers
- On the limits of efficient teachability
- On the complexity of teaching
- On specifying Boolean functions by labelled examples
- Witness sets for families of binary vectors
- Lower bounds on learning decision lists and trees
- Queries and concept learning
- Learning Binary Relations and Total Orders
- Probably Approximate Learning of Sets and Functions
- A theory of the learnable
- Computational limitations on learning from examples
- Combinatorial results on the complexity of teaching and learning
- DNF Are Teachable in the Average Case
- Learning Theory
- Language identification in the limit
- Decision lists and related Boolean functions
