REVIEW 2 cited by
Causal Balancing for Domain Generalization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
While machine learning models rapidly advance the state-of-the-art on various real-world tasks, out-of-domain (OOD) generalization remains a challenging problem given the vulnerability of these models to spurious correlations. We propose a balanced mini-batch sampling strategy to transform a biased data distribution into a spurious-free balanced distribution, based on the invariance of the underlying causal mechanisms for the data generation process. We argue that the Bayes optimal classifiers trained on such balanced distribution are minimax optimal across a diverse enough environment space. We also provide an identifiability guarantee of the latent variable model of the proposed data generation process, when utilizing enough train environments. Experiments are conducted on DomainBed, demonstrating empirically that our method obtains the best performance across 20 baselines reported on the benchmark.
Forward citations
Cited by 2 Pith papers
-
Subgroups Matter for Robust Bias Mitigation
Subgroup choice determines whether bias mitigation helps or hurts, and the minimum KL divergence to the unbiased test distribution predicts success.
-
On the Out-of-Distribution Generalization of Self-Supervised Learning
Self-supervised learning can be made more robust to distribution shift by sampling mini-batches so that spurious background variables are independent of the anchor label, using a VAE and balancing-score matching.
Discussion (0). Continue with ORCID to comment.