mlsanityData to 14 Oct 2026

Learning by the F-adjoint

arXiv 2407.11049 ↗First posted 8 Jul 2024cs.LG cs.NEcited by 1

Not on the map. Why?

Abstract (arXiv)

A recent paper by Boughammoura (2023) describes the back-propagation algorithm in terms of an alternative formulation called the F-adjoint method. In particular, by the F-adjoint algorithm the computation of the loss gradient, with respect to each weight within the network, is straightforward and can simply be done. In this work, we develop and investigate this theoretical framework to improve some supervised learning algorithm for feed-forward neural network. Our main result is that by introducing some neural dynamical model combined by the gradient descent algorithm, we derived an equilibrium F-adjoint process which yields to some local learning rule for deep feed-forward networks setting. Experimental results on MNIST and Fashion-MNIST datasets, demonstrate that the proposed approach provide a significant improvements on the standard back-propagation training procedure.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 17 references that are in the map. First posted on arXiv 8 Jul 2024.

Builds on

7 of 17 references.

References · 7

  1. 2018An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modelingcited by 1,476
  2. 2019Deep Equilibrium Modelscited by 615
  3. 2016Direct Feedback Alignment Provides Learning in Deep Neural Networkscited by 240
  4. 2017Equivalence of Equilibrium Propagation and Recurrent Backpropagationcited by 32
  5. 2020Activation Relaxation: A Local Dynamical Approximation to Backpropagation in the Braincited by 11
  6. 2023A Two-Step Rule for Backpropagationcited by 2
  7. 2023Backpropagation and F-adjointcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.