An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution (Q1014429)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution |
scientific article; zbMATH DE number 5547805
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution |
scientific article; zbMATH DE number 5547805 |
Statements
An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution (English)
0 references
28 April 2009
0 references
machine learning
0 references
sample complexity
0 references
PAC-learning
0 references
halfspaces
0 references
computational complexity
0 references
