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