MathDB1 problem
- 0 votes0 replies0 views
Warmuth's conjecture on optimal PAC bounds for the one-inclusion graph algorithm
Consider the one-inclusion graph algorithm for realizable classification, which uses a labeled sample with one point held out and has leave-one-out performance bounded by the relev…