Anytime and Difficulty-Adaptive PAC-Bayes for Constrained Density-Ratio Network with Continual Learning Guarantees
Paulo Akira F. Enabe

TL;DR
This paper introduces a unified framework using a constrained density-ratio network with PAC-Bayes guarantees for learning under covariate shift, supporting importance weighting and providing anytime generalization certificates.
Contribution
It develops a novel density-ratio network with integral constraints and instantiates PAC-Bayes bounds in fixed-time and anytime regimes for covariate shift adaptation.
Findings
Reduces target 0/1 loss compared to baseline methods.
Produces a calibrated covariate ratio on real data.
Attains an anytime generalization certificate with empirical validation.
Abstract
A unified framework for learning under covariate shift is presented, in which a constrained density-ratio network approximates the Radon-Nikodym derivative from source to target , supports an importance-weighted empirical risk, 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, controlled by the closeness of the learned ratio to , and a generalization-gap term, controlled by the variability of the weighted loss. Three structural identities of a Radon-Nikodym derivative, normalization, moment matching, and a second-moment penalty controlling the effective sample size, are imposed as hard integral constraints through an augmented-Lagrangian scheme. PAC-Bayes is then instantiated on the weighted risk in a…
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.
