Lower Bounds for the Empirical Minimization Algorithm
In this correspondence, we present a simple argument that proves that under mild geometric assumptions on the class F and the set of target functions Τ, the empirical minimization algorithm cannot yield a uniform error rate that is faster than 1√k in t
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Information Theory|
|01_Mendelson_Lower_Bounds_for_the_Empirical_2008.pdf||332.03 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.