mlsanityData to 14 Oct 2026

A Rate Separation for Agnostic Direct Sums

arXiv 2608.06951 ↗First posted 7 Aug 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Hanneke, Moran, and Waknine citeHannekeMoranWaknine2024 asked how the agnostic PAC learning curve of the direct sum Cr depends on the single-instance learning curve epsagn(nmid C) and on r. We show that the single-instance learning rate does not determine the direct-sum rate. Let F be the class of the two constant binary functions and let G consist of the zero function and the identity function. Both classes have agnostic learning curve of order n-1/2.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 8 references that are in the map. First posted on arXiv 7 Aug 2026.

Builds on

3 of 8 references.

References · 3

  1. 2026The Optimal Sample Complexity of Multiclass and List Learningcited by 11
  2. 2025Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Backcited by 9
  3. 2026Uniform Laws of Large Numbers in Product Spacescited by 2

Built on by

Not cited yet.