Avoiding local minima in feedforward neural networks by simultaneous learning

  • Authors:
  • Akarachai Atakulreka;Daricha Sutivong

  • Affiliations:
  • Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand;Department of Industrial Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand

  • Venue:
  • AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Feedforward neural networks are particularly useful in learning a training dataset without prior knowledge. However, weight adjusting with a gradient descent may result in the local minimum problem. Repeated training with random starting weights is among the popular methods to avoid this problem, but it requires extensive computational time. This paper proposes a simultaneous training method with removal criteria to eliminate less promising neural networks, which can decrease the probability of achieving a local minimum while efficiently utilizing resources. The experimental results demonstrate the effectiveness and efficiency of the proposed training method in comparison with conventional training.