Using the Nonsmooth Analysis in a Learning Process
Abstrakt
We propose an unconventional updating algorithm for weighting features for a classification task with abrupt changes of the error function. Using a so-called nonsmooth analysis we prove the quadratic convergence of such a learning process. For the dynamic optimization of the step size we use approach similar to Runge’s method of a half step. Finally we demonstrate its classification abilities on artificial as well as on real-life classification tasks.