“…A list of some notable existing f -divergence inequalities is provided, e.g., in [ 22 ] Section 1 and [ 23 ] Section 3. State-of-the-art techniques which serve to derive bounds among f -divergences include: - Moment inequalities which rely on log-convexity arguments ([ 22 ] Section 5.D, [ 24 , 25 , 26 , 27 , 28 ]);
- Inequalities which rely on a characterization of the exact locus of the joint range of f -divergences [ 29 ];
- f -divergence inequalities via functional domination ([ 22 ] Section 3, [ 30 , 31 , 32 ]);
- Sharp f -divergence inequalities by using numerical tools for maximizing or minimizing an f -divergence subject to a finite number of constraints on other f -divergences [ 33 ];
- Inequalities which rely on powers of f -divergences defining a distance [ 34 , 35 , 36 , 37 ];
- Vajda and Pinsker-type inequalities for f -divergences ([ 4 , 10 , 13 , 22 ] Sections 6–7, [ 38 , 39 ]);
- Bounds among f -divergences when the relative information is bounded ([ 22 ] Sections 4–5, [ 40 , 41 , 42 , 43 , 44 , 45 , 46 , 47 ]), and reverse Pinsker inequalities ([ 22 ] Section 6, [ 40 , 48 ]);
- Inequalities which rely on the minimum of an ...
…”