Stochastic bidirectional training

We consider connectionist compression schemes using auto-associative networks, demonstrate the advantages gained by imposing different constraints on allowed network weights, and give a comparison with pruning of the unconstrained auto-associative network. In this paper we demonstrate the advantages for generalisation performance of constraining weights symmetrically using weight sharing, and by constraining functional symmetry by the use of enhanced backpropagation networks trained bidirectionally. In the process, we derive the stochastic bidirectional training algorithm.

[1]  Tamás D. Gedeon,et al.  Bidirectional Neural Networks Reduce Generalization Error , 1995, IWANN.

[2]  Tom Gedeon,et al.  A comparison of some connectionist compression schemes , 1997, Proceedings of IEEE International Conference on Intelligent Engineering Systems.

[3]  James L. McClelland Explorations In Parallel Distributed Processing , 1988 .