On the public citation graph

On Metric Entropy, Vapnik-Chervonenkis Dimension, and Learnability for a Class of Distributions

0 signed · 41 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.1007/3-540-19488-6_108openalex-snapshot
Nonuniform learnability
inferredcites →https://doi.org/10.1007/978-1-4419-5821-1_26openalex-snapshot
Metric Entropy of Some Classes of Sets with Differentiable Boundaries
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-1-4612-3774-7_4openalex-snapshot
Complete Representations for Learning from Examples
inferredcites →https://doi.org/10.1007/978-94-017-2973-4_7openalex-snapshot
ε-Entropy and ε-Capacity of Sets In Functional Spaces
inferredcites →https://doi.org/10.1007/bf00058680openalex-snapshot
Learning Decision Lists
inferredcites →https://doi.org/10.1007/bf00116829openalex-snapshot
Learning From Noisy Examples
inferredcites →https://doi.org/10.1007/bf02187876openalex-snapshot
ɛ-nets and simplex range queries
inferredcites →https://doi.org/10.1016/0012-365x(81)90274-0openalex-snapshot
Some special vapnik-chervonenkis classes
inferredcites →https://doi.org/10.1016/0020-0190(87)90114-1openalex-snapshot
Occam's Razor
inferredcites →https://doi.org/10.1016/0021-9045(74)90120-8openalex-snapshot
Metric entropy of some classes of sets with differentiable boundaries
inferredcites →https://doi.org/10.1016/b978-0-934613-64-4.50044-xopenalex-snapshot
Extending the Valiant Learning Model
inferredcites →https://doi.org/10.1016/b978-0-934613-64-4.50046-3openalex-snapshot
Two New Frameworks for Learning
inferredcites →https://doi.org/10.1070/rm1963v018n05abeh004132openalex-snapshot
KOLMOGOROV'S WORK ON $ \varepsilon$-ENTROPY OF FUNCTIONAL CLASSES AND THE SUPERPOSITION OF FUNCTIONS
inferredcites →https://doi.org/10.1109/sfcs.1988.21930openalex-snapshot
Results on learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1112/plms/s3-28.4.700openalex-snapshot
Hausdorff Measure, Entropy, and the Independence of Small Sets
inferredcites →https://doi.org/10.1145/12130.12158openalex-snapshot
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1145/28395.28426openalex-snapshot
On the learnability of Boolean formulae
inferredcites →https://doi.org/10.1145/3749740.3749746openalex-snapshot
A Theory of the Learnable
inferredcites →https://doi.org/10.1145/62212.62238openalex-snapshot
Learning in the presence of malicious errors
inferredcites →https://doi.org/10.1214/aop/1176995384openalex-snapshot
Central Limit Theorems for Empirical Measures
inferredcites →https://doi.org/10.2307/2282952openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.5555/93025.93040openalex-snapshot
Equivalence of models for polynomial learnability
inferredcites →https://doi.org/10.5555/93025.93043openalex-snapshot
Results on learnability and the Vapnick-Chervonenkis dimension
inferredcites →https://doi.org/10.5555/93025.93057openalex-snapshot
Learnability by fixed distributions
inferredcites →https://doi.org/10.5555/93025.93060openalex-snapshot
Types of noise in data for concept 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/978-1-4615-5223-9_1openalex-snapshot
Sanjoy K. Mitter: A Scholar, a Gentleman, and a Friend
inferred← citeshttps://doi.org/10.1007/s00454-017-9872-0openalex-snapshot
Packing and Covering with Balls on Busemann Surfaces
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90010-dopenalex-snapshot
Decision theoretic generalizations of the PAC model for neural net and other learning applications
inferred← citeshttps://doi.org/10.1016/b978-1-55860-213-7.50008-0openalex-snapshot
Simultaneous Learning of Concepts and Simultaneous Estimation of Probabilities
inferred← citeshttps://doi.org/10.1023/a:1022627018023openalex-snapshot
Active Learning Using Arbitrary Binary Valued Queries
inferred← citeshttps://doi.org/10.1109/34.232080openalex-snapshot
PAC learning with generalized samples and an applicaiton to stochastic geometry
inferred← citeshttps://doi.org/10.1109/9.489275openalex-snapshot
Learning by canonical smooth estimation. I. Simultaneous estimation
inferred← citeshttps://doi.org/10.1109/9.489276openalex-snapshot
Learning by canonical smooth estimation. II. Learning and choice of model complexity
inferred← citeshttps://doi.org/10.1145/1273496.1273541openalex-snapshot
A bound on the label complexity of agnostic active learning
inferred← citeshttps://doi.org/10.1145/130385.130405openalex-snapshot
PAC learning with generalized samples and an application to stochastic geometry
inferred← citeshttps://doi.org/10.1145/130385.130415openalex-snapshot
Learning stochastic functions by smooth simultaneous estimation
inferred← citeshttps://doi.org/10.1561/2200000037openalex-snapshot
Theory of Disagreement-Based Active Learning
inferred← citeshttps://doi.org/10.21236/ada459598openalex-snapshot
Active Learning Using Arbitrary Binary Valued Queries
inferred← citeshttps://doi.org/10.21236/ada459600openalex-snapshot
PAC Learning with Generalized Samples and an Application to Stochastic Geometry
inferred← citeshttps://doi.org/10.5555/1756006.1756020openalex-snapshot
Classification Using Geometric Level Sets
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.