On the public citation graph
Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts
0 signed · 56 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.1006/inco.1995.1051openalex-snapshot
Fast Identification of Geometric Objects with Membership Queries
inferredcites →https://doi.org/10.1007/bf00992674openalex-snapshot
Lower Bound Methods and Separation Results for On-Line Learning Models
inferredcites →https://doi.org/10.1016/0890-5401(91)90042-zopenalex-snapshot
Equivalence of models for polynomial learnability
inferredcites →https://doi.org/10.1016/b978-0-08-094829-4.50031-3openalex-snapshot
ON THE COMPLEXITY OF LEARNING FROM COUNTEREXAMPLES
inferredcites →https://doi.org/10.1016/b978-1-55860-146-8.50037-0openalex-snapshot
ON THE COMPLEXITY OF LEARNING FROM COUNTEREXAMPLES AND MEMBERSHIP QUERIES
inferredcites →https://doi.org/10.1016/b978-1-55860-213-7.50034-1openalex-snapshot
Fast Identification of Geometric Objects with Membership Queries
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/massp.1987.1165576openalex-snapshot
An introduction to computing with neural nets
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.1989.63488openalex-snapshot
On the complexity of learning from counterexamples
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/114836.114868openalex-snapshot
Fast identification of geometric objects with membership queries
inferredcites →https://doi.org/10.7551/mitpress/5236.001.0001openalex-snapshot
Parallel Distributed Processing
inferredcites →https://doi.org/10.7551/mitpress/5237.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.1995.1051openalex-snapshot
Fast Identification of Geometric Objects with Membership Queries
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/jcss.1999.1621openalex-snapshot
The Learnability of Unions of Two Rectangles in the Two-Dimensional Discretized Space
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-56602-3_150openalex-snapshot
Can complexity theory benefit from Learning Theory?
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_187openalex-snapshot
A space-bounded learning algorithm for axis-parallel rectangles
inferred← citeshttps://doi.org/10.1007/3-540-62685-9_2openalex-snapshot
Learning boxes in high dimension
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-030-81688-9_12openalex-snapshot
Learning Union of Integer Hypercubes with Queries
inferred← citeshttps://doi.org/10.1007/bf00993471openalex-snapshot
On-Line Learning of Rectangles and Unions of Rectangles
inferred← citeshttps://doi.org/10.1007/bfb0030848openalex-snapshot
An optimal algorithm for proper learning of unions of two rectangles with queries
inferred← citeshttps://doi.org/10.1007/pl00001593openalex-snapshot
Complexity theoretic hardness results for query learning
inferred← citeshttps://doi.org/10.1007/pl00013834openalex-snapshot
PAC Learning Intersections of Halfspaces with Membership Queries
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.commatsci.2024.113097openalex-snapshot
Formation and growth of transition metal carbides in ferrite
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.025openalex-snapshot
A characterization of 2-threshold functions via pairs of prime segments
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00137-5openalex-snapshot
On the limits of efficient teachability
inferred← citeshttps://doi.org/10.1023/a:1007320031970openalex-snapshot
Exact Learning of Formulas in Parallel
inferred← citeshttps://doi.org/10.1109/hicss.2009.363openalex-snapshot
Real-Time Knowledge Discovery and Dissemination for Intelligence Analysis
inferred← citeshttps://doi.org/10.1109/iros.2015.7353866openalex-snapshot
Learning product set models of fault triggers in high-dimensional software interfaces
inferred← citeshttps://doi.org/10.1137/140991844openalex-snapshot
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
inferred← citeshttps://doi.org/10.1137/s0097539794274246openalex-snapshot
Exact Learning of Discretized Geometric Concepts
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/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/238061.238109openalex-snapshot
PAC learning intersections of halfspaces with membership queries (extended abstract)
inferred← citeshttps://doi.org/10.1145/279943.279978openalex-snapshot
Learning atomic formulas with prescribed properties
inferred← citeshttps://doi.org/10.1145/337244.337257openalex-snapshot
Learning functions represented as multiplicity automata
inferred← citeshttps://doi.org/10.12794/metadc801893openalex-snapshot
Mapping Overlapping Constellations: Nature and Technology in Research in Philosophy and Technology/Techné and Environmental Ethics
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.12openalex-snapshot
On Undecided LP, Clustering and Active Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1710.05422openalex-snapshot
A General Framework for Robust Interactive Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2105.13071openalex-snapshot
Learning Union of Integer Hypercubes with Queries (Technical Report)
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.