On the public citation graph
Teachability in computational learning
0 signed · 108 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1145/28395.28426openalex-snapshot
On the learnability of Boolean formulae
inferredcites →https://doi.org/10.1145/48014.63140openalex-snapshot
Computational limitations on learning from examples
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.5555/93025.93040openalex-snapshot
Equivalence of models for polynomial learnability
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1997.1491openalex-snapshot
A Model of Interactive Teaching
inferred← citeshttps://doi.org/10.1007/11503415_45openalex-snapshot
Teaching Classes with High Teaching Dimension Using Few Examples
inferred← citeshttps://doi.org/10.1007/11564089_36openalex-snapshot
Teaching Learners with Restricted Mind Changes
inferred← citeshttps://doi.org/10.1007/11894841_11openalex-snapshot
Teaching Memoryless Randomized Learners Without Feedback
inferred← citeshttps://doi.org/10.1007/3-540-56602-3_137openalex-snapshot
Getting order independence in incremental learning
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_86openalex-snapshot
Combinatorial results on the complexity of teaching and learning
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_81openalex-snapshot
Language learning from good examples
inferred← citeshttps://doi.org/10.1007/3-540-62685-9_16openalex-snapshot
learning pattern languages using queries
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_36openalex-snapshot
On exploiting knowledge and concept use in learning theory
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_40openalex-snapshot
PAC learning under helpful distributions
inferred← citeshttps://doi.org/10.1007/978-1-4471-7452-3_3openalex-snapshot
Elements of Computational Learning Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-24886-4_11openalex-snapshot
The Teaching Complexity of Erasing Pattern Languages with Bounded Variable Frequency
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_43openalex-snapshot
Distinguishing Pattern Languages with Membership Examples
inferred← citeshttps://doi.org/10.1007/978-3-319-24486-0_7openalex-snapshot
On the Teaching Complexity of Linear Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_26openalex-snapshot
Teaching and Compressing for Low VC-Dimension
inferred← citeshttps://doi.org/10.1007/978-3-319-46379-7_10openalex-snapshot
Classifying the Arithmetical Complexity of Teaching Models
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_1openalex-snapshot
Recent Developments in Algorithmic Teaching
inferred← citeshttps://doi.org/10.1007/978-3-642-16108-7_19openalex-snapshot
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-34106-9_11openalex-snapshot
Sauer’s Bound for a Notion of Teaching Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-40935-6_13openalex-snapshot
Order Compression Schemes
inferred← citeshttps://doi.org/10.1007/bfb0033342openalex-snapshot
Characteristic sets for polynomial grammatical inference
inferred← citeshttps://doi.org/10.1007/s00138-009-0232-9openalex-snapshot
Improving mixture of experts for view-independent face recognition using teacher-directed learning
inferred← citeshttps://doi.org/10.1007/s10994-019-05821-2openalex-snapshot
The teaching size: computable teachers and learners for universal languages
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00007-zopenalex-snapshot
On specifying Boolean functions by labelled examples
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103182openalex-snapshot
The complexity of exact learning of acyclic conditional preference networks from swap examples
inferred← citeshttps://doi.org/10.1016/j.cviu.2007.10.003openalex-snapshot
Teacher-directed learning in view-independent face recognition with mixture of experts using overlapping eigenspaces
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.011openalex-snapshot
A Boolean measure of similarity
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.08.045openalex-snapshot
Optimization problems for machine learning: A survey
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.005openalex-snapshot
Teaching randomized learners with feedback
inferred← citeshttps://doi.org/10.1016/j.ic.2017.08.003openalex-snapshot
Distinguishing pattern languages with membership examples
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2007.06.004openalex-snapshot
Teacher-directed learning in view-independent face recognition with mixture of experts using single-view eigenspaces
inferred← citeshttps://doi.org/10.1016/j.patcog.2023.109672openalex-snapshot
Time-constrained learning
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.025openalex-snapshot
Measuring teachability using variants of the teaching dimension
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.09.024openalex-snapshot
Algebraic methods proving Sauer's bound for teaching complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.024openalex-snapshot
On the teaching complexity of linear sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.034openalex-snapshot
Exact learning from an honest teacher that answers membership queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.11.009openalex-snapshot
The power of random counterexamples
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.11.011openalex-snapshot
Finitely distinguishable erasing pattern languages
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00137-5openalex-snapshot
On the limits of efficient teachability
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00131-6openalex-snapshot
On the learnability of recursively enumerable languages from good examples
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00003-2openalex-snapshot
Decision lists and related Boolean functions
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00241-1openalex-snapshot
Approximate testing and its relationship to learning
inferred← citeshttps://doi.org/10.1023/a:1007353007695openalex-snapshot
Characteristic Sets for Polynomial Grammatical Inference
inferred← citeshttps://doi.org/10.1023/a:1018955906119openalex-snapshot
Learning recursive languages from good examples
inferred← citeshttps://doi.org/10.1023/a:1022854802097openalex-snapshot
Learning from Different Teachers
inferred← citeshttps://doi.org/10.1051/ita:2001112openalex-snapshot
PAC Learning under Helpful Distributions
inferred← citeshttps://doi.org/10.1109/focs.2015.12openalex-snapshot
Compressing and Teaching for Low VC-Dimension
inferred← citeshttps://doi.org/10.1109/iccct2.2017.7972312openalex-snapshot
Learnability of language identification using antithetical reply
inferred← citeshttps://doi.org/10.1109/icra57147.2024.10610720openalex-snapshot
Multi-Agent Strategy Explanations for Human-Robot Collaboration
inferred← citeshttps://doi.org/10.1109/ijcnn.2019.8851811openalex-snapshot
Collaborative and Privacy-Preserving Machine Teaching via Consensus Optimization
inferred← citeshttps://doi.org/10.1109/tcyb.2017.2773562openalex-snapshot
Ensemble Teaching for Hybrid Label Propagation
inferred← citeshttps://doi.org/10.1109/tnnls.2016.2514360openalex-snapshot
Label Propagation via Teaching-to-Learn and Learning-to-Teach
inferred← citeshttps://doi.org/10.1109/tnnls.2023.3256412openalex-snapshot
Distribution Matching for Machine Teaching
inferred← citeshttps://doi.org/10.1145/130385.130420openalex-snapshot
On exact specification by examples
inferred← citeshttps://doi.org/10.1145/225058.225114openalex-snapshot
How many queries are needed to learn?
inferred← citeshttps://doi.org/10.1145/225298.225315openalex-snapshot
Being taught can be faster than asking questions
inferred← citeshttps://doi.org/10.1145/225298.225325openalex-snapshot
DNF---if you can't learn'em, teach'em
inferred← citeshttps://doi.org/10.1145/234752.234755openalex-snapshot
How many queries are needed to learn?
inferred← citeshttps://doi.org/10.1145/2422436.2422438openalex-snapshot
Massive online teaching to bounded learners
inferred← citeshttps://doi.org/10.1145/2463664.2465220openalex-snapshot
Learning and verifying quantified boolean queries by example
inferred← citeshttps://doi.org/10.1145/267460.267515openalex-snapshot
Teachers, learners and black boxes
inferred← citeshttps://doi.org/10.1145/2688073.2688115openalex-snapshot
The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data
inferred← citeshttps://doi.org/10.1145/307400.307413openalex-snapshot
An apprentice learning model (extended abstract)
inferred← citeshttps://doi.org/10.1145/3345120.3345147openalex-snapshot
Machines Learning Trends, Perspectives and Prospects in Education Sector
inferred← citeshttps://doi.org/10.1145/3490099.3511117openalex-snapshot
Deep Learning Uncertainty in Machine Teaching
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.2733openalex-snapshot
Teachability of a Subclass of Simple Deterministic Languages
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9761openalex-snapshot
Machine Teaching: An Inverse Problem to Machine Learning and an Approach Toward Optimal Education
inferred← citeshttps://doi.org/10.1609/aaai.v35i12.17306openalex-snapshot
The Sample Complexity of Teaching by Reinforcement on Q-Learning
inferred← citeshttps://doi.org/10.1609/aaai.v35i7.16732openalex-snapshot
Teaching Active Human Learners
inferred← citeshttps://doi.org/10.17771/pucrio.acad.63896openalex-snapshot
APRENDIZADO COM RESTRIÇÃO DE TEMPO: PROBLEMAS DE CLASSIFICAÇÃO
inferred← citeshttps://doi.org/10.2139/ssrn.6508316openalex-snapshot
The No-Clash Teaching Dimension is Bounded by VC Dimension
inferred← citeshttps://doi.org/10.24963/ijcai.2017/502openalex-snapshot
No Learner Left Behind: On the Complexity of Teaching Multiple Learners Simultaneously
inferred← citeshttps://doi.org/10.24963/ijcai.2018/356openalex-snapshot
Interactive Optimal Teaching with Unknown Learners
inferred← citeshttps://doi.org/10.3389/frai.2021.625183openalex-snapshot
Teaching Multiple Inverse Reinforcement Learners
inferred← citeshttps://doi.org/10.3390/math13030451openalex-snapshot
Understanding Machine Learning Principles: Learning, Inference, Generalization, and Computational Learning Theory
inferred← citeshttps://doi.org/10.4230/dagsemproc.06111.13openalex-snapshot
On the Teachability of Randomized Learners
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2015.144openalex-snapshot
Characterizing XML Twig Queries with Examples
inferred← citeshttps://doi.org/10.48550/arxiv.1304.4303openalex-snapshot
Learning and Verifying Quantified Boolean Queries by Example
inferred← citeshttps://doi.org/10.48550/arxiv.1610.08590openalex-snapshot
Classifying the Arithmetical Complexity of Teaching Models
inferred← citeshttps://doi.org/10.48550/arxiv.1702.05677openalex-snapshot
Quadratic Upper Bound for Recursive Teaching Dimension of Finite VC Classes
inferred← citeshttps://doi.org/10.48550/arxiv.1802.08946openalex-snapshot
Teacher Improves Learning by Selecting a Training Subset
inferred← citeshttps://doi.org/10.48550/arxiv.1911.13009openalex-snapshot
Class Teaching for Inverse Reinforcement Learners
inferred← citeshttps://doi.org/10.48550/arxiv.2309.02876openalex-snapshot
Non-Clashing Teaching Maps for Balls in Graphs
inferred← citeshttps://doi.org/10.5555/2627435.2697064openalex-snapshot
Recursive teaching dimension, VC-dimension and sample compression
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.