A model of interactive teaching
From MaRDI portal
Publication:1362340
DOI10.1006/JCSS.1997.1491zbMATH Open0882.68123OpenAlexW2067905901MaRDI QIDQ1362340FDOQ1362340
Authors: H. David Mathias 
Publication date: 3 August 1997
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fee760aa84f07c30498e4e140867c24a0bdb5185
Recommendations
Cites Work
- Queries and concept learning
- On the power of inductive inference from good examples
- Oracles and queries that are sufficient for exact learning
- Teaching a smarter learner.
- Polynomial-time inference of arbitrary pattern languages
- On the complexity of teaching
- Teachability in computational learning
- Learning Binary Relations and Total Orders
- Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
- Title not available (Why is that?)
Cited In (51)
- Sorting noisy data with partial information
- On the possibilities and limitations of pseudodeterministic algorithms
- The garden-hose model
- H-wise independence
- 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
- Space-bounded communication complexity
- On the power of conditional samples in distribution testing
- Properties and applications of boolean function composition
- Teaching randomized learners with feedback
- Adversary lower bound for the k-sum problem
- Streaming computations with a loquacious prover
- Recent Developments in Algorithmic Teaching
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- New affine-invariant codes from lifting
- An energy complexity model for algorithms
- Evasiveness through a circuit lens
- On the power of many one-bit provers
- Learning and incentives in user-generated content
- Reachability in graph timelines
- Teaching a smarter learner.
- Massive online teaching to bounded learners
- Learnability of DNF with representation-specific queries
- Competing provers protocols for circuit evaluation
- On the convergence of the Hegselmann-Krause system
- Welfare maximization and the supermodular degree
- Characterizing the sample complexity of private learners
- Pseudo-partitions, transversality and locality
- Learning mixtures of spherical gaussians
- Stronger methods of making quantum interactive proofs perfectly complete
- Catch them if you can
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Approaching utopia
- An equational approach to secure multi-party computation
- Can theories be tested?
- Low-weight halfspaces for sparse boolean vectors
- Making evolution rigorous
- Sparse extractor families for all the entropy
- Towards an optimal query efficient PCP?
- Robust optimization in the presence of uncertainty
- Runtime guarantees for regression problems
- Measuring teachability using variants of the teaching dimension
- Barriers in cryptography with weak, correlated and leaky sources
- Is privacy compatible with truthfulness?
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
- Resource-based corruptions and the combinatorics of hidden diversity
- Publicly verifiable proofs of sequential work
- On the limits of efficient teachability
- Time hierarchies for sampling distributions
- A characterization of approximation resistance for even k-partite CSPs
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)
