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 条
  • [21] Correcting systematic mismatches in computed log-likelihood ratios
    Van Dijk, Marten
    Janssen, Augustus J.E.M.
    Koppelaar, Arie G.C.
    European Transactions on Telecommunications, 2003, 14 (03): : 227 - 244
  • [22] Marginal Weighted Maximum Log-likelihood for Efficient Learning of Perturb-and-Map models
    Shpakova, Tatiana
    Bach, Francis
    Osokin, Anton
    UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, 2018, : 279 - 289
  • [23] Speaker verification using normalized log-likelihood score
    Liu, CS
    Wang, HC
    Lee, CH
    IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, 1996, 4 (01): : 56 - 60
  • [24] Geometry of the log-likelihood ratio statistic in misspecified models
    Choi, Hwan-sik
    Kiefer, Nicholas M.
    JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2011, 141 (06) : 2091 - 2099
  • [25] A Donsker-Type Theorem for Log-Likelihood Processes
    Zhonggen Su
    Hanchao Wang
    Journal of Theoretical Probability, 2020, 33 : 1401 - 1425
  • [26] Approximate Bayesian computation with modified log-likelihood ratios
    Ventura L.
    Reid N.
    METRON, 2014, 72 (2) : 231 - 245
  • [27] Unbiased estimation of the gradient of the log-likelihood in inverse problems
    Jasra, Ajay
    Law, Kody J. H.
    Lu, Deng
    STATISTICS AND COMPUTING, 2021, 31 (03)
  • [28] Median Based Adaptive Quantization of Log-Likelihood Ratios
    Liu, Xiaoran
    Wang, Jian
    Gu, Fanglin
    Xiong, Jun
    Wei, Jibo
    2018 IEEE 87TH VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING), 2018,
  • [29] CONCAVITY OF BOX-COX LOG-LIKELIHOOD FUNCTION
    KOUIDER, E
    CHEN, HF
    STATISTICS & PROBABILITY LETTERS, 1995, 25 (02) : 171 - 175
  • [30] Unbiased estimation of the gradient of the log-likelihood in inverse problems
    Ajay Jasra
    Kody J. H. Law
    Deng Lu
    Statistics and Computing, 2021, 31