Graph explorer

Gradients without Backpropagation

Using backpropagation to compute gradients of objective functions for optimization has remained a mainstay of machine learning. Backpropagation, or reverse-mode differentiation, is a special case within the general family of automatic differentiation algorithms that also includes the forward mode. We present a method to compute gradients based solely on the directional derivative that one can compute exactly and efficiently via the forward mode. We call this formulation the forward gradient, an unbiased estimate of the gradient that can be evaluated in a single forward run of the function, entirely eliminating the need for backpropagation in gradient descent. We demonstrate forward gradient descent in a range of problems, showing substantial savings in computation and enabling training up to twice as fast in some cases.

7 nodes7 linksoverview previewGradients without Backpropagation
7 nodes7 links
Gradients without Backpropagation7 visible / 7 total nodes / 17 links
Works onCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalAuthorshipWGradients without Backpropagationpreprint / 2022AAtılım Güneş BaydinResearcherABarak A. PearlmutterResearcherADon SymeResearcherAFrank WoodResearcherTMachine Learning49008 worksAPhilip TorrResearcher
PaperSignal 106 links

Gradients without Backpropagation

preprint / 2022

Open