atlas

Research map / Label-efficient and robust learning / Domain adaptation and generalization

When Domain Generalization meets Generalized Category Discovery: An Adaptive Task-Arithmetic Driven Approach

CVPR 2025 · Label-efficient and robust learning › Domain adaptation and generalization · approach: Optimization-based domain generalization · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Introduces domain-generalized generalized category discovery (DG-GCD) and DG2CD-Net, which trains a ViT with episodic cross-domain GCD tasks on source plus diffusion-synthesized domains and merges episode task vectors with validation-performance-based softmax weights.

Problem

Generalized category discovery under domain shift when only labeled source data (with base classes only) is available during training and the target domain, containing both known and novel classes, is unseen until inference.

Approach

Episodic training on cross-domain GCD tasks built from source data and InstructPix2Pix-synthesized pseudo-target domains, combined with a margin loss for open-set domain alignment and a task-arithmetic update whose task vectors are weighted by softmax over GCD (All) scores on a held-out validation distribution.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace generated synthetic domains with manual augmentations (ablation)DG2CD-Net · PACSAll: 63.92 vs 73.30; decreases it by 9.38%Hurt
Remove synthetic domains (ablation)DG2CD-Net · PACSAll: 50.91 vs 73.30; reduces the All metric by 22.39%Hurt
Use a single global update instead of iterative updates (ablation)DG2CD-Net · PACSAll: 66.70 vs 73.30; lowers the All metric by 6.60%Hurt
Fix known/novel class splits across episodes (ablation)DG2CD-Net · PACSAll: 68.60 vs 73.30; 4.70% decreaseHurt
Replace softmax task-vector weighting with min-max normalization (ablation)DG2CD-Net · PACSAll: 61.98 vs 73.30; reduces All by 11.32%Hurt
Use episode-specific validation data instead of a separate held-out Dvalid (ablation)DG2CD-Net · PACSAll: 69.26 vs 73.30; decreases it by 4.04%Hurt
Replace proposed CD-GCD losses with CDAD-Net losses (ablation)DG2CD-Net · PACSAll: 69.82 vs 73.30; 3.48% dropHurt
Replace adaptive task-vector aggregation with Fisher merging (ablation)DG2CD-Net · PACSAll: 71.67 vs 73.30; 1.63% declineHurt
Add supervised contrastive loss Ls_con (ablation)DG2CD-Net · PACSAll: 41.98 -> 60.63Helped
Add unsupervised contrastive loss Lu_con (ablation)DG2CD-Net · PACSAll: 41.98 -> 67.84Helped
Combine supervised and unsupervised contrastive losses (ablation)DG2CD-Net · PACSAll: 41.98 -> 68.70Helped
Combine supervised contrastive loss and open-set adversarial loss (ablation)DG2CD-Net · PACSAll: 41.98 -> 64.16Helped

Surprising findings

Limitations

Experimental setup

Datasets: PACS Office-Home DomainNet

Benchmarks: PACS Office-Home DomainNet

Metrics: All accuracy Old accuracy New accuracy cluster number estimation

Baselines: ViT GCD SimGCD CMS CDAD-Net SODG-Net DAML TIES-Merging Fisher Merging

Builds on: Task Arithmetic CDAD-Net GCD InstructPix2Pix DINO

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy