Continuous Invariance Learning
Yong Lin, Fan Zhou, Lu Tan, Lintao Ma, Jiameng Liu, Yansu He, Yuan Yuan, Yu Liu, James Zhang, Yujiu Yang, Hao Wang
TL;DR
Continuous Invariance Learning (CIL) addresses out-of-distribution generalization under continuous domain shifts by extending invariance learning beyond discrete domains. Unlike prior IRM-based methods that align $ oldsymbol{E}^t[oldsymbol{y}|oldsymbol{c Phi(x)}]$, CIL aligns $ oldsymbol{E}^y[oldsymbol{t}|oldsymbol{c Phi(x)}]$ via a minimax objective that uses two domain regressors to predict the continuous domain index from invariant features and from invariant-plus-label features. Theoretical results show CIL avoids the finite-sample pitfalls of existing methods and can recover invariant features even with many domains, while empirical results across synthetic CMNIST and real-world tasks (HousePrice, Insurance Fraud, Alipay Auto-scaling, WildTime-YearBook) demonstrate consistent improvements over strong baselines. The findings suggest CIL provides a practical, robust approach for OOD generalization in settings with continuously indexed domains, with potential applications in time-based and production-system data streams.
Abstract
Invariance learning methods aim to learn invariant features in the hope that they generalize under distributional shifts. Although many tasks are naturally characterized by continuous domains, current invariance learning techniques generally assume categorically indexed domains. For example, auto-scaling in cloud computing often needs a CPU utilization prediction model that generalizes across different times (e.g., time of a day and date of a year), where `time' is a continuous domain index. In this paper, we start by theoretically showing that existing invariance learning methods can fail for continuous domain problems. Specifically, the naive solution of splitting continuous domains into discrete ones ignores the underlying relationship among domains, and therefore potentially leads to suboptimal performance. To address this challenge, we then propose Continuous Invariance Learning (CIL), which extracts invariant features across continuously indexed domains. CIL is a novel adversarial procedure that measures and controls the conditional independence between the labels and continuous domain indices given the extracted features. Our theoretical analysis demonstrates the superiority of CIL over existing invariance learning methods. Empirical results on both synthetic and real-world datasets (including data collected from production systems) show that CIL consistently outperforms strong baselines among all the tasks.
