Programming based learning algorithms of neural networks with self-feedback connections
- 1 May 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 6 (3) , 771-775
- https://doi.org/10.1109/72.377985
Abstract
Discusses the learning problem of neural networks with self-feedback connections and shows that when the neural network is used as associative memory, the learning problem can be transformed into some sort of programming (optimization) problem. Thus, the rather mature optimization technique in programming mathematics can be used for solving the learning problem of neural networks with self-feedback connections. Two learning algorithms based on programming technique are presented. Their complexity is just polynomial. Then, the optimization of the radius of attraction of the training samples is discussed using quadratic programming techniques and the corresponding algorithm is given. Finally, the comparison is made between the given learning algorithm and some other known algorithms.Keywords
This publication has 6 references indexed in Scilit:
- Algorithms for the solution of quadratic knapsack problemsLinear Algebra and its Applications, 1991
- Neural NetworksPublished by Springer Nature ,1990
- Associative recall of memory without errorsPhysical Review A, 1987
- Parallel Distributed ProcessingPublished by MIT Press ,1986
- Neural networks and physical systems with emergent collective computational abilities.Proceedings of the National Academy of Sciences, 1982
- Optimization ProblemsPublished by Springer Nature ,1975