| Literature DB >> 18263451 |
P M Long1.
Abstract
We prove an Omega(d/epsilon+1/epsilonlog1/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(d).Year: 1995 PMID： 18263451 DOI： 10.1109/72.471352
Source DB: PubMed Journal: IEEE Trans Neural Netw ISSN： 1045-9227