A Deterministic and Polynomial Modified Perceptron Algorithm
We construct a modified perceptron algorithm that is deterministic, polynomial and also as fast as previous known algorithms. The algorithm runs in time O(mn3lognlog(1/ρ)), where m is the number of examples, n the number of dimensions and ρ is approximately the size of the margin. We also construct...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2006-01-01
|
| Series: | Computer Science Journal of Moldova |
| Online Access: | http://www.math.md/files/csjm/v13-n3/v13-n3-(pp254-267).pdf |