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

Activation Map Compression through Tensor Decomposition for Deep Learning

2024/11/10 by Thi To Loan Nguyen, Nguyen, Le-Trung, Aël Quélennec +7 · 4 citations
Computer Science · Mathematics · #Computational Physics and Python Applications #Computer Vision and Pattern Recognition (cs.CV) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Parallel Computing and Optimization Techniques #Tensor decomposition and applications

paper · pdf · doi:10.48550/arxiv.2411.06346

openalex publication_date 2024/11/10 · openalex created_date 2024/11/15 · openalex updated_date 2026/07/30

Abstract

Internet of Things and Deep Learning are synergetically and exponentially growing industrial fields with a massive call for their unification into a common framework called Edge AI. While on-device inference is a well-explored topic in recent research, backpropagation remains an open challenge due to its prohibitive computational and memory costs compared to the extreme resource constraints of embedded devices. Drawing on tensor decomposition research, we tackle the main bottleneck of backpropagation, namely the memory footprint of activation map storage. We investigate and compare the effects of activation compression using Singular Value Decomposition and its tensor variant, High-Order Singular Value Decomposition. The application of low-order decomposition results in considerable memory savings while preserving the features essential for learning, and also offers theoretical guarantees to convergence. Experimental results obtained on main-stream architectures and tasks demonstrate Pareto-superiority over other state-of-the-art solutions, in terms of the trade-off between generalization and memory footprint.

Cited by

Related