Daydreaming algorithm for Biased Patterns
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908983382507520 |
|---|---|
| author | Doi, Mikiya Ohzeki, Masayuki Ricci-Tersenghi, Federico |
| author_facet | Doi, Mikiya Ohzeki, Masayuki Ricci-Tersenghi, Federico |
| contents | The \emph{Daydreaming} algorithm was proposed as a learning rule that simultaneously reinforces stored patterns and suppresses spurious attractors to improve the storage capacity of the Hopfield model. Its effectiveness has been reported for both uncorrelated and correlated data. However, the existing formulation has mainly assumed unbiased patterns, and the formulation for biased patterns has not yet been sufficiently established. Biased patterns are known to be much more problematic for models of associative memories. In this study, we reformulate Daydreaming for biased patterns by starting from the underlying rationale of the pseudo-inverse rule. Specifically, we introduce the retrieval dynamics and an energy function based on the centered representation, and we derive a corresponding update rule for centered Daydreaming. We compare the centered pseudo-inverse rule with centered Daydreaming for biased patterns and examine the retrieval maps and eigenvalue distributions of the coupling matrices. Our results confirm that centered Daydreaming yields a larger basin of attraction than the centered pseudo-inverse rule. Moreover, as in previous studies, although both approaches aim to stabilize the stored patterns as fixed points, our results suggest that they shape the energy landscape through different mechanisms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_19258 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Daydreaming algorithm for Biased Patterns Doi, Mikiya Ohzeki, Masayuki Ricci-Tersenghi, Federico Disordered Systems and Neural Networks The \emph{Daydreaming} algorithm was proposed as a learning rule that simultaneously reinforces stored patterns and suppresses spurious attractors to improve the storage capacity of the Hopfield model. Its effectiveness has been reported for both uncorrelated and correlated data. However, the existing formulation has mainly assumed unbiased patterns, and the formulation for biased patterns has not yet been sufficiently established. Biased patterns are known to be much more problematic for models of associative memories. In this study, we reformulate Daydreaming for biased patterns by starting from the underlying rationale of the pseudo-inverse rule. Specifically, we introduce the retrieval dynamics and an energy function based on the centered representation, and we derive a corresponding update rule for centered Daydreaming. We compare the centered pseudo-inverse rule with centered Daydreaming for biased patterns and examine the retrieval maps and eigenvalue distributions of the coupling matrices. Our results confirm that centered Daydreaming yields a larger basin of attraction than the centered pseudo-inverse rule. Moreover, as in previous studies, although both approaches aim to stabilize the stored patterns as fixed points, our results suggest that they shape the energy landscape through different mechanisms. |
| title | Daydreaming algorithm for Biased Patterns |
| topic | Disordered Systems and Neural Networks |
| url | https://arxiv.org/abs/2604.19258 |