Fast robust learning algorithm dedicated to LMLS criterion

  • Authors:
  • Andrzej Rusiecki

  • Affiliations:
  • Wroclaw University of Technology, Wroclaw, Poland

  • Venue:
  • ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

Robust neural network learning algorithms are often applied to deal with the problem of gross errors and outliers. Unfortunately, such methods suffer from high computational complexity, which makes them ineffective. In this paper, we propose a new robust learning algorithm based on the LMLS (Least Mean Log Squares) error criterion. It can be considered, as a good trade-off between robustness to outliers and learning efficiency. As it was experimentally demonstrated, the novel method is not only faster but also more robust than the LMLS algorithm. Results of implementation and simulation of nets trained with the new algorithm, the traditional backpropagation (BP) algorithm and robust LMLS method are presented and compared.