mlsanityData to 7 Oct 2026

On the Information Complexity of Proper Learners for VC Classes in the Realizable Case

arXiv 2011.02970 ↗First posted 5 Nov 2020cs.LG cs.IT math.ITcited by 1

Not on the map. Why?

Abstract (arXiv)

We provide a negative resolution to a conjecture of Steinke and Zakynthinou (2020a), by showing that their bound on the conditional mutual information (CMI) of proper learners of Vapnik--Chervonenkis (VC) classes cannot be improved from d log n +2 to O(d), where n is the number of i.i.d. training examples. In fact, we exhibit VC classes for which the CMI of any proper learner cannot be bounded by any real-valued function of the VC dimension only.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 5 Nov 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.

  1. 2022Information-Theoretic Analysis of Minimax Excess Riskcited by 5