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

类自旋玻璃神经网络中记忆的拆除与强化

Demolition and Reinforcement of Memories in Spin-Glass-like Neural Networks

Enrico Ventura

AI总结:

本文研究Unlearning算法在联想记忆与生成模型中的作用,将其简化为线性感知机并提出Boltzmann Machines新型正则化方法,提升了隐藏分布学习性能。

摘要:

统计力学通过将生物神经系统建模为具有可调相互作用的互连单元循环网络,为其研究作出了重大贡献。已有若干算法被提出以优化神经连接,使网络能够完成信息存储(即联想记忆)和从数据中学习概率分布(即生成建模)等任务。在这些方法中,与新兴突触可塑性理论相一致的Unlearning算法由John Hopfield及其合作者提出。本论文的主要目标是理解Unlearning在联想记忆模型和生成模型中的有效性。首先,我们证明Unlearning算法可以简化为一个线性感知机模型,该模型从具有特定内部相关性的含噪样本中学习。结构化训练数据的选择使联想记忆模型能够将概念检索为神经动力学的吸引子,并具有相当大的吸引域。随后,本文提出了一种用于Boltzmann Machines的新型正则化技术,证明其在从数据集中学习隐藏概率分布方面优于先前开发的方法。Unlearning规则由这一新的正则化算法导出,并表明在推断性能方面可与传统Boltzmann-Machine学习相媲美。

英文摘要:

Statistical mechanics has made significant contributions to the study of biological neural systems by modeling them as recurrent networks of interconnected units with adjustable interactions. Several algorithms have been proposed to optimize the neural connections to enable network tasks such as information storage (i.e. associative memory) and learning probability distributions from data (i.e. generative modeling). Among these methods, the Unlearning algorithm, aligned with emerging theories of synaptic plasticity, was introduced by John Hopfield and collaborators. The primary objective of this thesis is to understand the effectiveness of Unlearning in both associative memory models and generative models. Initially, we demonstrate that the Unlearning algorithm can be simplified to a linear perceptron model which learns from noisy examples featuring specific internal correlations. The selection of structured training data enables an associative memory model to retrieve concepts as attractors of a neural dynamics with considerable basins of attraction. Subsequently, a novel regularization technique for Boltzmann Machines is presented, proving to outperform previously developed methods in learning hidden probability distributions from data-sets. The Unlearning rule is derived from this new regularized algorithm and is showed to be comparable, in terms of inferential performance, to traditional Boltzmann-Machine learning.

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

↑