A note on bounds for VC dimensions
DOI10.1214/09-IMSCOLL508zbMATH Open1243.60009OpenAlexW1921099282WikidataQ42530696 ScholiaQ42530696MaRDI QIDQ2900951FDOQ2900951
Authors: Jon A. Wellner, Aad van der Vaart 
Publication date: 26 July 2012
Published in: Institute of Mathematical Statistics Collections (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.imsc/1265119264
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Order statistics; empirical distribution functions (62G30) Probability theory on algebraic and topological structures (60B99)
Cited In (14)
- Vapnik–Chervonenkis dimension of axis-parallel cuts
- Benign overfitting and adaptive nonparametric regression
- Robust estimation of a regression function in exponential families
- Robust nonparametric regression based on deep ReLU neural networks
- A new method for estimation and model selection: \(\rho\)-estimation
- Robust subgaussian estimation with VC-dimension
- General feasibility bounds for sample average approximation via Vapnik-Chervonenkis dimension
- Sperner families of bounded VC-dimension
- Comment: The Two Styles of VC Bounds
- Clustering of measures via mean measure quantization
- The VC-dimension of axis-parallel boxes on the torus
- Learning MAX-SAT from contextual examples for combinatorial optimisation
- A note on VC-dimension and measure of sets of reals
- A new upper bound for the VC-dimension of visibility regions
This page was built for publication: A note on bounds for VC dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900951)
