By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Long, P.M. ; Res. Triangle Inst., Research Triangle Park, NC, USA

We prove an Ω(d/ε+1/εlog1/δ) lower bound on the PAC (probably approximately correct) learning sample complexity of learning half-spaces against the uniform distribution on the unit ball in Rd

Published in:

Neural Networks, IEEE Transactions on  (Volume:6 ,  Issue: 6 )