Statistical Learning under Heterogeneous Distribution Shift
Max Simchowitz, Anurag Ajay, Pulkit Agrawal, Akshay Krishnamurthy

TL;DR
This paper investigates the robustness of empirical risk minimization in predicting additive functions under heterogeneous covariate shifts, revealing that simpler function classes yield more resilient predictors.
Contribution
It introduces a theoretical framework showing ERM's resilience depends on the relative complexity of function classes under distribution shifts, supported by a novel inequality and empirical validation.
Findings
ERM performance is more stable when the predictor class is simpler.
The complexity of the class $F$ influences robustness to covariate shifts.
Experimental results confirm theoretical predictions across multiple domains.
Abstract
This paper studies the prediction of a target from a pair of random variables , where the ground-truth predictor is additive . We study the performance of empirical risk minimization (ERM) over functions , and , fit on a given training distribution, but evaluated on a test distribution which exhibits covariate shift. We show that, when the class is "simpler" than (measured, e.g., in terms of its metric entropy), our predictor is more resilient to heterogeneous covariate shifts} in which the shift in is much greater than that in . Our analysis proceeds by demonstrating that ERM behaves qualitatively similarly to orthogonal machine learning: the rate at which ERM recovers the -component of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Domain Adaptation and Few-Shot Learning · Statistical Methods and Inference
MethodsTest
