paper-with-me

홈 › Papers

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

2026-05-17 · Paulo Akira F. Enabe, Rodrigo Provasi arxiv

A unified framework for learning under covariate shift is presented, in which a constrained density-ratio network approximates the Radon-Nikodym derivative $r^\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_θ- 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 $L^2(Q)$ perturbations of the learned ratio, and is then strengthened by geometric peeling to an anytime certificate uniform in $t \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/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.

📄 PDF Abstract BibTeX arXiv:2605.17212

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Anytime-Constrained Equilibria in Polynomial Time

2024-10-31 · Jeremy McMahan

We extend anytime constraints to the Markov game setting and the corresponding solution concept of an anytime-constrained equilibrium (ACE). Then, we present a comprehensive theory of anytime-constrained equilibria that …

Multi-agent Reinforcement Learningreinforcement-learningReinforcement Learning

Anytime-Constrained Reinforcement Learning

2023-11-09 · Jeremy McMahan, Xiaojin Zhu

We introduce and study constrained Markov Decision Processes (cMDPs) with anytime constraints. An anytime constraint requires the agent to never violate its budget at any point in time, almost surely. Although Markovian …

reinforcement-learningReinforcement Learning

Pareto-Optimal Anytime Algorithms via Bayesian Racing

2026-03-09 · Jonathan Wurth, Helena Stegherr, Neele Kemper, Michael Heider 외 arxiv

Selecting an optimization algorithm requires comparing candidates across problem instances, but the computational budget for deployment is often unknown at benchmarking time. Current methods either collapse anytime perfo…

Bayesian Inference

Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks

2013-09-26 · Brandon Malone, Changhe Yuan

Exact algorithms for learning Bayesian networks guarantee to find provably optimal networks. However, they may fail in difficult learning tasks due to limited time or memory. In this research we adapt several anytime heu…

Heuristic Search

Anytime-Competitive Reinforcement Learning with Policy Prior

2023-11-02 · NeurIPS 2023 11

This paper studies the problem of Anytime-Competitive Markov Decision Process (A-CMDP). Existing works on Constrained Markov Decision Processes (CMDPs) aim to optimize the expected reward while constraining the expected …

reinforcement-learningReinforcement Learning