Federated learning (FL) enables collaborative training without centralizing raw data, but remains notoriously challenged by severe client heterogeneity and catastrophic forgetting under streaming distribution shifts. We propose a federated many-to-one (M2O) associative-memory framework designed for the unsupervised recovery of shared archetypes in continual, non-i.i.d. regimes. Departing from standard gradient-exchange methods, each client compresses its local experience into a low-rank Hebbian correlation operator. A central server then aggregates and factorizes these operators into global archetypes via an L-layer Associative Memory (LAM) architecture, strictly preserving raw-data locality. We rigorously cast the server-side aggregation as a low-rank-plus-noise spectral inference problem, utilizing random matrix theory to derive BBP phase transitions for archetype detectability and retrieval robustness: exact at initialization and, in the feedback-driven continual phase, extended through a conditional decomposition of the aggregated operator that leaves the detection threshold unchanged up to an explicit, server-observable inflation factor. To manage the distributed stability-plasticity dilemma, we introduce a local, label-free entropy controller that adaptively modulates client updates. Finally, we show that our adaptive framework, extended to federated Boolean-Gaussian Restricted Boltzmann Machines (RBMs), significantly outperforms standard FedAvg on structured non-IID datasets, validating the spectral mechanism of federated consolidation.

A federated many-to-one Hopfield model for associative neural networks

Andrea Alessandrelli
;
Fabrizio Durante;Andrea Ladiana;Andrea Lepre
2027-01-01

Abstract

Federated learning (FL) enables collaborative training without centralizing raw data, but remains notoriously challenged by severe client heterogeneity and catastrophic forgetting under streaming distribution shifts. We propose a federated many-to-one (M2O) associative-memory framework designed for the unsupervised recovery of shared archetypes in continual, non-i.i.d. regimes. Departing from standard gradient-exchange methods, each client compresses its local experience into a low-rank Hebbian correlation operator. A central server then aggregates and factorizes these operators into global archetypes via an L-layer Associative Memory (LAM) architecture, strictly preserving raw-data locality. We rigorously cast the server-side aggregation as a low-rank-plus-noise spectral inference problem, utilizing random matrix theory to derive BBP phase transitions for archetype detectability and retrieval robustness: exact at initialization and, in the feedback-driven continual phase, extended through a conditional decomposition of the aggregated operator that leaves the detection threshold unchanged up to an explicit, server-observable inflation factor. To manage the distributed stability-plasticity dilemma, we introduce a local, label-free entropy controller that adaptively modulates client updates. Finally, we show that our adaptive framework, extended to federated Boolean-Gaussian Restricted Boltzmann Machines (RBMs), significantly outperforms standard FedAvg on structured non-IID datasets, validating the spectral mechanism of federated consolidation.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11587/588286
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
social impact