3.12 Rademacher complexity. Professor Jesetoo claims to have found a better bound on the Rademacher complexity of
Question:
3.12 Rademacher complexity. Professor Jesetoo claims to have found a better bound on the Rademacher complexity of any hypothesis set H of functions taking values in f????1; +1g, in terms of its VC-dimension VCdim(H). His bound is of the form Rm(H) O
????VCdim(H)
m
. Can you show that Professor Jesetoo's claim cannot be correct? (Hint: consider a hypothesis set H reduced to just two simple functions.)
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Foundations Of Machine Learning
ISBN: 9780262351362
2nd Edition
Authors: Mehryar Mohri, Afshin Rostamizadeh
Question Posted: