Incremental Multi-Domain Learning with Network Latent Tensor Factorization
Adrian Bulat, Jean Kossaifi, Georgios Tzimiropoulos, Maja Pantic
Abstract
The prominence of deep learning, large amount of annotated data and increasingly powerful hardware made it possible to reach remarkable performance for supervised classification tasks, in many cases saturating the training sets. However the resulting models are specialized to a single very specific task and domain. Adapting the learned classification to new domains is a hard problem due to at least three reasons: (1) the new domains and the tasks might be drastically different; (2) there might be very limited amount of annotated data on the new domain and (3) full training of a new model for each new task is prohibitive in terms of computation and memory, due to the sheer number of parameters of deep CNNs. In this paper, we present a method to learn new-domains and tasks incrementally, building on prior knowledge from already learned tasks and without catastrophic forgetting. We do so by jointly parametrizing weights across layers using low-rank Tucker structure. The core is task agnostic while a set of task specific factors are learnt on each new domain. We show that leveraging tensor structure enables better performance than simply using matrix operations. Joint tensor modelling also naturally leverages correlations across different layers. Compared with previous methods which have focused on adapting each layer separately, our approach results in more compact representations for each new task/domain. We apply the proposed method to the 10 datasets of the Visual Decathlon Challenge and show that our method offers on average about 7.5× reduction in number of parameters and competitive performance in terms of both classification accuracy and Decathlon score.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext c5fe8208-319d-4ccc-9fd2-b3bfc79f94e7Cited by top-tier papers4
- Multilinear Mixture of Experts: Scalable Expert Specialization through FactorizationJames Oldfield, Markos Georgopoulos, Grigorios Chrysos, Christos Tzelepis et al.NeurIPS 2024 · 41 citations
- Tesseract: Tensorised Actors for Multi-Agent Reinforcement LearningAnuj Mahajan, Mikayel Samvelyan, Lei Mao, Viktor Makoviychuk et al.ICML 2021 · 38 citations
- Sharing Less is More: Lifelong Learning in Deep Networks with Selective Layer TransferSeungwon Lee, Sima Behpour, Eric EatonICML 2021 · 21 citations
- Visual Representation Learning over Latent DomainsLucas Deecke, Timothy M. Hospedales, Hakan BilenICLR 2022 · 14 citations
Related papers
- Incremental Learning via Rate ReductionZiyang Wu, Christina Baek, Chong You, Yi MaCVPR 2021
- CLR: Channel-wise Lightweight Reprogramming for Continual LearningYunhao Ge, Yuecheng Li, Shuo Ni, Jiaping Zhao et al.ICCV 2023 · 16 citations
- Layerwise Optimization by Gradient Decomposition for Continual LearningShixiang Tang, Dapeng Chen, Jinguo Zhu, Shijie Yu et al.CVPR 2021
- DKT: Diverse Knowledge Transfer Transformer for Class Incremental LearningXinyuan Gao, Yuhang He, Songlin Dong, Jie Cheng et al.CVPR 2023
- Growing a Brain with Sparsity-Inducing Generation for Continual LearningHyundong Jin, Gyeong-Hyeon Kim, Chanho Ahn, Eunwoo KimICCV 2023 · 7 citations
