Learnability and the Vapnik-Chervonenkis dimension
Citations
11 citations
11 citations
11 citations
11 citations
11 citations
Cites background from "Learnability and the Vapnik-Chervon..."
...Warmuth conjectured in [4] that the factor of log(1/ε) in the upper bound can be overcome....
[...]
...We will show that Warmuth’s conjecture is indeed true for all intersection-closed classes....
[...]
...Our result settles an open problem posed by Auer and Ortner and supports a conjecture by Warmuth about the true sample complexity and the optimal PAC-learning algorithm for general classes....
[...]
...All rights reserved. hand, the best matching upper bound, which was proven by Blumer, Ehrenfeucht, Haussler and Warmuth [3], is O ( d log(1/ε) + log(1/δ) ε ) ....
[...]
...[3], showing that suph∈Vm errt,D(h) is upper bounded by D(DIS) · 4 n (d log 2en d + log 12 δ ) with a probability of at least 1 − δ/3....
[...]
References
42,654 citations
40,020 citations
17,939 citations
14,948 citations
13,647 citations