Pith. sign in

REVIEW

A Comparative Study of Sparse Associative Memories

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1512.08892 v3 pith:32YW3FTU submitted 2015-12-30 math.PR

Vincent Gripon , Judith Heusel , Matthias Löwe , Franck Vermet This is my paper
classification math.PR
keywords associativememoriessparsevariousarchitecturescapacitycomparativecompare
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We study various models of associative memories with sparse information, i.e. a pattern to be stored is a random string of $0$s and $1$s with about $\log N$ $1$s, only. We compare different synaptic weights, architectures and retrieval mechanisms to shed light on the influence of the various parameters on the storage capacity.

Discussion (0). Sign in to comment.

Pith tools