vix.ing · top · new · best · stats · spec

Training DNNs in O(1) memory with MEM-DFA using Random Matrices

2020/12/21 by Tien Dung Chu, Tien Chu, Kamil Mykitiuk +8 · 1 voice · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Memory and Neural Computing #Algorithm #Artificial intelligence #Artificial neural network #Backpropagation #Computer Vision and Pattern Recognition (cs.CV) #Computer science #Constant (computer programming) #FOS: Computer and information sciences #Independence (probability theory) #MNIST database #Machine Learning and ELM #Mathematics #Neural Networks and Applications #Statistics #cs.CV

paper · pdf · doi:10.48550/arxiv.2012.11745

arxiv created 2020/12/21 · openalex publication_date 2020/12/21 · arxiv published 2020/12/21 · arxiv updated 2020/12/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This work presents a method for reducing memory consumption to a constant complexity when training deep neural networks. The algorithm is based on the more biologically plausible alternatives of the backpropagation (BP): direct feedback alignment (DFA) and feedback alignment (FA), which use random matrices to propagate error. The proposed method, memory-efficient direct feedback alignment (MEM-DFA), uses higher independence of layers in DFA and allows avoiding storing at once all activation vectors, unlike standard BP, FA, and DFA. Thus, our algorithm's memory usage is constant regardless of the number of layers in a neural network. The method increases the computational cost only by a constant factor of one extra forward pass. The MEM-DFA, BP, FA, and DFA were evaluated along with their memory profiles on MNIST and CIFAR-10 datasets on various neural network models. Our experiments agree with our theoretical results and show a significant decrease in the memory cost of MEM-DFA compared to the other algorithms.

Citations

Cited by

Discussions

Related