Showing the equivalence of two training algorithms. I

Graph transformations offer a powerful way to formally specify neural networks and their corresponding training algorithms. This formalism can be used to prove properties of these algorithms. In this paper graph transformations are used to show the equivalence of two training algorithms for recurrent neural networks; backpropagation through time, and a variant of real-time backpropagation. In addition to this proof a whole class of related training algorithms emerges from the used formalism.