Ido Nachum

Average-Case Information Complexity of Learning

2018 · arXiv (Cornell University)

How many bits of information are revealed by a learning algorithm for a concept class of VC-dimension $d$? Previous works have shown that even for $d=1$ the amount of information may be unbounded (tend to …