A New Lower Bound for Agnostic Learning with Sample Compression Schemes. Academic Article uri icon


  • 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 $\sqrt {\frac {k\log (n/k)}{n}} $, which contrasts with agnostic learning with classes of VC dimension $ k $, where the optimal rates are of the form $\sqrt {\frac {k}{n}} $. Subjects: Learning (cs. LG); Statistics Theory (math. ST); Machine Learning (stat. ML) Cite as: arXiv: 1805.08140 [cs. LG](or arXiv: 1805.08140 v1 [cs. LG] for this version) Submission history From: Steve Hanneke [view email][v1] Mon, 21 May 2018 15: 47: 31 GMT (27kb)

publication date

  • January 1, 2018