1. A Lower Bound for Agnostically Learning Disjunctions Adam R

2. It also Agnostically learns Boolean disjunctions in time b^2 (\sqrt n) with respect to any distribution

3. We also show this algorithm Agnostically learns Boolean disjunctions in time roughly 2^{\sqrt{n}} with respect to any distribution; this is the first subexponential-time algorithm for this problem