Skip to content

Learning under Target Shift: Optimal Density Ratio Estimation and Importance-Weighted Regression

Sep 2026 · 0 citations · 45 references
Mathematics Computer Science

TL;DR

A finite-sample theory for continuous density ratio estimation and importance-weighted learning under target shift is established and the resulting regression estimator attains the minimax-optimal rates of standard kernel regression.

Abstract

We study density ratio estimation and importance-weighted regression under target shift with continuous outputs. Under target shift, the conditional distribution of the inputs given the outputs remains invariant across the training and test distributions, while the output marginal distribution may change. Although this problem has been extensively studied for discrete outputs, the continuous setting is substantially less understood: the importance weights are determined by an unknown density ratio function, for which existing estimation methods lack explicit finite-sample convergence rates. We propose a spectral regularization method in a reproducing kernel Hilbert space (RKHS) for estimating the continuous density ratio from labeled training samples and unlabeled test inputs. Under a source condition with regularity parameter $\iota>0$, we establish high-probability finite-sample guarantees and show that the estimator achieves the capacity-independent minimax-optimal RKHS-norm rate $O(n_\eta^{-\iota/(2\iota+2)})$. We then incorporate the estimated density ratio into importance-weighted regression and characterize the propagation of density-ratio estimation error to the final predictor. When sufficiently many samples are available for density ratio estimation, the resulting regression estimator attains the minimax-optimal rates of standard kernel regression. These results establish a finite-sample theory for continuous density ratio estimation and importance-weighted learning under target shift.

View source

Similar papers

Preprint Oct 2026

Semi-Supervised Kernel Ridge Fr\'echet Regression

Fr\'echet regression provides a framework for predicting random object-valued responses by minimizing the conditional expected squared distances. We propose semi-supervised kernel ridge Fr\'echet regression (SS-KRFR) to exploit unlabeled covariates when labeled samples are scarce. The method learns kernel spectral feat...

Jae Won Seo, Kwangho Kim, Jisu Kim · 0 citations
#machine learning Preprint Sep 2026

Robustness of Diffusion Models under Distribution Shift

Score-based diffusion models are increasingly considered in settings where the underlying data distribution may differ from the training distribution, yet existing theoretical guarantees largely focus on the no-shift setting. In this work, we study robust score estimation under Wasserstein perturbations of a reference...

Wei Luo, N. K. Chada, Shi-Jie Zhang et al. · 0 citations
#machine learning Preprint Oct 2026

Adaptive Mean Estimation by In-Context Learning: A Gradient-Flow Analysis

Prior Fitted Networks (PFNs) such as TabPFN now rival established statistical procedures across prediction and estimation tasks. A natural explanation is that PFNs have the property of statistical adaptivity, that is, they perform nearly as well as a method tailored to the true data-generating model for a heterogeneous...

Martin Eppert, K. Balasubramanian, Subhro Ghosh et al. · 0 citations
#machine learning Preprint Sep 2026

Weighted Empirical Risk Minimization for Machine Learning under Long-Range Dependence: Exact Pathwise Rates and Learning-Error Geometry

We develop an exact almost-sure learning theory for smooth parametric models trained by regularly weighted empirical risk minimization on long-range dependent data. The training observations are generated from a fixed finite window of a stationary Gaussian sequence, and the sample weights are regularly varying. If the...

E. Moldavskaya · 1 citation
#machine learning Preprint Sep 2026

Generalized Deep Regression for Repeated Measurements

This paper studies the estimation of a marginal regression function from independent units with repeated binary, count, or continuous responses using ReLU deep neural networks, and derives an oracle inequality for unequal cluster sizes and a rate for compositionally smooth functions.

Ke-Xuan Li · 0 citations

Related blog posts

GPT-Lab Sep 3, 2026

Adaptive AI Agents in Construction Workflows

Adaptive AI agents can help make BIM data more machine-readable by navigating IFC models, interpreting inconsistent information, and mapping it to defined standards. In this blog, Alok Rawat shares findings from a real-world pilot in construction workflows. The post Adaptive AI Agents in Construction Workflows appeared first on GPT-Lab.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.