Hebbian Descent: A Unified View on Log-Likelihood Learning

被引:0
|
作者
Melchior, Jan [1 ]
Schiewer, Robin [1 ]
Wiskott, Laurenz [1 ]
机构
[1] Ruhr Univ Bochum, D-44801 Bochum, Germany
关键词
CONNECTIONIST MODELS; BACKPROPAGATION; STORAGE;
D O I
10.1162/neco_a_01684
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This study discusses the negative impact of the derivative of the activation functions in the output layer of artificial neural networks, in particular in continual learning. We propose Hebbian descent as a theoretical framework to overcome this limitation, which is implemented through an alternative loss function for gradient descent we refer to as Hebbian descent loss. This loss is effectively the generalized log-likelihood loss and corresponds to an alternative weight update rule for the output layer wherein the derivative of the activation function is disregarded. We show how this update avoids vanishing error signals during backpropagation in saturated regions of the activation functions, which is particularly helpful in training shallow neural networks and deep neural networks where saturating activation functions are only used in the output layer. In combination with centering, Hebbian descent leads to better continual learning capabilities. It provides a unifying perspective on Hebbian learning, gradient descent, and generalized linear models, for all of which we discuss the advantages and disadvantages. Given activation functions with strictly positive derivative (as often the case in practice), Hebbian descent inherits the convergence properties of regular gradient descent. While established pairings of loss and output layer activation function (e.g., mean squared error with linear or cross-entropy with sigmoid/softmax) are subsumed by Hebbian descent, we provide general insights for designing arbitrary loss activation function combinations that benefit from Hebbian descent. For shallow networks, we show that Hebbian descent outperforms Hebbian learning, has a performance similar to regular gradient descent, and has a much better performance than all other tested update rules in continual learning. In combination with centering, Hebbian descent implements a forgetting mechanism that prevents catastrophic interference notably better than the other tested update rules. When training deep neural networks, our experimental results suggest that Hebbian descent has better or similar performance as gradient descent.
引用
收藏
页码:1669 / 1712
页数:44
相关论文
共 50 条
  • [1] LOD SCORE OR LOG-LIKELIHOOD
    EDWARDS, AWF
    NATURE, 1988, 333 (6171) : 308 - 308
  • [2] MULTIPLE ROOTS OF THE TOBIT LOG-LIKELIHOOD
    GREENE, W
    JOURNAL OF ECONOMETRICS, 1990, 46 (03) : 365 - 380
  • [3] BEAMFORMER AS A LOG-LIKELIHOOD RATIO DETECTOR
    LEWIS, JB
    SCHULTHEISS, PM
    IEEE TRANSACTIONS ON AUDIO AND ELECTROACOUSTICS, 1971, AU19 (02): : 140 - +
  • [4] Transfer Entropy as a Log-Likelihood Ratio
    Barnett, Lionel
    Bossomaier, Terry
    PHYSICAL REVIEW LETTERS, 2012, 109 (13)
  • [5] Machine learning of log-likelihood functions in global analysis of parton distributions
    Liu, DianYu
    Sun, ChuanLe
    Gao, Jun
    JOURNAL OF HIGH ENERGY PHYSICS, 2022, 2022 (08)
  • [6] Prototype Learning with Margin-Based Conditional Log-likelihood Loss
    Jin, Xiaobo
    Liu, Cheng-Lin
    Hou, Xinwen
    19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6, 2008, : 22 - 25
  • [7] SOME PROPERTIES OF THE LOG-LIKELIHOOD RATIO
    LEE, CC
    JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1982, 313 (05): : 273 - 285
  • [8] Deep Log-Likelihood Ratio Quantization
    Arvinte, Marius
    Tewfik, Ahmed H.
    Vishwanath, Sriram
    2019 27TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO), 2019,
  • [9] Active learning algorithm using the maximum weighted log-likelihood estimator
    Kanamori, T
    Shimodaira, H
    JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2003, 116 (01) : 149 - 162
  • [10] Discriminative Learning of Bayesian Networks via Factorized Conditional Log-Likelihood
    Carvalho, Alexandra M.
    Roos, Teemu
    Oliveira, Arlindo L.
    Myllymaki, Petri
    JOURNAL OF MACHINE LEARNING RESEARCH, 2011, 12 : 2181 - 2210