{"title": "Optimal Bounds between f-Divergences and Integral Probability Metrics", "book": "Proceedings of the International Conference on Machine Learning", "page_first": 11314, "page_last": 11323, "abstract": "The families of f-divergences (e.g. the Kullback-Leibler divergence) and Integral Probability Metrics (e.g. total variation distance or maximum mean discrepancies) are commonly used in optimization and estimation. In this work, we systematically study the relationship between these two families from the perspective of convex duality. Starting from a tight variational representation of the f-divergence, we derive a generalization of the moment generating function, which we show exactly characterizes the best lower bound of the f-divergence as a function of a given IPM. Using this characterization, we obtain new bounds on IPMs defined by classes of unbounded functions, while also recovering in a unified manner well-known results for bounded and subgaussian functions (e.g. Pinsker's inequality and Hoeffding's lemma).", "full_text": null, "award": [], "sourceid": 6534, "authors": [{"given_name": "Rohit", "family_name": "Agrawal", "institution": "Harvard University"}, {"given_name": "Thibaut", "family_name": "Horel", "institution": "MIT"}]}