A model of interactive teaching
From MaRDI portal
Publication:1362340
Recommendations
Cites work
- scientific article; zbMATH DE number 67797 (Why is no real title available?)
- Learning Binary Relations and Total Orders
- On the complexity of teaching
- On the power of inductive inference from good examples
- Oracles and queries that are sufficient for exact learning
- Polynomial-time inference of arbitrary pattern languages
- Queries and concept learning
- Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
- Teachability in computational learning
- Teaching a smarter learner.
Cited in
(50)- An energy complexity model for algorithms
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- An equational approach to secure multi-party computation
- Evasiveness through a circuit lens (extended abstract)
- Runtime guarantees for regression problems
- Recent Developments in Algorithmic Teaching
- Measuring teachability using variants of the teaching dimension
- Properties and applications of Boolean function composition
- Resource-based corruptions and the combinatorics of hidden diversity
- Reachability in graph timelines
- Time hierarchies for sampling distributions
- Teaching randomized learners with feedback
- Welfare maximization and the supermodular degree
- On the limits of efficient teachability
- 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
- Is privacy compatible with truthfulness?
- Sorting noisy data with partial information
- Space-bounded communication complexity
- A characterization of approximation resistance for even \(k\)-partite CSPs
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Stronger methods of making quantum interactive proofs perfectly complete
- Approaching utopia, strong truthfulness and externality-resistant mechanisms
- New affine-invariant codes from lifting
- On the possibilities and limitations of pseudodeterministic algorithms
- Learnability of DNF with representation-specific queries
- Catch them if you can
- On the power of many one-bit provers
- Making evolution rigorous: the error threshold
- Barriers in cryptography with weak, correlated and leaky sources
- \(H\)-wise independence
- Streaming computations with a loquacious prover
- Teaching a smarter learner.
- 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
- Competing provers protocols for circuit evaluation
- Characterizing the sample complexity of private learners
- 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
- Can theories be tested?
- Low-weight halfspaces for sparse boolean vectors
- Sparse extractor families for all the entropy
- Towards an optimal query efficient PCP?
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
- On the convergence of the Hegselmann-Krause system
- Robust optimization in the presence of uncertainty
- Adversary lower bound for the \(k\)-sum problem
This page was built for publication: A model of interactive teaching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362340)
