Continuous Invariance Learning
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 38 of its 60 references that are in the map. First posted on arXiv 9 Oct 2023.
Builds on
38 of 60 references.
References · 38
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2019Invariant Risk Minimizationcited by 1,832
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
- 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,194
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
26 more
- 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
- 2015Causal inference using invariant prediction: identification and confidence intervalscited by 533
- 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 379
- 2020Environment Inference for Invariant Learningcited by 306
- 2021Invariance Principle Meets Information Bottleneck for Out-of-Distribution Generalizationcited by 220
- 2020Invariant Risk Minimization Gamescited by 188
- 2021Fishr: Invariant Gradient Variances for Out-of-Distribution Generalizationcited by 186
- 2020Invariant Rationalizationcited by 131
- 2018Anchor regression: heterogeneous data meets causalitycited by 116
- 2021Invariant Information Bottleneck for Domain Generalizationcited by 86
- 2022Wild-Time: A Benchmark of in-the-Wild Distribution Shift over Timecited by 85
- 2020Continuously Indexed Domain Adaptationcited by 74
- 2022Domain-Adjusted Regression or: ERM May Already Learn Features Sufficient for Out-of-Distribution Generalizationcited by 69
- 2017Incremental Adversarial Domain Adaptation for Continually Changing Environmentscited by 52
- 2020Train simultaneously, generalize better: Stability of gradient-based minimax learnerscited by 43
- 2021Stability and Generalization of Stochastic Gradient Methods for Minimax Problemscited by 35
- 2022Out-of-Distribution Representation Learning for Time Series Classificationcited by 30
- 2020Generalization Bounds for Stochastic Saddle Point Problemscited by 27
- 2023Spurious Feature Diversification Improves Out-of-distribution Generalizationcited by 26
- 2020Enforcing Predictive Invariance across Structured Biomedical Domainscited by 23
- 2020Risk Variance Penalizationcited by 21
- 2022Graph-Relational Domain Adaptationcited by 19
- 2023Domain-Indexing Variational Bayes: Interpretable Domain Index for Domain Adaptationcited by 19
- 2023Taxonomy-Structured Domain Adaptationcited by 6
- 2022RobustScaler: QoS-Aware Autoscaling for Complex Workloadscited by 4
Built on by
Citing papers per year: 2024: 2; 2025: 2; 2026: 2.
6 papers.
- 2024A Sober Look at the Robustness of CLIPs to Spurious Featurescited by 38
- 2024Continuous Temporal Domain Generalizationcited by 14
- 2025Learning Time-Aware Causal Representation for Model Generalization in Evolving Domainscited by 5
- 2025Continuous Domain Generalizationcited by 2
- 2026Koopman Operator Identification of Model Parameter Trajectories for Temporal Domain Generalization (KOMET)cited by 1
- 2026Manifold-Aware Temporal Domain Generalization for Large Language Modelscited by 0
- 2026Koopman Operator Identification of Model Parameter Trajectories for Temporal Domain Generalization (KOMET)27 Mar 2026
- 2026Manifold-Aware Temporal Domain Generalization for Large Language Models12 Feb 2026
- 2025Learning Time-Aware Causal Representation for Model Generalization in Evolving Domains21 Jun 2025
- 2025Continuous Domain Generalization17 May 2025
- 2024Continuous Temporal Domain Generalization25 May 2024
- 2024A Sober Look at the Robustness of CLIPs to Spurious Features18 Mar 2024