We address the task of domain generalization, where the goal is to train a predictive model such that it is able to generalize to a new, previously unseen domain. We choose a hierarchical generative approach within the framework of variational autoencoders and propose a domain-unsupervised algorithm that is able to generalize to new domains without domain supervision. We show that our method is able to learn representations that disentangle domain-specific information from class-label specific information even in complex settings where domain structure is not observed during training. Our interpretable method outperforms previously proposed generative algorithms for domain generalization as well as other non-generative state-of-the-art approaches in several hierarchical domain settings including sequential overlapped near continuous domain shift. It also achieves competitive performance on the standard domain generalization benchmark dataset PACS compared to state-of-the-art approaches which rely on observing domain-specific information during training, as well as another domain unsupervised method. Additionally, we proposed model selection purely based on Evidence Lower Bound (ELBO) and also proposed weak domain supervision where implicit domain information can be added into the algorithm.
翻译:我们处理的是域普遍性的任务,目的是训练一种预测模型,以便它能够推广到新的、以前看不见的领域。我们选择了在变异自动编码器框架内的等级基因化方法,并提出了一种可以在没有域监督的情况下推广到新域的域不受监督的计算法。我们表明,我们的方法能够从即使在培训期间没有观察到域结构的复杂环境中的分类标签特定信息中学习分离特定域信息的表示方式。我们可解释的方法比以前提议的域通用遗传算法以及其他非遗传性状态方法在几个等级域设置中表现得更好,包括相继重叠的近连续域变换。它还在标准域通用基准数据集PACS上取得了竞争性的性能,而后者则依赖于在培训期间观察特定域信息,以及另一个不受监督的域域方法。此外,我们建议纯粹根据证据低音(ELBOO)进行模式选择模式选择,并提议在隐性域信息可以添加到的域内域监测。