Non-stationary Domain Generalization: Theory and Algorithm
원문 초록
Although recent advances in machine learning have shown its success to learn from independent and identically distributed (IID) data, it is vulnerable to out-of-distribution (OOD) data in an open world. Domain generalization (DG) deals with such an issue and it aims to learn a model from multiple source domains that can be generalized to unseen target domains. Existing studies on DG have largely focused on stationary settings with homogeneous source domains. However, in many applications, domains may evolve along a specific direction (e.g., time, space). Without accounting for such non-stationary patterns, models trained with existing methods may fail to generalize on OOD data. In this paper, we study domain generalization in non-stationary environment. We first examine the impact of environmental non-stationarity on model performance and establish the theoretical upper bounds for the model error at target domains. Then, we propose a novel algorithm based on adaptive invariant representation learning, which leverages the non-stationary pattern to train a model that attains good performance on target domains. Experiments on both synthetic and real data validate the proposed algorithm.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Feed-Forward SceneDINO for Unsupervised Semantic Scene Completion
LangDAug: Langevin Data Augmentation for Multi-Source Domain Generalization in Medical Image Segmentation
Self-Supervised and Generalizable Tokenization for CLIP-Based 3D Understanding
On the Mechanisms of Adversarial Data Augmentation for Robust and Adaptive Transfer Learning
On Designing Diffusion Autoencoders for Efficient Generation and Representation Learning
InstructFLIP: Exploring Unified Vision-Language Model for Face Anti-spoofing
토론
이 논문과 연결된 포럼 글이 아직 없습니다.