Vincent Gripon's Homepage

Research and Teaching Blog

Nearly-optimal associative memories based on distributed constant weight codes

V. Gripon and C. Berrou, "Nearly-optimal associative memories based on distributed constant weight codes," in Proceedings of Information Theory and Applications Workshop, San Diego, CA, USA, pp. 269--273, February 2012.

A new family of sparse neural networks achieving nearly optimal performance has been recently introduced. In these networks, messages are stored as cliques in clustered graphs. In this paper, we interpret these networks using the formalism of error correcting codes. To achieve this, we introduce two original codes, the thrifty code and the clique code, that are both sub-families of binary constant weight codes. We also provide the networks with an enhanced retrieving rule that enables a property of answer correctness and that improves performance.

I thank Pascal Vontobel for pointing out several mistakes in the article (this version is updated).

Download manuscript.
Download presentation support.

Bibtex
@inproceedings{GriBer20122,
  author = {Vincent Gripon and Claude Berrou},
  title = {Nearly-optimal associative memories based
on distributed constant weight codes},
  booktitle = {Proceedings of Information Theory and
Applications Workshop},
  year = {2012},
  address = {San Diego, CA, USA},
  pages = {269--273},
  month = {February},
}




You are the 1975750th visitor

Vincent Gripon's Homepage