Neural Networks, Orientations of the Hypercube, and Algebraic Threshold Functions

IEEE Transactions on Information Theory

Volumn 34, Issue 3, 1988, Pages 523-530

  Baldi, Pierre ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CODES, SYMBOLIC; COMPUTER METATHEORY -- THRESHOLD LOGIC; MATHEMATICAL TECHNIQUES -- GRAPH THEORY;

ALGEBRAIC THRESHOLD FUNCTIONS; LOCAL IMPROVEMENT ALGORITHMS; NEURAL NETWORKS MODELS; NONQUADRATIC ENERGY FUNCTIONS; STORAGE CAPACITY;

SYSTEMS SCIENCE AND CYBERNETICS;

EID: 0024000737     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.6032     Document Type: Article

References (23)

1. Y. S. Abu Mostafa and J. M. St. Jaques, #x201C;Information capacity of the Hopfield model,#x201D; IEEE Trans. Inform. Theory, vol. IT-31, no. 4, pp. 461-464, 1985.
2. D. J. Amit, H. Gutfreund, and H. Sompolinsky, #x201C;Spin-glass models of neural networks,#x201D; Phys. Rev. A, vol. 32, pp. 1107-1118, 1985.
3. P. Baldi, #x201C;1) On a generalized family of colorings; 2) Some contributions to the theory of neural networks; 3) Embeddings of ultrametric spaces in finite dimensional structures,#x201D; Ph.D. dissertation, California Institute of Technology, Pasadena, 1986.
4. #x2014;, #x201C;Group actions and learning for a family of automata,#x201D; J. Comput. Syst. Sci., vol. 36, no. 1, pp. 1-15, 1988.
5. P. Baldi and S. S. Venkatesh, #x201C;Number of stable points for spinglasses and neural networks,#x201D; Phys. Rev. Lett., vol. 58, no. 9, pp. 913-917, Mar. 1987.
6. P. Baldi and Y. Rinott, #x201C;Asymptotic normality of some graph related statistics,#x201D; J. Appl. Prob., to be published.
7. J. Bruck and J. Sanz "A study of neural network,#x201D; IBM Almaden Research Center Internal Report, 1986.
8. S. H. Cameron, #x201C;An estimate of the complexity requisite in a universal decision network,#x201D; in Proc. Bionics Symp., Wright Airforce Dev. Div. (WADD) Rep. 60-600, 1960, pp. 197-212.
9. T. M. Cover, #x201C;Geometrical and statistical properties of systems of linear inequalities with applications in pattern recognition,#x201D; IRE Trans. Electron. Comput., vol. EL-14, pp. 326-334, 1965.
10. E. Fredkin and T. Toffoli, #x201C;Conservative logic,#x201D; Int. J. Theoretical Phys., vol. 21, nos. 3-4, pp. 219-225, 1982.
11. J. J. Hopfield, #x201C;Neural networks and physical systems with emergent collective computational abilities,#x201D; Proc. Nat. Acad. Sci. USA, vol. 79, pp. 2554-2558, 1982.
12. J. J. Hopfield and D. W. Tank, #x201C;Neural computation of decisions in optimization problems,#x201D; Biol. Cybern., vol. 52, pp. 141-152, 1985.
13. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, #x201C;Optimization by simulated annealing,#x201D; Science, vol. 220, pp. 671-680, 1983.
14. S. Lin, #x201C;Computer solutions to the traveling salesman problem,#x201D; Bell Syst. Tech. J., vol. 44, no. 10, pp. 2245-2269, 1965.
15. T. Maxwell, C. L. Giles, Y. C. Lee, and H. H. Chen, #x201C;Nonlinear dynamics of artificial neural systems,#x201D; in Proc. Conf. Neural Networks for Computing, Snowbird UT, Amer. Inst. Physics, 151, J. S. Denker, Ed., 1986, pp. 299-304.
16. R. J. McEliece, E. C. Posner, E. R. Rodemich, and S. S. Venkatesh, #x201C;The capacity of the Hopfield associative memory,#x201D; IEEE Trans. Inform. Theory, vol. IT-33, pp. 461-482, July 1987.
17. S. Muroga, #x201C;Lower bound on the number of threshold functions and a maximum weight,#x201D; IRE Trans. Electron. Comput., vol. EC-14, pp. 136-148, 1965.
18. S. Muroga and I. Toda, #x201C;Lower bound on the number of threshold functions,#x201D; IRE Trans. Electron. Comput., vol. EC-15, pp. 805-806, 1966.
19. L. Personnaz, I. Guyon, and G. Dreyfus, #x201C;Designing neural net works satisfying a given set of constraints,#x201D; in Proc. Conf. Neural Networks for Computing, Snowbird, UT, Amer. Inst. Physics, 151, J. S. Denker, Ed., 1986, pp. 356-359.
20. J. C. Platt and J. J. Hopfield, #x201C;Analog decoding using neural networks,#x201D; in Proc. Conf. Neural Networks for Computing, Snowbird, UT, Amer. Inst. Physics, 151, J. S. Denker, Ed., 1986, pp. 364-369.
21. D. Psaltis, and C. H. Park, #x201C;Nonlinear discriminant functions and associative memories,#x201D; in Proc. Conf. Neural Networks for Computing, Snowbird, UT, Amer. Inst. Physics, 151, J. S. Denker, Ed., 1986, pp. 370-375.
22. R. P. Stanley, #x201C;Acyclic orientations of graphs,#x201D; Discrete Math., vol. 5, pp. 171-178, 1973.
23. R. O. Winder, #x201C;Bounds on threshold gate realizability,#x201D; IRE Trans. Electron. Comput., vol. EC-12, pp. 561-564, 1963.