English

Anytime PAC-Bayes for Constrained Density-Ratio Networks under Covariate Shift

Machine Learning 2026-05-25 v2

Abstract

A unified framework for learning under covariate shift is presented, in which a constrained density-ratio network approximates the Radon-Nikodym derivative r=dP/dQr^\star = dP/dQ and feeds an anytime PAC-Bayes generalization certificate. A change-of-measure identity decomposes the gap between target risk and importance-weighted source risk into a ratio-bias term governed by rθrL2(Q)\|r_\theta - r^\star\|_{L^2(Q)} and a generalization-gap term governed by the variability of the weighted loss. Normalization and moment-matching identities are enforced as hard integral constraints through an augmented-Lagrangian scheme, with a second-moment penalty controlling the effective sample size. PAC-Bayes is instantiated on the weighted risk in a fixed-time regime that yields Bernoulli-KL bounds, identifies the network-weighted Gibbs posterior as the unique KL-regularized minimizer, and quantifies stability under L2(Q)L^2(Q) perturbations of the learned ratio, and is then strengthened by geometric peeling to an anytime certificate uniform in ttmint \geq t_{\min}. A pre-registered two-campaign protocol combining a patch test against analytic ground truth with a real-data deployment validates the framework: the network produces calibrated ratios, reduces target 0/10/1 loss against unweighted ERM and classical direct ratio-estimation baselines, and attains the anytime certificate. A single fixed-time coverage failure is recorded, with per-split coverage aligning one-to-one with the magnitude of the label shift, confirming that the covariate-only assumption is operationally tight rather than a defect of the certificate.

Keywords

Cite

@article{arxiv.2605.17212,
  title  = {Anytime PAC-Bayes for Constrained Density-Ratio Networks under Covariate Shift},
  author = {Paulo Akira F. Enabe},
  journal= {arXiv preprint arXiv:2605.17212},
  year   = {2026}
}