I want to prove (or find a counterexample for) the following variant of Jensen's inequality.
Let $f$ and $g$ be convex functions (then $f(g(x))$ and $g(f(x))$ are convex functions). From the standard Jensen's inequality, we have
$$ \mathbb{E_{\sim i}}[f(g(x_i))] \geq f(g(\mathbb{E_{\sim i}}[x_i])) $$ or alternatively $$ \mathbb{E_{\sim i}}[f(g(x_i))] \geq f(\mathbb{E_{\sim i}}[g(x_i)]) $$
where in the second case we are only "extracting" the first function, but we can take the first as well since the composition of $f,g$ is convex.
I would like to know what necessary assumptions on $f,g$ are required such that the following holds:
$$ \mathbb{E_{\sim i}}[f(g(x_i))] \geq g(\mathbb{E_{\sim i}}[f(x_i)]) $$ A sufficient condition, of course is that $f\circ g \geq g \circ f$: $$ \mathbb{E_{\sim i}}[f(g(x_i))] \geq \mathbb{E_{\sim i}}[g(f(x_i))] \geq g(\mathbb{E_{\sim i}}[f(x_i)]) $$
but this is not very interesting and I was hoping for something more general.
Edit: Some additional constraints of interest to consider: $f$ is monotonic, $g$ is sublinear.