On the sample complexity of PAC learning half-spaces against the uniform distribution

We prove an /spl Omega/(d//spl epsiv/+1//spl epsiv/log1//spl delta/) lower bound on the PAC (probably approximately correct) learning sample complexity of learning half-spaces against the uniform distribution on the unit ball in R/sup d/.<
>