# Average-Case Information Complexity of Learning

25 Nov 2018Ido NachumAmir Yehudayoff

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 $\infty$ with the universe size)... (read more)

PDF Abstract

No code implementations yet. Submit your code now