Hopfield model with planted patterns: a teacher-student self-supervised learning model

Francesco Alemanno, Luca Camanzi, Gianluca Manzan, Daniele Tantari
4/26/2023
cond-mat.dis-nncs.LGmath-ph

No confident code implementation found for this paper.

Abstract

While Hopfield networks are known as paradigmatic models for memory storage and retrieval, modern artificial intelligence systems mainly stand on the machine learning paradigm. We show that it is possible to formulate a teacher-student self-supervised learning problem with Boltzmann machines in terms of a suitable generalization of the Hopfield model with structured patterns, where the spin variables are the machine weights and patterns correspond to the training set's examples. We analyze the learning performance by studying the phase diagram in terms of the training set size, the dataset noise and the inference temperature (i.e. the weight regularization). With a small but informative dataset the machine can learn by memorization. With a noisy dataset, an extensive number of examples above a critical threshold is needed. In this regime the memory storage limits of the system becomes an opportunity for the occurrence of a learning regime in which the system can generalize.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{alemanno2023hopfield,
  title  = {Hopfield model with planted patterns: a teacher-student self-supervised learning model},
  author = {Francesco Alemanno and Luca Camanzi and Gianluca Manzan and Daniele Tantari},
  year   = {2023},
  eprint = {2304.13710},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.13710v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.13710.svg)](https://codeofpaper.com/paper/2304.13710)

Discussion