Learning bounds for doubly-robust covariate shift adaptation
Jeonghwan Lee, Cong Ma

TL;DR
This paper provides the first non-asymptotic learning bounds for doubly-robust covariate shift adaptation, connecting asymptotic properties with finite-sample guarantees under distributional shifts.
Contribution
It establishes structure-agnostic high-probability bounds and analyzes the method under well-specified models using modern non-asymptotic MLE techniques.
Findings
High-probability bounds depend only on pilot estimate errors and model complexity.
Analysis under well-specified models involves Fisher information mismatch.
Bridges asymptotic efficiency with finite-sample out-of-distribution guarantees.
Abstract
Distribution shift between the training domain and the test domain poses a key challenge for modern machine learning. An extensively studied instance is the \emph{covariate shift}, where the marginal distribution of covariates differs across domains, while the conditional distribution of outcome remains the same. The doubly-robust (DR) estimator, recently introduced by \cite{kato2023double}, combines the density ratio estimation with a pilot regression model and demonstrates asymptotic normality and -consistency, even when the pilot estimates converge slowly. However, the prior arts has focused exclusively on deriving asymptotic results and has left open the question of non-asymptotic guarantees for the DR estimator. This paper establishes the first non-asymptotic learning bounds for the DR covariate shift adaptation. Our main contributions are two-fold: (\romannumeral 1) We…
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
TopicsDomain Adaptation and Few-Shot Learning · Statistical Methods and Inference · Stochastic Gradient Optimization Techniques
