On learning binary weights for majority functions

[1]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4]  Santosh S. Venkatesh,et al.  The capacity of the Hopfield associative memory , 1987, IEEE Trans. Inf. Theory.

[5]  Charles M. Newman,et al.  Memory capacity in neural network models: Rigorous lower bounds , 1988, Neural Networks.

[6]  János Komlós,et al.  Effect of connectivity in associative memory models , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[7]  János Komlós,et al.  Convergence results in an associative memory model , 1988, Neural Networks.

[8]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[9]  Santosh S. Venkatesh,et al.  Programmed interactions in higher-order neural networks: The outer-product algorithm , 1991, J. Complex..

[10]  Santosh S. Venkatesh,et al.  How much information can one bit of memory retain about a Bernoulli sequence? , 1991, IEEE Trans. Inf. Theory.

[11]  Pierre Baldi,et al.  Programmed interactions in higher-order neural networks: Maximal capacity , 1991, J. Complex..

[12]  Demetri Psaltis,et al.  On Reliable Computation With Formal Neurons , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  S. Venkatesh.  Computation and learning in the context of neural network capacity , 1992 .