pith. sign in

arxiv: 1810.09284 · v3 · pith:ZM4JLG7Lnew · submitted 2018-10-19 · 💻 cs.LG

Gradient target propagation

classification 💻 cs.LG
keywords learningtargetbackpropagationnetworksneuralruleadditionalanalysis
0
0 comments X
read the original abstract

We report a learning rule for neural networks that computes how much each neuron should contribute to minimize a giving cost function via the estimation of its target value. By theoretical analysis, we show that this learning rule contains backpropagation, Hebian learning, and additional terms. We also give a general technique for weights initialization. Our results are at least as good as those obtained with backpropagation. The neural networks are trained and tested in three problems: MNIST, MNIST-Fashion, and CIFAR-10 datasets. The associated code is available at https://github.com/tiago939/target.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.