Practically finding break point or VC dimension
Dear Prof Yaser
Greetings! I understand the proofs and the theoretical argument. The point that you underline is "give me the breakpoint" and i will give the error bound in terms of examples N etc. Now practically for an algorithm how do we find a breakpoint? If someone comes up with an algorithm f(x), how is breakpoint or VC dimension actually computed? Are there any formal steps etc ?
Thanks in anticipation!
Uday Kamath
PhD Candidate
GMU
