让SAM模型持续学习新领域,存储成本仅0.233MB/模块
SAMCL: Empowering SAM to Continually Learn from Dynamic Domains with Extreme Storage Efficiency
- 分模块学习+选择器动态调用,避免灾难性遗忘
- 模块仅需0.233MB存储,比现有方法节省超24%
- 适合需要长期更新的视觉分割场景
Segment Anything Model (SAM) 在开放世界中面对多样化领域时表现不佳。简单微调会引发灾难性遗忘问题。为此,本文提出SAMCL,一种针对SAM的持续学习方法。该方法将增量知识分解为独立模块,并通过选择器在推理时动态选取合适模块。为解决模块学习与存储效率难题,引入AugModule和Module Selector:AugModule通过层间参数共享降低LoRA存储,仅需0.233MB/模块,且利用点提示生成热图提升域适应能力;Module Selector基于SAM嵌入可区分域的特性,仅需训练低消耗嵌入,实现高精度选择,缓冲区存储降低高达256倍。实验表明,SAMCL仅产生0.19%遗忘,未见域性能提升至少2.5%,优于现有最优方法。
原文摘要 · Abstract (English)
Segment Anything Model (SAM) struggles in open-world scenarios with diverse domains. In such settings, naive fine-tuning with a well-designed learning module is inadequate and often causes catastrophic forgetting issue when learning incrementally. To address this issue, we propose a novel continual learning (CL) method for SAM, termed SAMCL. Rather than relying on a fixed learning module, our method decomposes incremental knowledge into separate modules and trains a selector to choose the appropriate one during inference. However, this intuitive design introduces two key challenges: ensuring effective module learning and selection, and managing storage as tasks accumulate. To tackle these, we introduce two components: AugModule and Module Selector. AugModule reduces the storage of the popular LoRA learning module by sharing parameters across layers while maintaining accuracy. It also employs heatmaps-generated from point prompts-to further enhance domain adaptation with minimal additional cost. Module Selector leverages the observation that SAM's embeddings can effectively distinguish domains, enabling high selection accuracy by training on low-consumed embeddings instead of raw images. Experiments show that SAMCL outperforms state-of-the-art methods, achieving only 0.19% forgetting and at least 2.5% gain on unseen domains. Each AugModule requires just 0.233 MB, reducing storage by at least 24.3% over other fine-tuning approaches. The buffer storage for Module Selector is further reduced by up to 256$\times$.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。