DA3:Dynamic Additive Attention Adaption for Memory-EfficientOn-Device Multi-Domain Learning
Not on the map. Why?
Abstract (arXiv)
Nowadays, one practical limitation of deep neural network (DNN) is its high degree of specialization to a single task or domain (e.g., one visual domain). It motivates researchers to develop algorithms that can adapt DNN model to multiple domains sequentially, while still performing well on the past domains, which is known as multi-domain learning. Almost all conventional methods only focus on improving accuracy with minimal parameter update, while ignoring high computing and memory cost during training, which makes it difficult to deploy multi-domain learning into more and more widely used resource-limited edge devices, like mobile phones, IoT, embedded systems, etc. We observe that large memory used for activation storage is the bottleneck that largely limits the training time and cost on edge devices. To reduce training memory usage, while keeping the domain adaption accuracy performance, we propose Dynamic Additive Attention Adaption (DA3), a novel memory-efficient on-device multi-domain learning method. DA3 learns a novel additive attention adaptor module, while freezing the weights of the pre-trained backbone model for each domain. Differentiating from prior works, such module not only mitigates activation memory buffering for reducing memory usage during training but also serves as a dynamic gating mechanism to reduce the computation cost for fast inference. We validate DA3 on multiple datasets against state-of-the-art methods, which shows great improvement in both accuracy and training time. Moreover, we deployed DA3 into the popular NIVDIA Jetson Nano edge GPU, where the measured experimental results show our proposed DA3 reduces the on-device training memory consumption by 19-37x, and training time by 2x, in comparison to the baseline methods (e.g., standard fine-tuning, Parallel and Series Res. adaptor, and Piggyback).
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Dec 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 0; 2025: 2.
6 papers.
- 2023EcoTTA: Memory-Efficient Continual Test-time Adaptation via Self-distilled Regularizationcited by 123
- 2022Budget-Aware Pruning for Multi-Domain Learningcited by 1
- 2023Parameter-efficient Multi-Task and Multi-Domain Learning using Factorized Tensor Networkscited by 1
- 2025Efficient Continual Learning through Frequency Decomposition and Integrationcited by 1
- 2023Budget-Aware Pruning: Handling Multiple Domains with Less Parameterscited by 0
- 2025S2A: A Unified Framework for Parameter and Memory Efficient Transfer Learningcited by 0
- 2025Efficient Continual Learning through Frequency Decomposition and Integration28 Mar 2025
- 2025S2A: A Unified Framework for Parameter and Memory Efficient Transfer Learning11 Mar 2025
- 2023Parameter-efficient Multi-Task and Multi-Domain Learning using Factorized Tensor Networks9 Oct 2023
- 2023Budget-Aware Pruning: Handling Multiple Domains with Less Parameters20 Sep 2023
- 2023EcoTTA: Memory-Efficient Continual Test-time Adaptation via Self-distilled Regularization3 Mar 2023
- 2022Budget-Aware Pruning for Multi-Domain Learning14 Oct 2022