Teaching a smarter learner.
From MaRDI portal
Recommendations
Cited in
(86)- Knowing what doesn't matter: exploiting the omission of irrelevant data
- A model of interactive teaching
- Learning from different teachers
- On the limits of efficient teachability
- On the teaching complexity of linear sets
- The complexity of universal text-learners.
- Learning from a consistently ignorant teacher
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Teacher-directed learning in view-independent face recognition with mixture of experts using single-view eigenspaces
- Finitely distinguishable erasing pattern languages
- On the right path: a modal logic for supervised learning
- The teaching size: computable teachers and learners for universal languages
- Teachers, learners, and oracles
- Smart PAC-learners
- PAC learning under helpful distributions
- PACS, simple-PAC and query learning
- Massive online teaching to bounded learners
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- Low-weight halfspaces for sparse boolean vectors
- Learnability of DNF with representation-specific queries
- Can theories be tested?
- Making evolution rigorous: the error threshold
- 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 (extended abstract)
- 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, strong truthfulness and externality-resistant mechanisms
- Learning and incentives in user-generated content: multi-armed bandits with endogenous arms
- 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, a combinatorial characterization for the space measure in algebraic proof systems
- Competing provers protocols for circuit evaluation
- Catch them if you can
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
- 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
- Types of trusted information that make DFA identification with correction queries feasible
- Teaching Memoryless Randomized Learners Without Feedback
- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
- Recent Developments in Algorithmic Teaching
- Learning and teaching as a game: A sabotage approach
- Efficiently identifying deterministic real-time automata from labeled data
- Teaching and Compressing for Low VC-Dimension
- Combinatorial results on the complexity of teaching and learning
- Polynomial identification of \(\omega \)-automata
- Teaching Randomized Learners
- Preference-based teaching
- Algorithmic Learning Theory
- Models of cooperative teaching and learning
- Teaching randomized learners with feedback
- The efficiency of identifying timed automata and the power of clocks
- On the learnability of recursively enumerable languages from good examples
- Decision lists and related Boolean functions
- Heuristic search of optimal machine teaching curricula
- Inferring Symbolic Automata
- Tournaments, Johnson graphs and NC-teaching
- Distinguishing relational pattern languages with a small number of short strings
- Optimal collusion-free teaching
- Constructing concise characteristic samples for acceptors of omega regular languages
- Teachability in computational learning
- Measuring teachability using variants of the teaching dimension
This page was built for publication: Teaching a smarter learner.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960469)
