A Why Optimism

We illustrate this in the setting of binary classification that we work with. We now show the regret of any optimistic algorithm can be upper bounded by the model's estimation In this section we prove the results stated in Theorem 1. The logistic function µ is 1 / 4 Lipschitz. R centered around point x . In this section we will make the following assumptions.