Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Given two probability measures P and Q and an event E, we provide bounds on P(E) in terms of Q(E) and f-divergences. In particular, the bounds are instantiated when the measures considered are a joint distribution and the corresponding product of marginals. This allows us to control the measure of an event under the joint, using the product of the marginals (typically easier to compute) and a measure of how much the two distributions differ, i.e., an f-divergence between the joint and the product of the marginals, also known in the literature as f-Mutual Information. The result is general enough to induce, as special cases, bounds involving χ 2 -divergence, Hellinger distance, Total Variation, etc. Moreover, it also recovers a result involving Rényi's α-divergence. As an application, we provide bounds on the generalization error of learning algorithms via f-divergences.