On the public citation graph
Robust Learning Is Rich
0 signed · 37 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.1007/3-540-60217-8openalex-snapshot
Algorithmic Learning for Knowledge-Based Systems
inferredcites →https://doi.org/10.1007/3-540-61863-5_54openalex-snapshot
Transformations that preserve learnability
inferredcites →https://doi.org/10.1007/bfb0019357openalex-snapshot
Inductive inference of recursive functions: Qualitative theory
inferredcites →https://doi.org/10.1016/0304-3975(83)90061-0openalex-snapshot
Comparison of identification criteria for machine inductive inference
inferredcites →https://doi.org/10.1016/0890-5401(88)90046-6openalex-snapshot
Probability and plurality for aggregations of learning machines
inferredcites →https://doi.org/10.1016/c2009-0-27695-1openalex-snapshot
Proceedings of the Second Annual Workshop on Computational Learning Theory
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1016/s0019-9958(75)90261-2openalex-snapshot
Toward a mathematical theory of inductive inference
inferredcites →https://doi.org/10.1016/s0019-9958(86)80025-0openalex-snapshot
Aggregating inductive expertise
inferredcites →https://doi.org/10.1016/s0020-0255(80)80006-5openalex-snapshot
Research in the theory of inductive inference by GDR mathematicians—A survey
inferredcites →https://doi.org/10.1016/s0304-3975(01)00086-xopenalex-snapshot
Avoiding coding tricks by hyperrobust learning
inferredcites →https://doi.org/10.1109/fscs.1990.89560openalex-snapshot
Robust separations in inductive inference
inferredcites →https://doi.org/10.1145/279943openalex-snapshot
Proceedings of the eleventh annual conference on Computational learning theory
inferredcites →https://doi.org/10.1145/279943.279952openalex-snapshot
Robust learning aided by context
inferredcites →https://doi.org/10.1145/279943.279982openalex-snapshot
On the power of learning robustly
inferredcites →https://doi.org/10.1145/321386.321395openalex-snapshot
A Machine-Independent Theory of the Complexity of Recursive Functions
inferredcites →https://doi.org/10.1145/322344.322356openalex-snapshot
The Power of Pluralism for Automatic Program Synthesis
inferredcites →https://doi.org/10.1145/356914.356918openalex-snapshot
Inductive Inference: Theory and Methods
inferredcites →https://doi.org/10.5555/93335.93369openalex-snapshot
On the role of search for learning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_10openalex-snapshot
Robust Learning — Rich and Poor
inferred← citeshttps://doi.org/10.1007/978-0-387-30164-8_160openalex-snapshot
Connections Between Inductive Inference and Machine Learning
inferred← citeshttps://doi.org/10.1007/978-1-4615-0755-0_9openalex-snapshot
A Tour of Robust Learning
inferred← citeshttps://doi.org/10.1007/978-1-4899-7502-7_52-1openalex-snapshot
Connections Between Inductive Inference and Machine Learning
inferred← citeshttps://doi.org/10.1007/978-1-4899-7687-1_52openalex-snapshot
Connections Between Inductive Inference and Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-45167-9_52openalex-snapshot
Learning All Subfunctions of a Function
inferred← citeshttps://doi.org/10.1007/978-3-642-24412-4_8openalex-snapshot
Robust Learning of Automatic Classes of Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-49192-8_3openalex-snapshot
Learning Automatic Families of Languages
inferred← citeshttps://doi.org/10.1007/springerreference_178872openalex-snapshot
Connections Between Inductive Inference and Machine Learning
inferred← citeshttps://doi.org/10.1016/j.ic.2004.03.003openalex-snapshot
Learning all subfunctions of a function
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.10.005openalex-snapshot
Robust learning—rich and poor
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.12.002openalex-snapshot
Robust learning of automatic classes of languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.021openalex-snapshot
Learning recursive functions: A survey
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00405-4openalex-snapshot
Learning classes of approximations to non-recursive functions
inferred← citeshttps://doi.org/10.2178/jsl/1305810752openalex-snapshot
Robust separations in inductive inference
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.