Steepest Descent Can Take Exponential Time for Symmetric Connection Networks
Armin Haken
Michael Luby
Department of Computer Science, University of Toronto,
10 King's College Road, Toronto, M5S 1A4, Canada
Abstract
We construct a family of symmetric weight connection networks that take exponential time to reach a stable configuration when the sequential steepest descent update rule is used.
