### Abstract

Summary form only given. The author considers neural networks with N binary neurons and symmetric lth-order synaptic connections, in which m randomly chosen N-bit patterns are stored and retrieved with a small fraction delta of bit errors allowed. The analysis yields rigorous lower bounds for the maximum possible value of l factorial multiplied by alpha , the number of stored bits per distinct synapse: 0. 11 for l equals 2 (compared to 0. 29 as estimated by Hopfield and Amit et al. ), 0. 22 for l equals 3 and 0. 16 for l equals 4.

Original language | English (US) |
---|---|

Title of host publication | Unknown Host Publication Title |

Publisher | IEEE |

Pages | 50 |

Number of pages | 1 |

State | Published - 1987 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Unknown Host Publication Title*(pp. 50). IEEE.

**MEMORY CAPACITY IN SYMMETRIC NEURAL NETWORKS : RIGOROUS BOUNDS.** / Newman, Charles.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Unknown Host Publication Title.*IEEE, pp. 50.

}

TY - GEN

T1 - MEMORY CAPACITY IN SYMMETRIC NEURAL NETWORKS

T2 - RIGOROUS BOUNDS.

AU - Newman, Charles

PY - 1987

Y1 - 1987

N2 - Summary form only given. The author considers neural networks with N binary neurons and symmetric lth-order synaptic connections, in which m randomly chosen N-bit patterns are stored and retrieved with a small fraction delta of bit errors allowed. The analysis yields rigorous lower bounds for the maximum possible value of l factorial multiplied by alpha , the number of stored bits per distinct synapse: 0. 11 for l equals 2 (compared to 0. 29 as estimated by Hopfield and Amit et al. ), 0. 22 for l equals 3 and 0. 16 for l equals 4.

AB - Summary form only given. The author considers neural networks with N binary neurons and symmetric lth-order synaptic connections, in which m randomly chosen N-bit patterns are stored and retrieved with a small fraction delta of bit errors allowed. The analysis yields rigorous lower bounds for the maximum possible value of l factorial multiplied by alpha , the number of stored bits per distinct synapse: 0. 11 for l equals 2 (compared to 0. 29 as estimated by Hopfield and Amit et al. ), 0. 22 for l equals 3 and 0. 16 for l equals 4.

UR - http://www.scopus.com/inward/record.url?scp=0023538681&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023538681&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0023538681

SP - 50

BT - Unknown Host Publication Title

PB - IEEE

ER -