1 citations · 1 across the 1 of their papers we have counts for
1 paper
Michael Gastpar, Ido Nachum, Jonathan Shafer +1
We study the notion of a generalization bound being uniformly tight, meaning that the difference between the bound and the population loss is small for all learning algorithms and…