Teaching a smarter learner.
From MaRDI portal
Publication:960469
DOI10.1006/jcss.1996.0020zbMath1152.68451OpenAlexW1996389440MaRDI QIDQ960469
Sally A. Goldman, H. David Mathias
Publication date: 21 December 2008
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://openscholarship.wustl.edu/cgi/viewcontent.cgi?article=1307&context=cse_research
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (69)
PACS, simple-PAC and query learning ⋮ A model of interactive teaching ⋮ Knowing what doesn't matter: exploiting the omission of irrelevant data ⋮ Combinatorial results on the complexity of teaching and learning ⋮ Inferring Symbolic Automata ⋮ Efficiently identifying deterministic real-time automata from labeled data ⋮ Concurrent Kleene algebra with observations: from hypotheses to completeness ⋮ Teaching and Compressing for Low VC-Dimension ⋮ On the teaching complexity of linear sets ⋮ Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries ⋮ Measuring teachability using variants of the teaching dimension ⋮ Massive online teaching to bounded learners ⋮ Learning mixtures of spherical gaussians ⋮ Low-weight halfspaces for sparse boolean vectors ⋮ Learnability of DNF with representation-specific queries ⋮ Can theories be tested? ⋮ Making evolution rigorous ⋮ 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 ⋮ 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 ⋮ Learning and incentives in user-generated content ⋮ 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 ⋮ Competing provers protocols for circuit evaluation ⋮ Catch them if you can ⋮ Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints ⋮ 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 ⋮ On the power of conditional samples in distribution testing ⋮ Polynomial Identification of $$\omega $$-Automata ⋮ PAC Learning under Helpful Distributions ⋮ 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 ⋮ Teacher-directed learning in view-independent face recognition with mixture of experts using single-view eigenspaces ⋮ Decision lists and related Boolean functions ⋮ Finitely distinguishable erasing pattern languages ⋮ Recent Developments in Algorithmic Teaching ⋮ Types of Trusted Information That Make DFA Identification with Correction Queries Feasible ⋮ The complexity of universal text-learners. ⋮ On the limits of efficient teachability
This page was built for publication: Teaching a smarter learner.
