Towards IID representation learning and its application on biomedical data
Not on the map. Why?
Abstract (arXiv)
Due to the heterogeneity of real-world data, the widely accepted independent and identically distributed (IID) assumption has been criticized in recent studies on causality. In this paper, we argue that instead of being a questionable assumption, IID is a fundamental task-relevant property that needs to be learned. Consider k independent random vectors mathsfXi = 1, ldots, k, we elaborate on how a variety of different causal questions can be reformulated to learning a task-relevant function φ that induces IID among mathsfZi := φ circ mathsfXi, which we term IID representation learning. For proof of concept, we examine the IID representation learning on Out-of-Distribution (OOD) generalization tasks. Concretely, by utilizing the representation obtained via the learned function that induces IID, we conduct prediction of molecular characteristics (molecular prediction) on two biomedical datasets with real-world distribution shifts introduced by a) preanalytical variation and b) sampling protocol. To enable reproducibility and for comparison to the state-of-the-art (SOTA) methods, this is done by following the OOD benchmarking guidelines recommended from WILDS. Compared to the SOTA baselines supported in WILDS, the results confirm the superior performance of IID representation learning on OOD tasks. The code is publicly accessible via https://github.com/CTPLab/IIDrepresentationlearning.
Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Builds on 30 of its 64 references that are in the map. First posted on arXiv 1 Mar 2022.
Builds on
30 of 64 references.
References · 30
- 2015Deep Residual Learning for Image Recognitioncited by 51,950
- 2018The Unreasonable Effectiveness of Deep Features as a Perceptual Metriccited by 11,082
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,991
- 2016Densely Connected Convolutional Networkscited by 6,707
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,000
- 2016Layer Normalizationcited by 5,624
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,786
- 2019Analyzing and Improving the Image Quality of StyleGANcited by 3,585
- 2015Domain-Adversarial Training of Neural Networkscited by 3,030
- 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,882
- 2020Improved Baselines with Momentum Contrastive Learningcited by 2,285
- 2019Invariant Risk Minimizationcited by 1,842
18 more
- 2018Group Normalizationcited by 1,518
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,371
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,242
- 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,196
- 2016Instance Normalization: The Missing Ingredient for Fast Stylizationcited by 1,193
- 2019A Comprehensive Survey on Transfer Learningcited by 1,157
- 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 941
- 2018Deep Visual Domain Adaptation: A Surveycited by 634
- 2013Domain Generalization via Invariant Feature Representationcited by 623
- 2021Designing an Encoder for StyleGAN Image Manipulationcited by 542
- 2015Causal inference using invariant prediction: identification and confidence intervalscited by 534
- 2021Towards Out-Of-Distribution Generalization: A Surveycited by 432
- 2015Return of Frustratingly Easy Domain Adaptationcited by 390
- 2020The Risks of Invariant Risk Minimizationcited by 262
- 2021ReStyle: A Residual-Based StyleGAN Encoder via Iterative Refinementcited by 248
- 2017Invariant Causal Prediction for Nonlinear Modelscited by 140
- 2020Active Invariant Causal Prediction: Experiment Selection through Stabilitycited by 37
- 2013Counterfactuals and Policy Analysis in Structural Modelscited by 13
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.
2 papers.