arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.19902cond-mat.dis-nnstat.ML
收藏

一种联邦多对一Hopfield模型用于关联神经网络

A Federated Many-to-One Hopfield model for associative Neural Networks

Università del Salento(萨莱诺大学);Istituto Nazionale di Fisica Nucleare (INFN), Sezione di Lecce(意大利国家核物理研究所(INFN)莱切分部);Istituto Nazionale di Alta Matematica Francesco Severi (INdAM)(弗朗切斯科·塞韦里高等数学国立研究所(INdAM));Sapienza Università di Roma(罗马智慧大学)

Andrea Alessandrelli, Fabrizio Durante, Andrea Ladiana, Andrea Lepre

AI总结:

本文提出一种联邦关联记忆框架,通过学习异质持续环境下的共享原型,解决客户端异质性和流分布偏移问题,提升全局原型重建和关联检索性能。

摘要:

联邦学习允许在不共享原始数据的情况下进行协作训练,但在客户端异质性和流分布偏移下表现不佳,其中漂移和新数据会损害收敛性并导致遗忘。我们提出了一种联邦关联记忆框架,该框架在异质、持续的环境中学习共享原型,其中客户端数据独立但不一定平衡。每个客户端将其经验编码为低秩Hebbian算子,发送到中央服务器进行聚合和分解为全局原型。该方法保留隐私,避免集中回放缓冲区,并对小、噪声或演变的数据集具有鲁棒性。我们将聚合视为低秩加噪声的谱推断问题,推导出可检测性和检索鲁棒性的理论阈值。基于熵的控制器在流模式中平衡稳定性和可塑性。在异质客户端、漂移和新颖性实验中,展示了改进的全局原型重建和关联检索,支持联邦整合的谱观点。

英文摘要:

Federated learning enables collaborative training without sharing raw data, but struggles under client heterogeneity and streaming distribution shifts, where drift and novel data can impair convergence and cause forgetting. We propose a federated associative-memory framework that learns shared archetypes in heterogeneous, continual settings, where client data are independent but not necessarily balanced. Each client encodes its experience as a low-rank Hebbian operator, sent to a central server for aggregation and factorization into global archetypes. This approach preserves privacy, avoids centralized replay buffers, and is robust to small, noisy, or evolving datasets. We cast aggregation as a low-rank-plus-noise spectral inference problem, deriving theoretical thresholds for detectability and retrieval robustness. An entropy-based controller balances stability and plasticity in streaming regimes. Experiments with heterogeneous clients, drift, and novelty show improved global archetype reconstruction and associative retrieval, supporting the spectral view of federated consolidation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑