Orthogonal Knowledge Refreshing for Domain-Incremental Object Detection
Not on the map. Why?
Abstract (arXiv)
Domain-incremental object detection (DIOD) requires models to continually adapt to new domains while preserving prior knowledge. Recently, parameter-efficient fine-tuning offers a promising avenue, wherein a pre-trained model is frozen and a small number of learnable parameters are injected for downstream tasks. However, these methods risk overwriting critical past knowledge, triggering inter-domain interference and performance degradation. To address this challenge, we propose Orthogonal Knowledge Refreshing (OKR), a simple yet effective framework for DIOD. OKR incrementally constructs independent domain-specific subspaces via dedicated low-rank branches for each domain, which are seamlessly fused for a holistic decision, enabling conflict-free capacity expansion without domain selection during inference. To minimize knowledge interference during fusion, we present a gradient-based orthogonal refreshing strategy that projects gradient updates of new domains onto the orthogonal complement of the fused historical subspace, supporting continual adaptation without forgetting. Moreover, to mitigate semantic fragmentation across domains, we enforce topology-aware consistency, aligning the semantic structures of old and new domains. Extensive experiments validate the superiority of OKR, outperforming the best exemplar-free method by significant margins of +5.6% and +6.5% mAP on the Pascal VOC and BDD100K series, respectively.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 43 of its 61 references that are in the map. First posted on arXiv 19 Jul 2026.
Builds on
43 of 61 references.
References · 43
- 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
- 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,427
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2016Learning without Forgettingcited by 2,465
- 2022Conditional Prompt Learning for Vision-Language Modelscited by 1,427
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
- 2018BDD100K: A Diverse Driving Dataset for Heterogeneous Multitask Learningcited by 1,282
- 2018Experience Replay for Continual Learningcited by 1,074
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2021Learning to Prompt for Continual Learningcited by 938
- 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 844
- 2022Exploring Plain Vision Transformer Backbones for Object Detectioncited by 723
31 more
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
- 2021Gradient Projection Memory for Continual Learningcited by 338
- 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 296
- 2021DyTox: Transformers for Continual Learning with DYnamic TOken eXpansioncited by 291
- 2021Rainbow Memory: Continual Learning with a Memory of Diverse Samplescited by 273
- 2018Strong-Weak Distribution Alignment for Adaptive Object Detectioncited by 269
- 2022S-Prompts Learning with Pre-trained Transformers: An Occam's Razor for Domain Incremental Learningcited by 246
- 2022Prompt Distribution Learningcited by 235
- 2018Cross-Domain Weakly-Supervised Object Detection through Progressive Domain Adaptationcited by 218
- 2023Class-Incremental Learning: A Surveycited by 209
- 2021Model Adaptation: Historical Contrastive Learning for Unsupervised Domain Adaptation without Source Datacited by 152
- 2021MeGA-CDA: Memory Guided Attention for Category-Aware Unsupervised Domain Adaptive Object Detectioncited by 106
- 2022Source-Free Domain Adaptation via Distribution Estimationcited by 97
- 2022Overcoming Catastrophic Forgetting in Incremental Object Detection via Elastic Response Distillationcited by 72
- 2021VDM-DA: Virtual Domain Modeling for Source Data-free Domain Adaptationcited by 69
- 2022Instance Relation Graph Guided Source-Free Domain Adaptive Object Detectioncited by 55
- 2021Active Learning for Domain Adaptation: An Energy-Based Approachcited by 53
- 2021Layerwise Optimization by Gradient Decomposition for Continual Learningcited by 51
- 2021Multi-View Correlation Distillation for Incremental Object Detectioncited by 36
- 2020SID: Incremental Learning for Anchor-Free Object Detection via Selective and Inter-Related Distillationcited by 32
- 2023A Unified Approach to Domain Incremental Learning with Memory: Theory and Algorithmcited by 32
- 2023Universality and Limitations of Prompt Tuningcited by 30
- 2021Generation, augmentation, and alignment: A pseudo-source domain based method for source-free domain adaptationcited by 28
- 2021Multi-Source Domain Adaptation for Object Detectioncited by 21
- 2021Nearest Neighborhood-Based Deep Clustering for Source Data-absent Unsupervised Domain Adaptationcited by 16
- 2025DCA: Dividing and Conquering Amnesia in Incremental Object Detectioncited by 7
- 2025Boosting Domain Incremental Learning: Selecting the Optimal Parameters is All You Needcited by 6
- 2025Specifying What You Know or Not for Multi-Label Class-Incremental Learningcited by 4
- 2025The Devil is in Fine-tuning and Long-tailed Problems:A New Benchmark for Scene Text Detectioncited by 3
- 2025Class-Agnostic Region-of-Interest Matching in Document Imagescited by 2
- 2026Focus, Align, and Sustain: Counteracting Gradient Dilution in Incremental Object Detectioncited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.