Front Contribution instead of Back Propagation
Swaroop Mishra, Anjana Arunkumar

TL;DR
The paper introduces the Front-Contribution algorithm, a novel training method that precomputes weight contributions, reducing memory and speed bottlenecks while producing the same outputs as traditional backpropagation.
Contribution
It presents a new algorithm that replaces backpropagation by calculating weight contributions beforehand, simplifying training and improving efficiency.
Findings
Produces identical outputs to backpropagation
Reduces memory usage during training
Increases training speed
Abstract
Deep Learning's outstanding track record across several domains has stemmed from the use of error backpropagation (BP). Several studies, however, have shown that it is impossible to execute BP in a real brain. Also, BP still serves as an important and unsolved bottleneck for memory usage and speed. We propose a simple, novel algorithm, the Front-Contribution algorithm, as a compact alternative to BP. The contributions of all weights with respect to the final layer weights are calculated before training commences and all the contributions are appended to weights of the final layer, i.e., the effective final layer weights are a non-linear function of themselves. Our algorithm then essentially collapses the network, precluding the necessity for weight updation of all weights not in the final layer. This reduction in parameters results in lower memory usage and higher training speed. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Neural Networks and Applications · Advanced Neural Network Applications
