Similarly, recent work by Balcan, Beygelzimer and Langford [2] provides an upper bound on label-complexity of Õ(d2 log 1 ) for learning half-spaces under the uniform, in a certain agnostic scenario, via an intractable algorithm.