Integral Probability Metrics PAC-Bayes Bounds

Ron Amit · Baruch Epstein · Shay Moran · Ron Meir

Hall J (level 1) #312

Keywords: [ PAC-Bayes ] [ Generalization Bound ] [ Learning Theory ]


We present a PAC-Bayes-style generalization bound which enables the replacement of the KL-divergence with a variety of Integral Probability Metrics (IPM). We provide instances of this bound with the IPM being the total variation metric and the Wasserstein distance. A notable feature of the obtained bounds is that they naturally interpolate between classical uniform convergence bounds in the worst case (when the prior and posterior are far away from each other), and improved bounds in favorable cases (when the posterior and prior are close). This illustrates the possibility of reinforcing classical generalization bounds with algorithm- and data-dependent components, thus making them more suitable to analyze algorithms that use a large hypothesis space.

Chat is not available.