On the complexity of constrained VC-classes
From MaRDI portal
Publication:2478433
Recommendations
Cites work
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance
- Complexity of hyperconcepts
- Neural Network Learning
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the VC-dimension and boolean functions with long runs
- On the density of families of sets
- On the trace of finite sets
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
Cited in
(7)- VC bounds on the cardinality of nearly orthogonal function classes
- scientific article; zbMATH DE number 1453031 (Why is no real title available?)
- VC-dimensions of short Presburger formulas
- On the complexity of binary samples
- Some new maximum VC classes
- \(L_{p}\)-norm Sauer-Shelah lemma for margin multi-category classifiers
- scientific article; zbMATH DE number 2127765 (Why is no real title available?)
This page was built for publication: On the complexity of constrained VC-classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2478433)