On the public citation graph
Covering numbers for real-valued function classes
0 signed · 59 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-1-4612-5254-2openalex-snapshot
Convergence of Stochastic Processes
inferredcites →https://doi.org/10.1016/0097-3165(95)90052-7openalex-snapshot
Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1016/0890-5401(92)90010-dopenalex-snapshot
Decision theoretic generalizations of the PAC model for neural net and other learning applications
inferredcites →https://doi.org/10.1016/s0166-218x(98)00012-2openalex-snapshot
A graph-theoretic generalization of the Sauer-Shelah lemma
inferredcites →https://doi.org/10.1017/s0963548300004247openalex-snapshot
Function Learning from Interpolation
inferredcites →https://doi.org/10.1023/a:1022627018023openalex-snapshot
Active Learning Using Arbitrary Binary Valued Queries
inferredcites →https://doi.org/10.1090/s0002-9904-1966-11586-0openalex-snapshot
Metric entropy and approximation
inferredcites →https://doi.org/10.1090/trans2/017/10openalex-snapshot
𝜀-entropy and 𝜀-capacity of sets in functional spaces
inferredcites →https://doi.org/10.1109/sfcs.1993.366858openalex-snapshot
Scale-sensitive dimensions, uniform convergence, and learnability
inferredcites →https://doi.org/10.1145/225298.225343openalex-snapshot
On efficient agnostic learning of linear combinations of basis functions
inferredcites →https://doi.org/10.1145/225298.225346openalex-snapshot
More theorems about scale-sensitive dimensions and learning
inferredcites →https://doi.org/10.1214/aop/1176995384openalex-snapshot
Central Limit Theorems for Empirical Measures
inferredcites →https://doi.org/10.1214/aos/1176350488openalex-snapshot
Estimating a Density under Order Restrictions: Nonasymptotic Minimax Risk
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpa.21406openalex-snapshot
Lower compactness estimates for scalar balance laws
inferred← citeshttps://doi.org/10.1002/widm.1252openalex-snapshot
Model selection and error estimation without the agonizing pain
inferred← citeshttps://doi.org/10.1006/inco.2001.3059openalex-snapshot
Learning Fixed-Dimension Linear Thresholds from Fragmented Data
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_17openalex-snapshot
Geometric Methods in the Analysis of Glivenko-Cantelli Classes
inferred← citeshttps://doi.org/10.1007/978-3-319-24486-0_13openalex-snapshot
Multi-task and Lifelong Learning of Kernels
inferred← citeshttps://doi.org/10.1007/978-3-642-29966-7_3openalex-snapshot
Probabilistic Connection between Cross-Validation and Vapnik Bounds
inferred← citeshttps://doi.org/10.1007/s00498-009-0041-8openalex-snapshot
Distribution-free consistency of empirical risk minimization and support vector regression
inferred← citeshttps://doi.org/10.1007/s10107-019-01413-zopenalex-snapshot
Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation
inferred← citeshttps://doi.org/10.1016/j.anihpc.2014.09.002openalex-snapshot
On compactness estimates for hyperbolic systems of conservation laws
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.06.003openalex-snapshot
L-norm Sauer–Shelah lemma for margin multi-category classifiers
inferred← citeshttps://doi.org/10.1016/j.jmaa.2018.08.062openalex-snapshot
Covering numbers for bounded variation functions
inferred← citeshttps://doi.org/10.1016/j.jmaa.2023.127049openalex-snapshot
Learning from non-irreducible Markov chains
inferred← citeshttps://doi.org/10.1016/j.neunet.2026.108797openalex-snapshot
Approximation rates in Besov norms and sample-complexity of Kolmogorov-Arnold networks with residual connections
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.09.020openalex-snapshot
Maximal width learning of binary functions
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00012-2openalex-snapshot
A graph-theoretic generalization of the Sauer-Shelah lemma
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00013-4openalex-snapshot
Scale-sensitive dimensions and skeleton estimates for classification
inferred← citeshttps://doi.org/10.1016/s0167-7152(98)00291-0openalex-snapshot
An inequality for uniform deviations of sample averages from their means
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00164-0openalex-snapshot
Efficient algorithms for learning functions with bounded variation
inferred← citeshttps://doi.org/10.1016/s0925-2312(99)00113-7openalex-snapshot
Simple sample bound for feedforward sigmoid networks with bounded weights
inferred← citeshttps://doi.org/10.1109/18.661502openalex-snapshot
The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
inferred← citeshttps://doi.org/10.1109/18.705577openalex-snapshot
The importance of convexity in learning with squared loss
inferred← citeshttps://doi.org/10.1109/18.720536openalex-snapshot
Learning pattern classification-a survey
inferred← citeshttps://doi.org/10.1109/18.971753openalex-snapshot
Rademacher averages and phase transitions in Glivenko-Cantelli classes
inferred← citeshttps://doi.org/10.1109/tpami.2016.2544314openalex-snapshot
Algorithm-Dependent Generalization Bounds for Multi-Task Learning
inferred← citeshttps://doi.org/10.1137/18m1198090openalex-snapshot
On Kolmogorov Entropy Compactness Estimates for Scalar Conservation Laws Without Uniform Convexity
inferred← citeshttps://doi.org/10.1137/20m1310953openalex-snapshot
Metric Entropy for Functions of Bounded Total Generalized Variation
inferred← citeshttps://doi.org/10.1145/238061.238082openalex-snapshot
The importance of convexity in learning with squared loss
inferred← citeshttps://doi.org/10.1145/279943.279970openalex-snapshot
On the sample complexity of learning functions with bounded variation
inferred← citeshttps://doi.org/10.1145/307400.307416openalex-snapshot
Learning fixed-dimension linear thresholds from fragmented data
inferred← citeshttps://doi.org/10.1186/s40687-016-0093-6openalex-snapshot
Optimal convergence rate of the universal estimation error
inferred← citeshttps://doi.org/10.1214/23-aos2270openalex-snapshot
Minimax rates for conditional density estimation via empirical entropy
inferred← citeshttps://doi.org/10.2478/v10006-010-0039-xopenalex-snapshot
Probabilities of discrepancy between minima of cross-validation, Vapnik bounds and true risks
inferred← citeshttps://doi.org/10.4007/annals.2006.164.603openalex-snapshot
Combinatorics of random processes and sections of convex bodies
inferred← citeshttps://doi.org/10.48550/arxiv.1107.2021openalex-snapshot
Multi-Instance Learning with Any Hypothesis Class
inferred← citeshttps://doi.org/10.48550/arxiv.1504.03200openalex-snapshot
Compactness estimates for Hamilton-Jacobi equations depending on space
inferred← citeshttps://doi.org/10.48550/arxiv.2003.09176openalex-snapshot
Sample Complexity Result for Multi-category Classifiers of Bounded Variation
inferred← citeshttps://doi.org/10.48550/arxiv.2007.06283openalex-snapshot
Functions with average smoothness: structure, algorithms, and learning
inferred← citeshttps://doi.org/10.48550/arxiv.math/0404192openalex-snapshot
Combinatorics of random processes and sections of convex bodies
inferred← citeshttps://doi.org/10.5220/0003721702620270openalex-snapshot
PROBABILISTIC ESTIMATION OF VAPNIK-CHERVONENKIS DIMENSION
inferred← citeshttps://doi.org/10.5555/3122009.3290413openalex-snapshot
A Theory of Learning with Corrupted Labels
inferred← citeshttps://doi.org/10.5802/slsedp.15openalex-snapshot
Estimées d’ ε -entropie pour les lois de conservation scalaires
inferred← citeshttps://doi.org/10.70675/81e3c194z60d8z46b7z8ff4ze99c655067a1openalex-snapshot
Generalization Performance of Margin Multi-category Classifiers
inferred← citeshttps://doi.org/10.7551/mitpress/1113.001.0001openalex-snapshot
Advances in Large-Margin Classifiers
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.