Beyond Low-rank Decomposition: A Shortcut Approach for Efficient On-Device Learning

Le-Trung Nguyen, Ael Quelennec, Van-Tam Nguyen, Enzo Tartaglione
5/8/2025
cs.LGcs.AI

No official code found. Best implementation: Le-TrungNguyen/ICML2025-ASI (2 stars, MIT, last commit 2026-02-12).

Abstract

On-device learning has emerged as a promising direction for AI development, particularly because of its potential to reduce latency issues and mitigate privacy risks associated with device-server communication, while improving energy efficiency. Despite these advantages, significant memory and computational constraints still represent major challenges for its deployment. Drawing on previous studies on low-rank decomposition methods that address activation memory bottlenecks in backpropagation, we propose a novel shortcut approach as an alternative. Our analysis and experiments demonstrate that our method can reduce activation memory usage, even up to $120.09\times$ compared to vanilla training, while also reducing overall training FLOPs up to $1.86\times$ when evaluated on traditional benchmarks.

View on arXivView PDF

Code Implementations(1)

MIT

Official repository for the paper Beyond Low-rank Decomposition: A Shortcut Approach for Efficient On-Device Learning.

21CSS, ShellMay 28, 20258 months agoMIT

Similar Papers

Cite this paper

@article{nguyen2025beyond,
  title  = {Beyond Low-rank Decomposition: A Shortcut Approach for Efficient On-Device Learning},
  author = {Le-Trung Nguyen and Ael Quelennec and Van-Tam Nguyen and Enzo Tartaglione},
  year   = {2025},
  eprint = {2505.05086},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.05086v2},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.05086.svg)](https://codeofpaper.com/paper/2505.05086)

Discussion