On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

DOI10.1007/978-3-319-21852-6_3zbMath1337.60009OpenAlexW2029538739WikidataQ56214746 ScholiaQ56214746MaRDI QIDQ2805714

A. Ya. Chervonenkis, Vladimir Vapnik

Publication date: 13 May 2016

Published in: Measures of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21852-6_3

Mathematics Subject Classification ID

Strong limit theorems (60F15) Collected or selected works; reprintings or translations of classics (01A75) Axioms; other general questions in probability (60A05)

Related Items

How to catch marathon cheaters: new approximation algorithms for tracking paths, Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension, Compressive sensing of high betweenness centrality nodes in networks, Uniform approximation rates and metric entropy of shallow neural networks, Convergence Rate Analysis for Deep Ritz Method, Nondegenerate spheres in four dimensions, Packing problems, dimensions and the tensor product of complete lattices, Neighbourhood complexity of graphs of bounded twin-width, Sim-to-lab-to-real: safe reinforcement learning with shielding and generalization guarantees, Beyond NP: Quantifying over Answer Sets, A mathematical perspective of machine learning, Physics-Informed Probabilistic Learning of Linear Embeddings of Nonlinear Dynamics with Guaranteed Stability, Deep Neural Networks with ReLU-Sine-Exponential Activations Break Curse of Dimensionality in Approximation on Hölder Class, Unnamed Item, Corners and simpliciality in oriented matroids and partial cubes, Deep Convolutional Neural Networks for Image Classification: A Comprehensive Review, Sublinear search spaces for shortest path planning in grid and road networks, On the stability and generalization of neural networks with VC dimension and fuzzy feature encoders, Geometric Separators for Finite-Element Meshes, Unnamed Item, LOCAL KEISLER MEASURES AND NIP FORMULAS, On generalization in moment-based domain adaptation, On extremal problems concerning the traces of sets, On tope graphs of complexes of oriented matroids, Error bounds for approximations with deep ReLU networks, Data-driven algorithm selection and tuning in optimization and signal processing, Dependence structure estimation using copula recursive trees, Applying least squares support vector machines to mean-variance portfolio analysis, Improving Spectral Clustering Using the Asymptotic Value of the Normalized Cut, Finding Meaningful Cluster Structure Amidst Background Noise, Unnamed Item, Digraphs of Bounded Width, Generalized resilience and robust statistics, Robust subgroup discovery. Discovering subgroup lists using MDL, Compressive sensing and neural networks from a statistical learning perspective, PAC-learning gains of Turing machines over circuits and neural networks