On the public citation graph
Lower Bound Methods and Separation Results for On-Line Learning Models
0 signed · 110 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/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1007/bf00116034openalex-snapshot
Negative Results for Equivalence Queries
inferredcites →https://doi.org/10.1007/bf00116035openalex-snapshot
Polynomial Time Learnability of Simple Deterministic Languages
inferredcites →https://doi.org/10.1007/bf00992675openalex-snapshot
Learning conjunctions of Horn clauses
inferredcites →https://doi.org/10.1016/0097-3165(72)90019-2openalex-snapshot
On the density of families of sets
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1016/s0019-9958(81)90090-5openalex-snapshot
A note on the number of queries needed to identify regular languages
inferredcites →https://doi.org/10.1023/a:1022869011914openalex-snapshot
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
inferredcites →https://doi.org/10.1090/chel/361openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1109/fscs.1990.89539openalex-snapshot
On the complexity of learning from counterexamples and membership queries
inferredcites →https://doi.org/10.1109/sfcs.1987.36openalex-snapshot
Learning one-counter languages in polynomial time
inferredcites →https://doi.org/10.1109/sfcs.1987.37openalex-snapshot
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
inferredcites →https://doi.org/10.1109/sfcs.1989.63454openalex-snapshot
Learning binary relations and total orders
inferredcites →https://doi.org/10.1109/sfcs.1989.63488openalex-snapshot
On the complexity of learning from counterexamples
inferredcites →https://doi.org/10.1137/0217007openalex-snapshot
Sorting and Recognition Problems for Ordered Sets
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/138027.138061openalex-snapshot
Learning read-once formulas with queries
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.2140/pjm.1972.41.247openalex-snapshot
A combinatorial problem; stability and order for models and theories in infinitary languages
inferredcites →https://doi.org/10.5555/114836.114852openalex-snapshot
On-line learning with an oblivious environment and the power of randomization
inferredcites →https://doi.org/10.7551/mitpress/5236.001.0001openalex-snapshot
Parallel Distributed Processing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1997.2686openalex-snapshot
Efficient Learning with Virtual Threshold Gates
inferred← citeshttps://doi.org/10.1006/inco.1998.2737openalex-snapshot
Noise-Tolerant Parallel Learning of Geometric Concepts
inferred← citeshttps://doi.org/10.1006/inco.2001.3065openalex-snapshot
The Query Complexity of Finding Local Minima in the Lattice
inferred← citeshttps://doi.org/10.1006/jcss.1999.1638openalex-snapshot
Structural Results about Exact Learning with Unspecified Attribute Values
inferred← citeshttps://doi.org/10.1007/11776420_16openalex-snapshot
On Optimal Learning Algorithms for Multiplicity Automata
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_25openalex-snapshot
Limitations of Learning via Embeddings in Euclidean Half-Spaces
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_26openalex-snapshot
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces
inferred← citeshttps://doi.org/10.1007/3-540-44668-0_36openalex-snapshot
Product Unit Neural Networks with Constant Depth and Superlinear VC Dimension
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_31openalex-snapshot
How Many Missing Answers Can Be Tolerated by Query Learners?
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_53openalex-snapshot
Learnability and Definability in Trees and Similar Structures
inferred← citeshttps://doi.org/10.1007/3-540-49730-7_26openalex-snapshot
On the Sample Complexity for Neural Trees
inferred← citeshttps://doi.org/10.1007/3-540-49730-7_5openalex-snapshot
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_53openalex-snapshot
A survey of some aspects of computational learning theory
inferred← citeshttps://doi.org/10.1007/3-540-56004-1_2openalex-snapshot
A solution of the credit assignment problem in the case of learning rectangles
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-60454-5_29openalex-snapshot
Learning unions of tree patterns using queries
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_59openalex-snapshot
Learning acyclic first-order horn sentences from entailment
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_60openalex-snapshot
On learning disjunctions of zero-one threshold functions with queries
inferred← citeshttps://doi.org/10.1007/978-1-4612-0367-4_27openalex-snapshot
Learnability Models and Vapnik-Chervonenkis Combinatorics
inferred← citeshttps://doi.org/10.1007/978-1-4615-2696-4_8openalex-snapshot
Perspectives of Current Research about the Complexity of Learning on Neural Nets
inferred← citeshttps://doi.org/10.1007/978-3-031-08585-7_7openalex-snapshot
Infinite Binary Information Systems. Decision Trees of Types 1, 2, and 3
inferred← citeshttps://doi.org/10.1007/978-3-031-08585-7_9openalex-snapshot
Infinite Families of Concepts
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/bf00993410openalex-snapshot
On the complexity of function learning
inferred← citeshttps://doi.org/10.1007/bf00993471openalex-snapshot
On-Line Learning of Rectangles and Unions of Rectangles
inferred← citeshttps://doi.org/10.1007/bf00993976openalex-snapshot
Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts
inferred← citeshttps://doi.org/10.1007/bf00993977openalex-snapshot
The power of self-directed learning
inferred← citeshttps://doi.org/10.1007/s00224-003-1112-8openalex-snapshot
Learnability and Definability in Trees and Similar Structures
inferred← citeshttps://doi.org/10.1007/s10994-006-8261-3openalex-snapshot
Complexity parameters for first order classes
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00019-4openalex-snapshot
The bounded injury priority method and the learnability of unions of rectangles
inferred← citeshttps://doi.org/10.1016/b978-1-55860-377-6.50054-2openalex-snapshot
Efficient Learning with Virtual Threshold Gates
inferred← citeshttps://doi.org/10.1016/j.artint.2004.01.002openalex-snapshot
Theory revision with queries: Horn, read-once, and parity formulas
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.019openalex-snapshot
Learning conditional preference networks
inferred← citeshttps://doi.org/10.1016/j.ic.2006.03.001openalex-snapshot
Polynomial certificates for propositional classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.034openalex-snapshot
Revising threshold functions
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/s0166-218x(96)00025-xopenalex-snapshot
VC-dimensions of finite automata and commutative finite automata with k letters and n states
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00050-9openalex-snapshot
VC-dimensions of finite automata and commutative finite automata with k letters and n states
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00223-1openalex-snapshot
General lower bounds on the query complexity within the exact learning model
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00417-6openalex-snapshot
Learning elementary formal systems with queries
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00015-7openalex-snapshot
Learning unions of tree patterns using queries
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70034-5openalex-snapshot
Computational Learning Theory for Artificial Neural Networks
inferred← citeshttps://doi.org/10.1023/a:1007311411259openalex-snapshot
Malicious Omissions and Errors in Answers to Membership Queries
inferred← citeshttps://doi.org/10.1023/a:1007320031970openalex-snapshot
Exact Learning of Formulas in Parallel
inferred← citeshttps://doi.org/10.1023/a:1007510732151openalex-snapshot
Self-Directed Learning and Its Relation to the VC-Dimension and to Teacher-Directed Learning
inferred← citeshttps://doi.org/10.1023/a:1007609822199openalex-snapshot
On the Sample Complexity for Nonoverlapping Neural Networks
inferred← citeshttps://doi.org/10.1023/a:1007610422992openalex-snapshot
Learning Function-Free Horn Expressions
inferred← citeshttps://doi.org/10.1023/a:1007614417594openalex-snapshot
Structural Results About On-line Learning Models With and Without Queries
inferred← citeshttps://doi.org/10.1023/a:1022605628675openalex-snapshot
The Power of Self-Directed Learning
inferred← citeshttps://doi.org/10.1023/a:1022851430087openalex-snapshot
On the Complexity of Function Learning
inferred← citeshttps://doi.org/10.1023/a:1022905618164openalex-snapshot
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365705openalex-snapshot
On learning discretized geometric concepts
inferred← citeshttps://doi.org/10.1137/s0097539794274246openalex-snapshot
Exact Learning of Discretized Geometric Concepts
inferred← citeshttps://doi.org/10.1145/168304.168310openalex-snapshot
Asking questions to minimize errors
inferred← citeshttps://doi.org/10.1145/168304.168342openalex-snapshot
Learning unions of two rectangles in the plane with equivalence queries
inferred← citeshttps://doi.org/10.1145/168304.168382openalex-snapshot
Lower bounds for PAC learning with queries
inferred← citeshttps://doi.org/10.1145/168304.168384openalex-snapshot
On the complexity of function learning
inferred← citeshttps://doi.org/10.1145/180139.181102openalex-snapshot
Learning unions of boxes with membership and equivalence queries
inferred← citeshttps://doi.org/10.1145/180139.181124openalex-snapshot
Geometrical concept learning and convex polytopes
inferred← citeshttps://doi.org/10.1145/180139.181128openalex-snapshot
Learning with queries but incomplete information (extended abstract)
inferred← citeshttps://doi.org/10.1145/225298.225311openalex-snapshot
Generalized teaching dimensions and the query complexity of learning
inferred← citeshttps://doi.org/10.1145/225298.225340openalex-snapshot
Noise-tolerant parallel learning of geometric concepts
inferred← citeshttps://doi.org/10.1145/279943.279974openalex-snapshot
Structural results about exact learning with unspecified attribute values
inferred← citeshttps://doi.org/10.1145/279943.280000openalex-snapshot
The query complexity of finding local minima in the lattice
inferred← citeshttps://doi.org/10.1145/307400.307411openalex-snapshot
On theory revision with queries
inferred← citeshttps://doi.org/10.1162/08997660252741121openalex-snapshot
On the Complexity of Computing and Learning with Multiplicative Neural Networks
inferred← citeshttps://doi.org/10.1201/9781584888239-c26openalex-snapshot
Computational Learning Theory
inferred← citeshttps://doi.org/10.3390/e24010116openalex-snapshot
On the Depth of Decision Trees with Hypotheses
inferred← citeshttps://doi.org/10.48550/arxiv.1710.05422openalex-snapshot
A General Framework for Robust Interactive Learning
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.