The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant (Q1127362)
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: The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant |
scientific article; zbMATH DE number 1189665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant |
scientific article; zbMATH DE number 1189665 |
Statements
The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant (English)
0 references
13 August 1998
0 references
linear threshold functions
0 references
perceptron algorithm
0 references
relevant variables
0 references
multiplicative updates
0 references
mistake bounds
0 references
0.8460777997970581
0 references
0.8225409984588623
0 references
0.8166418075561523
0 references
0.8071684241294861
0 references
