Penalty function approach to recurrent neural network dynamics

1997 ◽  
Vol 56 (1) ◽  
pp. 1266-1269
Author(s):  
Edoardo Milotti
1997 ◽  
Vol 9 (1) ◽  
pp. 185-204 ◽  
Author(s):  
Rudy Setiono

This article proposes the use of a penalty function for pruning feedforward neural network by weight elimination. The penalty function proposed consists of two terms. The first term is to discourage the use of unnecessary connections, and the second term is to prevent the weights of the connections from taking excessively large values. Simple criteria for eliminating weights from the network are also given. The effectiveness of this penalty function is tested on three well-known problems: the contiguity problem, the parity problems, and the monks problems. The resulting pruned networks obtained for many of these problems have fewer connections than previously reported in the literature.


Author(s):  
Saroj Kr. Biswas ◽  
Nidul Sinha ◽  
Biswajit Purkayastha ◽  
Leniency Marbaniang

2017 ◽  
Vol 7 (1) ◽  
Author(s):  
Filippo Maria Bianchi ◽  
Lorenzo Livi ◽  
Cesare Alippi ◽  
Robert Jenssen

Author(s):  
Roni Tibon ◽  
Kamen A. Tsvetanov ◽  
Darren Price ◽  
David Nesbitt ◽  
Cam CAN ◽  
...  

Author(s):  
Daisuke Koshiyama ◽  
Makoto Miyakoshi ◽  
Yash B. Joshi ◽  
Juan L. Molina ◽  
Kumiko Tanaka-Koshiyama ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document