Saturable Generalizations of Jensen's Inequality

02/24/2021

∙

by   André M. Timpanaro, et al.

∙

0

∙

share

Jensen's inequality can be thought as answering the question of how knowledge of 𝔼(X) allows us to bound 𝔼(f(X)) in the cases where f is either convex or concave. Many generalizations have been proposed, which boil down to how additional knowledge allows us to sharpen the inequality. In this work, we investigate the question of how knowledge about expectations 𝔼(f_i(X)) of a random vector X translate into bounds for 𝔼(g(X)). Our results show that there is a connection between this problem and properties of convex hulls, allowing us to rewrite it as an optimization problem. The results of these optimization problems not only arrive at sharp bounds for 𝔼(g(X)) but in some cases also yield discrete probability measures where equality holds. We develop both analytical and numerical approaches for finding these bounds and also study in more depth the case where the known information are the average and variance, for which some analytical results can be obtained.