Progressive gradient walk for neural network fitness landscape analysis

No Thumbnail Available
File version
Author(s)
Bosman, Anna S
Engelbrecht, Andries P
Helbig, Mardé
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2018
Size
File type(s)
Location

Kyoto, Japan

License
Abstract

Understanding the properties of neural network error landscapes is an important problem faced by the neural network research community. A few attempts have been made in the past to gather insight about neural network error landscapes using fitness landscape analysis techniques. However, most fitness landscape metrics rely on the analysis of random samples, which may not represent the high-dimensional neural network search spaces well. If the random samples do not include areas of good fitness, then the presence of local optima and/or saddle points cannot be quantified. This paper proposes a progressive gradient walk as an alternative sampling algorithm for neural network error landscape analysis. Experiments show that the proposed walk captures areas of good fitness significantly better than the random walks.

Journal Title
Conference Title

GECCO' 18 Companion: Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion

Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Neural networks

Persistent link to this record
Citation

Bosman, AS; Engelbrecht, AP; Helbig, M, Progressive gradient walk for neural network fitness landscape analysis, GECCO' 18 Companion: Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion, 2018, pp. 1473-1480