arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.1020cond-mat.dis-nncond-mat.stat-mechcs.LGq-bio.NC
收藏

Ising感知器权空间中的随机游动学习

Learning by random walks in the weight space of the Ising perceptron

Institute of Theoretical Physics, Chinese Academy of Sciences(中国科学院理论物理研究所);Kavli Institute for Theoretical Physics China(中国卡弗里理论物理研究所)

Haiping Huang, Haijun Zhou

摘要:

几个变种的随机局部搜索过程中构建的Ising感知器的突触权重进行了研究。在这个过程中,二进制模式被顺序地呈现给伊辛感知器,然后随着突触权重配置的修改而被学习,该突触权重配置是通过在先前学习的模式的兼容权重配置空间内的一系列单权重或双权重翻转来修改的。该过程能够达到对于模式长度N = 101的$α\approx 0.63$和对于N = 1001的$α\approx 0.41$的存储容量。如果另外利用再学习过程,则学习性能进一步提高到对于N = 101为$α\approx 0.80$的存储容量和对于N=1001为$α\approx 0.42$的存储容量。我们发现,对于一个给定的学习任务,由随机游走学习过程构建的解决方案是由一个典型的汉明距离,这与学习任务的约束密度$α$减少;在一个固定的值$α$,汉明距离分布的宽度与$N$减少。

英文摘要:

Several variants of a stochastic local search process for constructing the synaptic weights of an Ising perceptron are studied. In this process, binary patterns are sequentially presented to the Ising perceptron and are then learned as the synaptic weight configuration is modified through a chain of single- or double-weight flips within the compatible weight configuration space of the earlier learned patterns. This process is able to reach a storage capacity of $α\approx 0.63$ for pattern length N = 101 and $α\approx 0.41$ for N = 1001. If in addition a relearning process is exploited, the learning performance is further improved to a storage capacity of $α\approx 0.80$ for N = 101 and $α\approx 0.42$ for N=1001. We found that, for a given learning task, the solutions constructed by the random walk learning process are separated by a typical Hamming distance, which decreases with the constraint density $α$ of the learning task; at a fixed value of $α$, the width of the Hamming distance distributions decreases with $N$.

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

↑