Exact Lower Bounds for the Agnostic Probably-Approximately-Correct (PAC) Machine Learning Model

We provide an exact non-asymptotic lower bound on the minimax expected excess risk (EER) in the agnostic probably-ap-proximately-correct (PAC) machine learning classification model and identify minimax learning algorithms as certain maximally symmetric and minimally randomized "voting" procedures. Based on this result, an exact asymptotic lower bound on the minimax EER is provided. This bound is of the simple form c_∞/√nu as nu→∞, where c_∞=0.16997dots is a universal constant, nu=m/d, m is the size of the training sample, and d is the Vapnik--Chervonenkis dimension of the hypothesis class. It is shown that the differences between these asymptotic and non-asymptotic bounds, as well as the differences between these two bounds and the maximum EER of any learning algorithms that minimize the empirical risk, are asymptotically negligible, and all these differences are due to ties in the mentioned "voting" procedures. A few easy to compute non-asymptotic lower bounds on the minimax EER are also obtained, which are shown to be close to the exact asymptotic lower bound c_∞/√nu even for rather small values of the ratio nu=m/d. As an application of these results, we substantially improve existing lower bounds on the tail probability of the excess risk. Among the tools used are Bayes estimation and apparently new identities and inequalities for binomial distributions.