Density and dimension

From MaRDI portal
Publication:1836212

DOI10.5802/aif.938zbMath0504.60006OpenAlexW2330274477MaRDI QIDQ1836212

Patrice Assouad

Publication date: 1983

Published in: Annales de l'Institut Fourier (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=AIF_1983__33_3_233_0



Related Items

Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements, \(\epsilon\)-nets and simplex range queries, Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension, Almost optimal set covers in finite VC-dimension, The \(\varepsilon\)-\(t\)-net problem, Estimation of a multivariate Box-Cox transformation to elliptical symmetry via the empirical characteristic function, Vapnik-Chervonenkis density in some theories without the independence property. II, Guarding galleries where every point sees a large area, PAC-learning from general examples, Uniform approximation of Vapnik-Chervonenkis classes, Properties of convergence of a fuzzy set estimator of the density function, Neural Networks with Local Receptive Fields and Superlinear VC Dimension, Teaching and Compressing for Low VC-Dimension, The universal Glivenko-Cantelli property, Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension, Decision theoretic generalizations of the PAC model for neural net and other learning applications, Strong approximation for set-indexed partial sum processes via KMT constructions III, Compression schemes, stable definable families, and o-minimal structures, A high-dimensional Wilks phenomenon, Vapnik-Chervonenkis density in some theories without the independence property, I, VC-dimension and Erdős-Pósa property, Theory of Classification: a Survey of Some Recent Advances, Prediction-preserving reducibility, Entropy and the uniform mean ergodic theorem for a family of sets, VC-density for trees, Quasi-optimal range searching in spaces of finite VC-dimension, THICKET DENSITY, Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete, Hausdorff dimension, heavy tails, and generalization in neural networks*, Primal and dual combinatorial dimensions



Cites Work