Robust Generalization via α-Mutual Information

01/14/2020
by   Amedeo Roberto Esposito, et al.
0

The aim of this work is to provide bounds connecting two probability measures of the same event using Rényi α-Divergences and Sibson's α-Mutual Information, a generalization of respectively the Kullback-Leibler Divergence and Shannon's Mutual Information. A particular case of interest can be found when the two probability measures considered are a joint distribution and the corresponding product of marginals (representing the statistically independent scenario). In this case, a bound using Sibson's α-Mutual Information is retrieved, extending a result involving Maximal Leakage to general alphabets. These results have broad applications, from bounding the generalization error of learning algorithms to the more general framework of adaptive data analysis, provided that the divergences and/or information measures used are amenable to such an analysis ( i.e., are robust to post-processing and compose adaptively). The generalization error bounds are derived with respect to high-probability events but a corresponding bound on expected generalization error is also retrieved.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2019

Generalization Error Bounds Via Rényi-, f-Divergences and Maximal Leakage

In this work, the probability of an event under some joint distribution ...
research
02/08/2022

From Generalisation Error to Transportation-cost Inequalities and Back

In this work, we connect the problem of bounding the expected generalisa...
research
03/09/2019

Strengthened Information-theoretic Bounds on the Generalization Error

The following problem is considered: given a joint distribution P_XY and...
research
06/11/2018

Chaining Mutual Information and Tightening Generalization Bounds

Bounding the generalization error of learning algorithms has a long hist...
research
10/28/2019

Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond

Computing approximate nearest neighbors in high dimensional spaces is a ...
research
08/04/2018

Implementation and Analysis of Stable PUFs Using Gate Oxide Breakdown

We implement and analyze highly stable PUFs using two random gate oxide ...
research
03/09/2023

How to Compress the Solution

Using derandomization, we provide an upper bound on the compression size...

Please sign up or login with your details

Forgot password? Click here to reset