On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
From MaRDI portal
Publication:5660314
DOI10.1137/1116025zbMath0247.60005OpenAlexW4238284510WikidataQ29011890 ScholiaQ29011890MaRDI QIDQ5660314
Vladimir Vapnik, A. Ya. Chervonenkis
Publication date: 1971
Published in: Theory of Probability & Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1116025
Related Items (only showing first 100 items - show all)
Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs ⋮ Embeddings and the trace of finite sets ⋮ Objective and subjective foundations for multiple priors ⋮ The VC dimension of \(k\)-fold union ⋮ Pairwise intersections and forbidden configurations ⋮ An algorithmic theory of learning: robust concepts and random projection ⋮ The VC-dimension of graphs with respect to \(k\)-connected subgraphs ⋮ On the VC-dimension of uniform hypergraphs ⋮ Estimation of a time-dependent density ⋮ Complexity of hyperconcepts ⋮ On ordinal VC-dimension and some notions of complexity ⋮ Smoothed maximum score change-point estimation in binary response model ⋮ A Glivenko-Cantelli theorem for almost additive functions on lattices ⋮ Learning with side information: PAC learning bounds ⋮ On minimum saturated matrices ⋮ Discriminant analysis based on statistical depth ⋮ An oracle inequality for regularized risk minimizers with strongly mixing observations ⋮ Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy ⋮ Exploiting label dependencies for improved sample complexity ⋮ On combinatorial testing problems ⋮ On the generalization error of fixed combinations of classifiers ⋮ Maximum score change-point estimation in binary response model ⋮ Bin width selection in multivariate histograms by the combinatorial method ⋮ Some recent results on Ramsey-type numbers ⋮ Information dependency: strong consistency of Darbellay-Vajda partition estimators ⋮ Shattering, graph orientations, and connectivity ⋮ Repeated columns and an old chestnut ⋮ PAC learning, VC dimension, and the arithmetic hierarchy ⋮ Clique versus independent set ⋮ On the hardness of learning intersections of two halfspaces ⋮ Connecting deterministic and stochastic metapopulation models ⋮ Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property ⋮ Approximate aggregation for tracking quantiles and range countings in wireless sensor networks ⋮ Robust cutpoints in the logical analysis of numerical data ⋮ Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension ⋮ Languages as hyperplanes: grammatical inference with string kernels ⋮ On the convergence of Shannon differential entropy, and its connections with density and entropy estimation ⋮ The class cover problem with boxes ⋮ Aspects in classification learning -- review of recent developments in learning vector quantization ⋮ Generalization error bounds for the logical analysis of data ⋮ Relative \((p,\varepsilon )\)-approximations in geometry ⋮ Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns ⋮ Improved approximation for guarding simple galleries from the perimeter ⋮ Low-contention data structures ⋮ Learning from hints in neural networks ⋮ Piercing quasi-rectangles-on a problem of Danzer and Rogers ⋮ A tree-based regressor that adapts to intrinsic dimension ⋮ Forbidden configurations and repeated induction ⋮ Construction of \(\epsilon\)-nets ⋮ Multiclass classification with potential function rules: margin distribution and generalization ⋮ Margin-adaptive model selection in statistical learning ⋮ A statistical learning theory approach for uncertain linear and bilinear matrix inequalities ⋮ Cover-based combinatorial bounds on probability of overfitting ⋮ Using the doubling dimension to analyze the generalization of learning algorithms ⋮ Algebraic methods proving Sauer's bound for teaching complexity ⋮ Linear algebra methods for Forbidden configurations ⋮ Feasibility of numerical modelling: Information aspect ⋮ Kernel methods in machine learning ⋮ A non-linear lower bound for planar epsilon-nets ⋮ Generalization performance of bipartite ranking algorithms with convex losses ⋮ Set families with forbidden subposets ⋮ \(\varepsilon\)-approximations of \(k\)-label spaces ⋮ On intersecting a point set with Euclidean balls ⋮ Rigorous learning curve bounds from statistical mechanics ⋮ Radial basis function networks: Generalization in over-realizable and unrealizable scenarios ⋮ Constrained versions of Sauer's Lemma ⋮ The Glivenko-Cantelli problem, ten years later ⋮ Uniform convergence rates for halfspace depth ⋮ On pseudorandomness of families of binary sequences ⋮ VC-sets and generic compact domination ⋮ Double-fold localized multiple matrixized learning machine ⋮ Forbidden configurations and Steiner designs ⋮ Structural multiple empirical kernel learning ⋮ On \(k\)-partite hypergraphs with the induced \(\epsilon \)-density property ⋮ Analysis of the consistency of a mixed integer programming-based multi-category constrained discriminant model ⋮ An asymptotic statistical analysis of support vector machines with soft margins ⋮ Density estimation by the penalized combinatorial method ⋮ Monte Carlo algorithms for optimal stopping and statistical learning ⋮ Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis ⋮ Analysis of a multi-category classifier ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ Maximal pattern complexity, dual system and pattern recognition ⋮ Kernel estimators of density function of directional data ⋮ Information divergence estimation based on data-dependent partitions ⋮ Testing conditional independence in supervised learning algorithms ⋮ Alternative second-order cone programming formulations for support vector classification ⋮ Two proofs for shallow packings ⋮ Multi-category classifiers and sample width ⋮ Covering nearly surface-embedded graphs with a fixed number of balls ⋮ Learning commutative deterministic finite state automata in polynomial time ⋮ A deterministic view of random sampling and its use in geometry ⋮ Results on learnability and the Vapnik-Chervonenkis dimension ⋮ Prediction-preserving reducibility ⋮ On signal representations within the Bayes decision framework ⋮ Two-dimensional partial cubes ⋮ Strong consistency of nearest neighbor regression function estimators ⋮ Uniform and universal Glivenko-Cantelli classes ⋮ Learnability with respect to fixed distributions ⋮ Theory revision with queries: Horn, read-once, and parity formulas ⋮ Maximizing agreements and coagnostic learning
This page was built for publication: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
