LGAICVJun 25, 2021

Domain Conditional Predictors for Domain Adaptation

arXiv:2106.13899v15 citations
Originality Incremental advance
AI Analysis

This work addresses domain adaptation for machine learning practitioners by offering a more generally applicable and stable alternative to existing methods, though it appears incremental as it builds on prior domain adaptation frameworks.

The paper tackles the problem of generalizing across different data sources in domain adaptation by proposing a conditional modeling approach that uses information about the underlying data-generating distribution, resulting in a method that avoids assumptions like covariate shift and simplifies training by eliminating minimax instabilities.

Learning guarantees often rely on assumptions of i.i.d. data, which will likely be violated in practice once predictors are deployed to perform real-world tasks. Domain adaptation approaches thus appeared as a useful framework yielding extra flexibility in that distinct train and test data distributions are supported, provided that other assumptions are satisfied such as covariate shift, which expects the conditional distributions over labels to be independent of the underlying data distribution. Several approaches were introduced in order to induce generalization across varying train and test data sources, and those often rely on the general idea of domain-invariance, in such a way that the data-generating distributions are to be disregarded by the prediction model. In this contribution, we tackle the problem of generalizing across data sources by approaching it from the opposite direction: we consider a conditional modeling approach in which predictions, in addition to being dependent on the input data, use information relative to the underlying data-generating distribution. For instance, the model has an explicit mechanism to adapt to changing environments and/or new data sources. We argue that such an approach is more generally applicable than current domain adaptation methods since it does not require extra assumptions such as covariate shift and further yields simpler training algorithms that avoid a common source of training instabilities caused by minimax formulations, often employed in domain-invariant methods.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes