VC bounds on the cardinality of nearly orthogonal function classes
From MaRDI portal
Publication:418881
DOI10.1016/j.disc.2012.01.030zbMath1242.05050arXiv1007.4915OpenAlexW1964961120MaRDI QIDQ418881
Elchanan Mossel, Leonid (Aryeh) Kontorovich, Lee-Ad J. Gottlieb
Publication date: 30 May 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.4915
Learning and adaptive systems in artificial intelligence (68T05) Combinatorial aspects of packing and covering (05B40)
Related Items (3)
Lower bounds on the size of general branch-and-bound trees ⋮ On the distribution of the number of internal equilibria in random evolutionary games ⋮ Two proofs for shallow packings
Cites Work
- Some limit theorems for empirical processes (with discussion)
- On miniaturized problems in parameterized complexity theory
- Using the doubling dimension to analyze the generalization of learning algorithms
- Donsker classes of sets
- The Glivenko-Cantelli problem
- Donsker classes and random geometry
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Central limit theorems for empirical measures
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Entropy and the combinatorial dimension
- A generalization of Sauer's lemma
- On the density of families of sets
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- Learnability and the Vapnik-Chervonenkis dimension
- Bounds for Binary Codes With Narrow Distance Distributions
- Scale-sensitive dimensions, uniform convergence, and learnability
- Lower Bounds on Learning Random Structures with Statistical Queries
- A Complete Characterization of Statistical Query Learning with Applications to Evolvability
- Convergence of stochastic processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: VC bounds on the cardinality of nearly orthogonal function classes
