Recent Developments in Algorithmic Teaching

DOI10.1007/978-3-642-00982-2_1zbMath1234.68165MaRDI QIDQ3618563

Frank J. Balbach, Thomas Zeugmann

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_1

Mathematics Subject Classification ID

68Q32: Computational learning theory

Related Items

Logic and Learning, The teaching size: computable teachers and learners for universal languages, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Teachability in computational learning
• Measuring teachability using variants of the teaching dimension
• Teaching a smarter learner.
• 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
• Queries revisited.
• On the complexity of teaching
• On specifying Boolean functions by labelled examples
• Witness sets for families of binary vectors
• Learning Binary Relations and Total Orders
• A threshold of ln n for approximating set cover
• Teaching Memoryless Randomized Learners Without Feedback
• DNF Are Teachable in the Average Case
• Teaching Randomized Learners
• Algorithmic Learning Theory
• Learning Theory
• On the learnability of recursively enumerable languages from good examples