On the public citation graph

A New Abstract Combinatorial Dimension for Exact Learning via Queries

0 signed · 36 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/jcss.1995.1003openalex-snapshot
On the Complexity of Teaching
inferredcites →https://doi.org/10.1006/jcss.1996.0032openalex-snapshot
Oracles and Queries That Are Sufficient for Exact Learning
inferredcites →https://doi.org/10.1007/3-540-49292-5_8openalex-snapshot
Uniform Characterizations of Polynomial-Query Learnabilities
inferredcites →https://doi.org/10.1007/3-540-61863-5_38openalex-snapshot
The complexity of exactly learning algebraic concepts
inferredcites →https://doi.org/10.1007/bf00116034openalex-snapshot
Negative Results for Equivalence Queries
inferredcites →https://doi.org/10.1007/bf00116828openalex-snapshot
Queries and Concept Learning
inferredcites →https://doi.org/10.1007/bf00996269openalex-snapshot
On the Learnability of Disjunctive Normal Form Formulas
inferredcites →https://doi.org/10.1007/bf01578843openalex-snapshot
A framework for polynomial-time query learnability
inferredcites →https://doi.org/10.1016/s0020-0190(98)00090-8openalex-snapshot
Learning nearly monotone k-term DNF
inferredcites →https://doi.org/10.1016/s0020-0190(99)00063-0openalex-snapshot
Exact learning when irrelevant variables abound
inferredcites →https://doi.org/10.1016/s0304-3975(01)00400-5openalex-snapshot
The consistency dimension and distribution-dependent learning from queries
inferredcites →https://doi.org/10.1016/s0304-3975(99)00266-2openalex-snapshot
Exact learning via teaching assistants
inferredcites →https://doi.org/10.1016/s0890-5401(02)00030-5openalex-snapshot
Learning from examples with unspecified attribute values
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.1989.63488openalex-snapshot
On the complexity of learning from counterexamples
inferredcites →https://doi.org/10.1145/234752.234755openalex-snapshot
How many queries are needed to learn?
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.5555/93335.93352openalex-snapshot
Learning read-once formulas using membership queries

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11564089_17openalex-snapshot
Learning DNF by Statistical and Proper Distance Queries Under the Uniform Distribution
inferred← citeshttps://doi.org/10.1007/11894841_10openalex-snapshot
How Many Query Superpositions Are Needed to Learn?
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_23openalex-snapshot
A General Dimension for Exact Learning
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/978-0-387-30162-4_66openalex-snapshot
Certificate Complexity and Exact Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_34openalex-snapshot
A Characterization of Strong Learnability in the Statistical Query Model
inferred← citeshttps://doi.org/10.1007/978-3-540-87987-9_26openalex-snapshot
Query Learning and Certificates in Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-14888-0_28openalex-snapshot
Computing Minimal Models by Positively Minimal Disjuncts
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_66-2openalex-snapshot
Certificate Complexity and Exact 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.1016/j.jcss.2007.03.003openalex-snapshot
A general dimension for query learning
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.11.004openalex-snapshot
Queries revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.016openalex-snapshot
The complexity of learning concept classes with polynomial general dimension
inferred← citeshttps://doi.org/10.1109/cdc.2016.7799449openalex-snapshot
Information acquisition and sequential belief refinement
inferred← citeshttps://doi.org/10.1109/tit.2015.2432101openalex-snapshot
Bayesian Active Learning With Non-Persistent Noise
inferred← citeshttps://doi.org/10.1145/1273496.1273541openalex-snapshot
A bound on the label complexity of agnostic active learning
inferred← citeshttps://doi.org/10.1561/2200000037openalex-snapshot
Theory of Disagreement-Based Active Learning
inferred← citeshttps://doi.org/10.3390/e25040547openalex-snapshot
Applications of Depth Minimization of Decision Trees Containing Hypotheses for Multiple-Value Decision Tables
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.