The Perceptron with Dynamic Margin

Details The Perceptron with Dynamic Margin The Perceptron with Dynamic Margin

2011-05-30

arxiv.org/abs/1105.6041v1

Computer Science

Learning

16 pages

Scientific paper

The classical perceptron rule provides a varying upper bound on the maximum margin, namely the length of the current weight vector divided by the total number of updates up to that time. Requiring that the perceptron updates its internal state whenever the normalized margin of a pattern is found not to exceed a certain fraction of this dynamic upper bound we construct a new approximate maximum margin classifier called the perceptron with dynamic margin (PDM). We demonstrate that PDM converges in a finite number of steps and derive an upper bound on them. We also compare experimentally PDM with other perceptron-like algorithms and support vector machines on hard margin tasks involving linear kernels which are equivalent to 2-norm soft margin.

Affiliated with

Also associated with

No associations

Rating

The Perceptron with Dynamic Margin does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Perceptron with Dynamic Margin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Perceptron with Dynamic Margin will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678872