Anti-Hebbian Learning in Topologically Constrained Linear Networks: A Tutorial

IEEE Transactions on Neural Networks

Volumn 4, Issue 5, 1993, Pages 748-761

  Palmieri, Francesco ^a   Zhu, Jie ^a   Chang, Chihua ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; CORRELATION METHODS; ELECTRIC NETWORK TOPOLOGY; INFORMATION THEORY; LINEAR NETWORKS; MATHEMATICAL MODELS; NEURAL NETWORKS;

ANTI-HEBBIAN LEARNING; CONNECTIVITY CONSTRAINTS; TOPOLOGICALLY CONSTRAINED LINEAR NETWORKS;

LEARNING SYSTEMS;

EID: 0027663185     PISSN: 10459227     EISSN: 19410093     Source Type: Journal    
DOI: 10.1109/72.248453     Document Type: Article

References (39)

1. G. H. Golub and G. F. V. Loan, Matrix Computations. Baltimore, MD: Johns Hopkins University Press, 1989.
2. S. Haykin, Adaptive Filter Theory. Englewood Cliffs, NJ: Prentice-Hall, 1986.
3. R. Linsker, “How to generate ordered maps by maximizing the mutual information between input and output signals,” Neural Computation, vol. 1, pp. 402—411, 1989.
4. R. Linsker, “Self-organization in a perceptual network,” IEEE Comput. Mag., vol. 2, pp. 105–117, Mar. 1988.
5. F. Palmieri and J. Zhu, “Hebbian learning in linear neural networks: A review,” IEEE Trans. Neural Networks, submitted for publication.
6. H. Barlow and P. Foldiak, “Adaptation and decorrelation in the cortex,” in The Computing Neuron, R. Durbin, C. Miall, and G. Mitchinson, Eds. Reading, MA: Addison-Wesley, 1989.
7. B. Kosko, “Differential Hebbian learning,” in Proc. AIP Conf., vol. 157, 1986, pp. 277–288.
8. A. H. Klopf, “A drive-reinforcement model of single neuron function: An alternative to the Hebbian neuronal model,” in Proc. AIP Conf., vol. 151, 1986, pp. 265–270.
9. B. Widrow and S. Stearns, Adaptive Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1985.
10. B. D. O. Anderson and J. B. Moore, Optimal Filtering. Englewood Cliffs, NJ: Prentice-Hall, 1979.
11. T. Kohonen, Self-Organization and Associative Memory, Second ed. New York: Springer-Verlag, 1988.
12. S. Haykin, Modern Filters. New York: Macmillan, 1989.
13. S. J. Orfanidis, Optimum Signal Processing, An Introduction, Second ed. New York: McGraw-Hill, 1988.
14. F. Palmieri and J. Zhu, “A comparison of two eigen-networks,” in Proc. IJCNN, vol. 2, Seattle, WA, 1991, pp. 193–199.
15. S. J. Orfanidis, “Gram-Schmidt neural nets,” Neural Computation, vol. 2, pp. 116–126, 1990.
16. C. T. Chen, Linear System Theory and Design. New York: Holt, Rinehart and Winston, 1970.
17. P. Foldiak, “Learning invariant from transformation sequences,” Neural Computation, pp. 194–200, 1991.
18. G. Mitchison, “Removing time variation with the anti-Hebbian differential synapse,” Neural Computation, pp. 312–320, 1991.
19. J. L. Elman, “Finding structure in time,” Cognitive Sci., pp. 179–211, 1990.
20. E. Oja and J. Karhunen, “On stochastic approximation of eigenvectors and eigenvalues of the expectation of a random matrix,” J. Math. Anal. Appl., vol. 106, pp. 69–84, 1985.
21. E. Oja, “A simplified neuron model as a principal component analyzer,” J. Math. Biolog., vol. 15, pp. 267–273, 1982.
22. T. D. Sanger, “Optimal unsupervised learning in a single-layer linear feedforward neural network,” Neural Networks, vol. 2, pp. 459–473, 1988.
23. P. Foldiak, “Adaptive network for optimal linear feature extraction,” Neural Networks, vol. 2, pp. 459-473, 1988.
24. S. Y. Kung and K. I. Diamantaras, “A neural network learning algorithm for adaptive principal component extraction (apex),” in Proc. ICASSP, vol. 2, 1990, pp. 861–864.
25. F. Palmieri and J. Zhu, “Linear neural networks which minimize the output variance,” in Proc. IJCNN, vol. 1, Seattle, WA, 1991, pp. 791–797.
26. H. Rutishause, “Computational aspects of Bauer's simultaneous iteration method,” Numer. Math., vol. 13, pp. 4–13, 1969.
27. R. P. Lippmann, “An introduction to computing with neural nets,” IEEE ASSP Mag., pp. 4–24, Apr. 1987.
28. D. G. Luenberger, Linear and Nonlinear Programming, second ed. Menlo Park, CA: Addison-Wesley, 1984.
29. R. J. Vaccaro, SVD and Signal Processing, Algorithms, Analysis and Applications. New York: Elsevier, 1991.
30. G. Strang, Introduction To Applied Mathematics. Wellesley-Cambridge Press, 1986.
31. R. A. Horn and C. A. Johnson, Matrix Analysis. Cambridge University Press, 1985.
32. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipes in C. Cambridge: Cambridge University Press, 1988.
33. D. E. Rumelhart and J. L. McClelland, Parallel Distributed Processing. Cambridge, MA: M.I.T. Press, 1986.
34. S. Grossberg, Neural Networks and Natural Intelligence. Cambridge, MA: M.I.T. Press, 1988.
35. D. O. Hebb, The Organization of Behavior. New York: Wiley, 1949.
36. E. L. Bienenstock, L. N. Cooper, and P. W. Munro, “Theory for the development of neuron selectivity: Orientation specificity and binocular interaction in visual cortex,” Neuroscience, pp. 32–48, 1982.
37. G. E. Hinton, “Connectionist learning procedure,” Artificial Intell., pp. 185–234, 1989.
38. H. Barlow, “Unsupervised learning,” Neural Computation, pp. 295–311, 1989.
39. H. Barlow, T. Kaushal, and G. J. Mitchison, “Finding minimum entropy codes,” Neural Computation, pp. 412–423, 1989.