Equivariant Disentangled Transformation for Domain Generalization under Combination Shift
원문 초록
Machine learning systems may encounter unexpected problems when the data distribution changes in the deployment environment. A major reason is that certain combinations of domains and labels are not observed during training but appear in the test environment. Although various invariance-based algorithms can be applied, we find that the performance gain is often marginal. To formally analyze this issue, we provide a unique algebraic formulation of the combination shift problem based on the concepts of homomorphism, equivariance, and a refined definition of disentanglement. The algebraic requirements naturally derive a simple yet effective method, referred to as equivariant disentangled transformation (EDT), which augments the data based on the algebraic structures of labels and makes the transformation satisfy the equivariance and disentanglement requirements. Experimental results demonstrate that invariance may be insufficient, and it is important to exploit the equivariance structure in the combination shift problem.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Panoramic Out-of-Distribution Segmentation
Bridging Domain Generalization to Multimodal Domain Generalization via Unified Representations
Prompt Disentanglement via Language Guidance and Representation Alignment for Domain Generalization
InstructFLIP: Exploring Unified Vision-Language Model for Face Anti-spoofing
Prompt-Free Conditional Diffusion for Multi-object Image Augmentation
Feed-Forward SceneDINO for Unsupervised Semantic Scene Completion
토론
이 논문과 연결된 포럼 글이 아직 없습니다.