On the public citation graph

Implementing Valiant's Learnability Theory Using Random Sets

https://doi.org/10.1007/bf00994005
0 signed · 35 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1994.1097openalex-snapshot
Predicting {0, 1}-Functions on Randomly Drawn Points
inferredcites →https://doi.org/10.1007/bf00115895openalex-snapshot
Boolean feature discovery in empirical learning
inferredcites →https://doi.org/10.1007/bf00116251openalex-snapshot
Induction of Decision Trees
inferredcites →https://doi.org/10.1007/bf00116828openalex-snapshot
Queries and Concept Learning
inferredcites →https://doi.org/10.1016/0004-3702(82)90040-6openalex-snapshot
Generalization as search
inferredcites →https://doi.org/10.1016/0004-3702(88)90002-1openalex-snapshot
Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50040-4openalex-snapshot
Generalization as Search
inferredcites →https://doi.org/10.1016/b978-0-934613-41-5.50010-6openalex-snapshot
Quasi-Darwinian Learning in a Classifier System
inferredcites →https://doi.org/10.1016/b978-0-934613-64-4.50019-0openalex-snapshot
An Empirical Comparison of Genetic and Decision-Tree Classifiers
inferredcites →https://doi.org/10.1016/b978-1-55860-141-3.50022-5openalex-snapshot
NEWBOOLE: A Fast GBML System
inferredcites →https://doi.org/10.1023/a:1022611825350openalex-snapshot
Boolean Feature Discovery in Empirical Learning
inferredcites →https://doi.org/10.1109/sfcs.1988.21928openalex-snapshot
Predicting (0, 1)-functions on randomly drawn points
inferredcites →https://doi.org/10.1109/sfcs.1988.21930openalex-snapshot
Results on learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1145/1968.1972openalex-snapshot
A theory of the learnable
inferredcites →https://doi.org/10.1145/3749740.3749746openalex-snapshot
A Theory of the Learnable
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1162/neco.1989.1.1.151openalex-snapshot
What Size Net Gives Valid Generalization?
inferredcites →https://doi.org/10.2307/2314609openalex-snapshot
An Introduction to Probability Theory and Its Applications.
inferredcites →https://doi.org/10.5555/93025.93043openalex-snapshot
Results on learnability and the Vapnick-Chervonenkis dimension
inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot
Adaptation in Natural and Artificial Systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-540-24855-2_93openalex-snapshot
High Classification Accuracy Does Not Imply Effective Genetic Search
inferred← citeshttps://doi.org/10.1007/978-3-540-40029-5_6openalex-snapshot
XCS’s Strength-Based Twin: Part II
inferred← citeshttps://doi.org/10.1007/978-981-97-5333-8_3openalex-snapshot
Probabilistic Framework
inferred← citeshttps://doi.org/10.1007/bf00114010openalex-snapshot
Rigorous learning curve bounds from statistical mechanics
inferred← citeshttps://doi.org/10.1007/bf00994111openalex-snapshot
A Framework for Average Case Analysis of Conjunctive Learning Algorithms
inferred← citeshttps://doi.org/10.1016/j.omega.2004.07.012openalex-snapshot
A spanning heuristic for the unordered and ordered matching identification problem
inferred← citeshttps://doi.org/10.1016/s0305-0548(98)00042-2openalex-snapshot
Information availability vs. solution space size in a knowledge acquisition problem
inferred← citeshttps://doi.org/10.1023/a:1011265010691openalex-snapshot
SPT: a stochastic tunneling algorithm for global optimization
inferred← citeshttps://doi.org/10.1023/a:1026499208981openalex-snapshot
Rigorous Learning Curve Bounds from Statistical Mechanics
inferred← citeshttps://doi.org/10.1109/21.120073openalex-snapshot
Robotic learning from distributed sensory sources
inferred← citeshttps://doi.org/10.1109/itw.2013.6691252openalex-snapshot
An impossibility result for high dimensional supervised learning
inferred← citeshttps://doi.org/10.1145/180139.181018openalex-snapshot
Rigorous learning curve bounds from statistical mechanics
inferred← citeshttps://doi.org/10.1162/106365606776022760openalex-snapshot
A Study of Structural and Parametric Learning in XCS
inferred← citeshttps://doi.org/10.1613/jair.227openalex-snapshot
OPUS: An Efficient Admissible Algorithm for Unordered Search
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.