Algorithm 6 ran with equally weighted 2500 positive and 2500 negative examples. Figure
(a) shows that the empirical risk and its upper bound, interpreted as the exponential loss (see
Appendix A), decrease steadily over iterations. This implies that false positive and false negative
rates must also decrease, as observed in (b)