Teachability in computational learning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A theory of the learnable
- Approximation algorithms for combinatorial problems
- Computational limitations on learning from examples
- Equivalence of models for polynomial learnability
- Learnability and the Vapnik-Chervonenkis dimension
Cited in
(77)- A note on hardness of computing recursive teaching dimension
- An energy complexity model for algorithms
- Algebraic methods proving Sauer's bound for teaching complexity
- 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
- Evasiveness through a circuit lens (extended abstract)
- Queries revisited.
- Runtime guarantees for regression problems
- A theory of formal synthesis via inductive learning
- Recent Developments in Algorithmic Teaching
- 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
- Reachability in graph timelines
- Time hierarchies for sampling distributions
- Teaching randomized learners with feedback
- Welfare maximization and the supermodular degree
- 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
- 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
- Is privacy compatible with truthfulness?
- Sorting noisy data with partial information
- PAC learning under helpful distributions
- On the complexity of teaching
- 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
- On specifying Boolean functions by labelled examples
- New affine-invariant codes from lifting
- On the possibilities and limitations of pseudodeterministic algorithms
- 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
- On the power of many one-bit provers
- Making evolution rigorous: the error threshold
- Barriers in cryptography with weak, correlated and leaky sources
- A model of interactive teaching
- \(H\)-wise independence
- Streaming computations with a loquacious prover
- The teaching size: computable teachers and learners for universal languages
- Learning and incentives in user-generated content: multi-armed bandits with endogenous arms
- Publicly verifiable proofs of sequential work
- Teacher-directed learning in view-independent face recognition with mixture of experts using single-view eigenspaces
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Distinguishing pattern languages with membership examples
- Competing provers protocols for circuit evaluation
- 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
- On the learnability of recursively enumerable languages from good examples
- 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
- 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
This page was built for publication: Teachability in computational learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749233)
