Optimal Transport PAC-Bayes Bounds

PAC-Bayesian generalization bounds are among the strongest distribution-dependent guarantees in statistical learning and are typically expressed in terms of the Kullback-Leibler (KL) divergence between a prior and posterior distribution. While analytically convenient, the KL divergence requires the posterior to be absolutely continuous w.r.t. the prior, imposing support constraints that can substantially restrict the choice of posterior. Moreover, the KL divergence does not account for the underlying geometry of the probability space. In this work, we derive new PAC-Bayesian bounds replacing the KL divergence with general optimal transport (OT) distances, including the total variation and Wasserstein-p distances.

@techreport{BFO26,
  title        = {Optimal Transport PAC-Bayes Bounds},
  author       = {A. Beck and J. Fadili and P. Ochs},
  year         = {2026},
  journal      = {ArXiv e-prints, arXiv:2610.16560}
}