A New Lower Bound for Agnostic Learning with Sample Compression Schemes
, and .
(2018)cite arxiv:1805.08140.

We establish a tight characterization of the worst-case rates for the excess risk of agnostic learning with sample compression schemes and for uniform convergence for agnostic sample compression schemes. In particular, we find that the optimal rates of convergence for size-$k$ agnostic sample compression schemes are of the form $\frack łog(n/k)n$, which contrasts with agnostic learning with classes of VC dimension $k$, where the optimal rates are of the form $\frackn$.
  • @kirk86
  • @dblp
This publication has not been reviewed yet.

rating distribution
average user rating0.0 out of 5.0 based on 0 reviews
    Please log in to take part in the discussion (add own reviews or comments).