F-divergence

In probability theory, an $f$ -divergence is a certain type of function $D_{f} (P ‖ Q)$ that measures the difference between two probability distributions $P$ and $Q$ . Many common divergences, such as KL-divergence, Hellinger distance, and total variation distance, are special cases of $f$ -divergence.

History

These divergences were introduced by Alfréd Rényi in the same paper where he introduced the well-known Rényi entropy. He proved that these divergences decrease in Markov processes. f-divergences were studied further independently by Csiszár (1963), Morimoto (1963) and Ali & Silvey (1966) and are sometimes known as Csiszár $f$ -divergences, Csiszár–Morimoto divergences, or Ali–Silvey distances.

Definition

Non-singular case

Let $P$ and $Q$ be two probability distributions over a space $Ω$ , such that $P ≪ Q$ , that is, $P$ is absolutely continuous with respect to $Q$ (meaning $Q > 0$ wherever $P > 0$ ). Then, for a convex function $f : [0, + \infty) \to (- \infty, + \infty]$ such that $f (x)$ is finite for all $x > 0$ , $f (1) = 0$ , and $f (0) = lim_{t \to 0^{+}} f (t)$ (which could be infinite), the $f$ -divergence of $P$ from $Q$ is defined as

D_{f} (P ∥ Q) \equiv \int_{Ω} f (\frac{d P}{d Q}) d Q .

We call $f$ the generator of $D_{f}$ .

In concrete applications, there is usually a reference distribution $μ$ on $Ω$ (for example, when $Ω = ℝ^{n}$ , the reference distribution is the Lebesgue measure), such that $P, Q ≪ μ$ , then we can use Radon–Nikodym theorem to take their probability densities $p$ and $q$ , giving

D_{f} (P ∥ Q) = \int_{Ω} f (\frac{p (x)}{q (x)}) q (x) d μ (x) .

When there is no such reference distribution ready at hand, we can simply define $μ = P + Q$ , and proceed as above. This is a useful technique in more abstract proofs.

Extension to singular measures

The above definition can be extended to cases where $P ≪ Q$ is no longer satisfied (Definition 7.1 of ).

Since $f$ is convex, and $f (1) = 0$ , the function $\frac{f (x)}{x - 1}$ must be nondecreasing, so there exists $f^{'} (\infty) := lim_{x \to \infty} f (x) / x$ , taking value in $(- \infty, + \infty]$ .

Since for any $p (x) > 0$ , we have $lim_{q (x) \to 0} q (x) f (\frac{p (x)}{q (x)}) = p (x) f^{'} (\infty)$ , we can extend f-divergence to the $P ≪̸ Q$ .

Properties

Basic relations between f-divergences

Linearity: $D_{\sum_{i} a_{i} f_{i}} = \sum_{i} a_{i} D_{f_{i}}$ given a finite sequence of nonnegative real numbers $a_{i}$ and generators $f_{i}$ .

$D_{f} = D_{g}$ iff $f (x) = g (x) + c (x - 1)$ for some $c \in ℝ$ .

Proof

If $f (x) = g (x) + c (x - 1)$ , then $D_{f} = D_{g}$ by definition.

Conversely, if $D_{f} - D_{g} = 0$ , then let $h = f - g$ . For any two probability measures $P, Q$ on the set ${0, 1}$ , since $D_{f} (P ‖ Q) - D_{g} (P ‖ Q) = 0$ , we get $h (P_{1} / Q_{1}) = - \frac{Q_{0}}{Q_{1}} h (P_{0} / Q_{0})$

Since each probability measure $P, Q$ has one degree of freedom, we can solve $\frac{P_{0}}{Q_{0}} = a, \frac{P_{1}}{Q_{1}} = x$ for every choice of $0 < a < 1 < x$ .

Linear algebra yields $Q_{0} = \frac{x - 1}{x - a}, Q_{1} = \frac{1 - a}{x - a}$ , which is a valid probability measure. Then we obtain $h (x) = \frac{h (a)}{a - 1} (x - 1), h (a) = \frac{h (x)}{x - 1} (a - 1)$ .

Thus $h (x) = {\begin{matrix} c_{1} (x - 1) if x > 1, \\ c_{0} (x - 1) if 0 < x < 1, \end{matrix}$ for some constants $c_{0}, c_{1}$ . Plugging the formula into $h (x) = \frac{h (a)}{a - 1} (x - 1)$ yields $c_{0} = c_{1}$ .

Basic properties of f-divergences

Non-negativity: the ƒ-divergence is always positive; it is zero if the measures P and Q coincide. This follows immediately from Jensen’s inequality:
$D_{f} (P ∥ Q) = \int f (\frac{d P}{d Q}) d Q \geq f (\int \frac{d P}{d Q} d Q) = f (1) = 0.$
Data-processing inequality: if κ is an arbitrary transition probability that transforms measures P and Q into P_κ and Q_κ correspondingly, then
$D_{f} (P ∥ Q) \geq D_{f} (P_{κ} ∥ Q_{κ}) .$
The equality here holds if and only if the transition is induced from a sufficient statistic with respect to {P, Q}.
Joint convexity: for any 0 ≤ λ ≤ 1,
$D_{f} (λ P_{1} + (1 - λ) P_{2} ∥ λ Q_{1} + (1 - λ) Q_{2}) \leq λ D_{f} (P_{1} ∥ Q_{1}) + (1 - λ) D_{f} (P_{2} ∥ Q_{2}) .$
This follows from the convexity of the mapping $(p, q) \mapsto q f (p / q)$ on $ℝ_{+}^{2}$ .
Reversal by convex inversion: for any function $f$ , its convex inversion is defined as $g (t) := t f (1 / t)$ . When $f$ satisfies the defining features of a f-divergence generator ( $f (x)$ is finite for all $x > 0$ , $f (1) = 0$ , and $f (0) = lim_{t \to 0^{+}} f (t)$ ), then $g$ satisfies the same features, and thus defines a f-divergence $D_{g}$ . This is the "reverse" of $D_{f}$ , in the sense that $D_{g} (P ‖ Q) = D_{f} (Q ‖ P)$ for all $P, Q$ that are absolutely continuous with respect to each other. In this way, every f-divergence $D_{f}$ can be turned symmetric by $D_{\frac{1}{2} (f + g)}$ . For example, performing this symmetrization turns KL-divergence into Jeffreys divergence.

In particular, the monotonicity implies that if a Markov process has a positive equilibrium probability distribution $P^{*}$ then $D_{f} (P (t) ∥ P^{*})$ is a monotonic (non-increasing) function of time, where the probability distribution $P (t)$ is a solution of the Kolmogorov forward equations (or Master equation), used to describe the time evolution of the probability distribution in the Markov process. This means that all f-divergences $D_{f} (P (t) ∥ P^{*})$ are the Lyapunov functions of the Kolmogorov forward equations. The converse statement is also true: If $H (P)$ is a Lyapunov function for all Markov chains with positive equilibrium $P^{*}$ and is of the trace-form ( $H (P) = \sum_{i} f (P_{i}, P_{i}^{*})$ ) then $H (P) = D_{f} (P (t) ∥ P^{*})$ , for some convex function f. For example, Bregman divergences in general do not have such property and can increase in Markov processes.

Analytic properties

The f-divergences can be expressed using Taylor series and rewritten using a weighted sum of chi-type distances (Nielsen & Nock (2013)).

Basic variational representation

Let $f^{*}$ be the convex conjugate of $f$ . Let $e f f d o m (f^{*})$ be the effective domain of $f^{*}$ , that is, $e f f d o m (f^{*}) = {y : f^{*} (y) < \infty}$ . Then we have two variational representations of $D_{f}$ , which we describe below.

Under the above setup,

Theorem— $D_{f} (P; Q) = sup_{g : Ω \to e f f d o m (f^{*})} E_{P} [g] - E_{Q} [f^{*} \circ g]$ .

This is Theorem 7.24 in.

Example applications

Using this theorem on total variation distance, with generator $f (x) = \frac{1}{2} | x - 1 |,$ its convex conjugate is $f^{*} (x^{*}) = {\begin{matrix} x^{*} on [- 1 / 2, 1 / 2], \\ + \infty else. \end{matrix}$ , and we obtain $T V (P ‖ Q) = sup_{| g | \leq 1 / 2} E_{P} [g (X)] - E_{Q} [g (X)] .$ For chi-squared divergence, defined by $f (x) = (x - 1)^{2}, f^{*} (y) = y^{2} / 4 + y$ , we obtain $χ^{2} (P; Q) = sup_{g} E_{P} [g (X)] - E_{Q} [g (X)^{2} / 4 + g (X)] .$ Since the variation term is not affine-invariant in $g$ , even though the domain over which $g$ varies is affine-invariant, we can use up the affine-invariance to obtain a leaner expression.

Replacing $g$ by $a g + b$ and taking the maximum over $a, b \in ℝ$ , we obtain $χ^{2} (P; Q) = sup_{g} \frac{(E_{P} [g (X)] - E_{Q} [g (X)])^{2}}{V a r_{Q} [g (X)]},$ which is just a few steps away from the Hammersley–Chapman–Robbins bound and the Cramér–Rao bound (Theorem 29.1 and its corollary in ).

For $α$ -divergence with $α \in (- \infty, 0) \cup (0, 1)$ , we have $f_{α} (x) = \frac{x^{α} - α x - (1 - α)}{α (α - 1)}$ , with range $x \in [0, \infty)$ . Its convex conjugate is $f_{α}^{*} (y) = \frac{1}{α} (x (y)^{α} - 1)$ with range $y \in (- \infty, (1 - α)^{- 1})$ , where $x (y) = ((α - 1) y + 1)^{\frac{1}{α - 1}}$ .

Applying this theorem yields, after substitution with $h = ((α - 1) g + 1)^{\frac{1}{α - 1}}$ , $D_{α} (P ‖ Q) = \frac{1}{α (1 - α)} - inf_{h : Ω \to (0, \infty)} (E_{Q} [\frac{h^{α}}{α}] + E_{P} [\frac{h^{α - 1}}{1 - α}]),$ or, releasing the constraint on $h$ , $D_{α} (P ‖ Q) = \frac{1}{α (1 - α)} - inf_{h : Ω \to ℝ} (E_{Q} [\frac{| h |^{α}}{α}] + E_{P} [\frac{| h |^{α - 1}}{1 - α}]) .$ Setting $α = - 1$ yields the variational representation of $χ^{2}$ -divergence obtained above.

The domain over which $h$ varies is not affine-invariant in general, unlike the $χ^{2}$ -divergence case. The $χ^{2}$ -divergence is special, since in that case, we can remove the $| \cdot |$ from $| h |$ .

For general $α \in (- \infty, 0) \cup (0, 1)$ , the domain over which $h$ varies is merely scale invariant. Similar to above, we can replace $h$ by $a h$ , and take minimum over $a > 0$ to obtain $D_{α} (P ‖ Q) = sup_{h > 0} [\frac{1}{α (1 - α)} (1 - \frac{E_{P} [h^{α - 1}]^{α}}{E_{Q} [h^{α}]^{α - 1}})] .$ Setting $α = \frac{1}{2}$ , and performing another substitution by $g = \sqrt{h}$ , yields two variational representations of the squared Hellinger distance: $H^{2} (P ‖ Q) = \frac{1}{2} D_{1 / 2} (P ‖ Q) = 2 - inf_{h > 0} (E_{Q} [h (X)] + E_{P} [h (X)^{- 1}]),$ $H^{2} (P ‖ Q) = 2 sup_{h > 0} (1 - \sqrt{E_{P} [h^{- 1}] E_{Q} [h]}) .$ Applying this theorem to the KL-divergence, defined by $f (x) = x \ln x, f^{*} (y) = e^{y - 1}$ , yields $D_{K L} (P; Q) = sup_{g} E_{P} [g (X)] - e^{- 1} E_{Q} [e^{g (X)}] .$ This is strictly less efficient than the Donsker–Varadhan representation $D_{K L} (P; Q) = sup_{g} E_{P} [g (X)] - \ln E_{Q} [e^{g (X)}] .$ This defect is fixed by the next theorem.

Improved variational representation

Assume the setup in the beginning of this section ("Variational representations").

Theorem—If $f (x) = + \infty$ on $x < 0$ (redefine $f$ if necessary), then

$D_{f} (P ‖ Q) = f^{'} (\infty) P [S^{c}] + sup_{g} 𝔼_{P} [g 1_{S}] - Ψ_{Q, P}^{*} (g)$ ,

where $Ψ_{Q, P}^{*} (g) := inf_{a \in ℝ} 𝔼_{Q} [f^{*} (g (X) - a)] + a P [S]$ and $S := {q > 0}$ , where $q$ is the probability density function of $Q$ with respect to some underlying measure.

In the special case of $f^{'} (\infty) = + \infty$ , we have

$D_{f} (P ‖ Q) = sup_{g} 𝔼_{P} [g] - Ψ_{Q}^{*} (g), Ψ_{Q}^{*} (g) := inf_{a \in ℝ} 𝔼_{Q} [f^{*} (g (X) - a)] + a$ .

This is Theorem 7.25 in.

Example applications

Applying this theorem to KL-divergence yields the Donsker–Varadhan representation.

Attempting to apply this theorem to the general $α$ -divergence with $α \in (- \infty, 0) \cup (0, 1)$ does not yield a closed-form solution.

Common examples of f-divergences

The following table lists many of the common divergences between probability distributions and the possible generating functions to which they correspond. Notably, except for total variation distance, all others are special cases of $α$ -divergence, or linear sums of $α$ -divergences.

For each f-divergence $D_{f}$ , its generating function is not uniquely defined, but only up to $c \cdot (t - 1)$ , where $c$ is any real constant. That is, for any $f$ that generates an f-divergence, we have $D_{f (t)} = D_{f (t) + c \cdot (t - 1)}$ . This freedom is not only convenient, but actually necessary.

Divergence	Corresponding f(t)	Discrete Form
$χ^{α}$ -divergence, $α \geq 1$	$\frac{1}{2} \| t - 1 \|^{α}$	$\frac{1}{2} \sum_{i} {\| \frac{p_{i} - q_{i}}{q_{i}} \|}^{α} q_{i}$
Total variation distance ( $α = 1$ )	$\frac{1}{2} \| t - 1 \|$	$\frac{1}{2} \sum_{i} \| p_{i} - q_{i} \|$
α-divergence	${\begin{matrix} \frac{t^{α} - α t - (1 - α)}{α (α - 1)} & if α \neq 0, α \neq 1, \\ t \ln t - t + 1, & if α = 1, \\ - \ln t + t - 1, & if α = 0 \end{matrix}$
KL-divergence ( $α = 1$ )	$t \ln t$	$\sum_{i} p_{i} \ln \frac{p_{i}}{q_{i}}$
reverse KL-divergence ( $α = 0$ )	$- \ln t$	$\sum_{i} q_{i} \ln \frac{q_{i}}{p_{i}}$
Jensen–Shannon divergence	$\frac{1}{2} (t \ln t - (t + 1) \ln (\frac{t + 1}{2}))$	$\frac{1}{2} \sum_{i} (p_{i} \ln \frac{p_{i}}{(p_{i} + q_{i}) / 2} + q_{i} \ln \frac{q_{i}}{(p_{i} + q_{i}) / 2})$
Jeffreys divergence (KL + reverse KL)	$(t - 1) \ln (t)$	$\sum_{i} (p_{i} - q_{i}) \ln \frac{p_{i}}{q_{i}}$
squared Hellinger distance ( $α = \frac{1}{2}$ )	$\frac{1}{2} (\sqrt{t} - 1)^{2}, 1 - \sqrt{t}$	$\frac{1}{2} \sum_{i} (\sqrt{p_{i}} - \sqrt{q_{i}})^{2}; 1 - \sum_{i} \sqrt{p_{i} q_{i}}$
Neyman $χ^{2}$ -divergence	$(t - 1)^{2}$	$\sum_{i} \frac{(p_{i} - q_{i})^{2}}{q_{i}}$
Pearson $χ^{2}$ -divergence	$\frac{(t - 1)^{2}}{t}$	$\sum_{i} \frac{(p_{i} - q_{i})^{2}}{p_{i}}$

Let $f_{α}$ be the generator of $α$ -divergence, then $f_{α}$ and $f_{1 - α}$ are convex inversions of each other, so $D_{α} (P ‖ Q) = D_{1 - α} (Q ‖ P)$ . In particular, this shows that the squared Hellinger distance and Jensen-Shannon divergence are symmetric.

In the literature, the $α$ -divergences are sometimes parametrized as

${\begin{matrix} \frac{4}{1 - α^{2}} (1 - t^{(1 + α) / 2}), & if α \neq \pm 1, \\ t \ln t, & if α = 1, \\ - \ln t, & if α = - 1 \end{matrix}$

which is equivalent to the parametrization in this page by substituting $α \leftarrow \frac{α + 1}{2}$ .

Relations to other statistical divergences

Here, we compare f-divergences with other statistical divergences.

Rényi divergence

The Rényi divergences is a family of divergences defined by

$R_{α} (P ‖ Q) = \frac{1}{α - 1} \log (E_{Q} [{(\frac{d P}{d Q})}^{α}])$

when $α \in (0, 1) \cup (1, + \infty)$ . It is extended to the cases of $α = 0, 1, + \infty$ by taking the limit.

Simple algebra shows that $R_{α} (P ‖ Q) = \frac{1}{α - 1} \ln (1 + α (α - 1) D_{α} (P ‖ Q))$ , where $D_{α}$ is the $α$ -divergence defined above.

Bregman divergence

The only f-divergence that is also a Bregman divergence is the KL divergence.

Integral probability metrics

The only f-divergence that is also an integral probability metric is the total variation.

Financial interpretation

A pair of probability distributions can be viewed as a game of chance in which one of the distributions defines the official odds and the other contains the actual probabilities. Knowledge of the actual probabilities allows a player to profit from the game. For a large class of rational players the expected profit rate has the same general form as the ƒ-divergence.

References

↑ Rényi, Alfréd (1961). On measures of entropy and information (PDF). The 4th Berkeley Symposium on Mathematics, Statistics and Probability, 1960. Berkeley, CA: University of California Press. pp. 547–561. Eq. (4.20)
1 2 3 4 Polyanskiy, Yury; Yihong, Wu (2022). Information Theory: From Coding to Learning (draft of October 20, 2022) (PDF). Cambridge University Press. Archived from the original (PDF) on 2023-02-01.
↑ Gorban, Pavel A. (15 October 2003). "Monotonically equivalent entropies and solution of additivity equation". Physica A. 328 (3–4): 380–390. arXiv:cond-mat/0304131. Bibcode:2003PhyA..328..380G. doi:10.1016/S0378-4371(03)00578-8. S2CID 14975501.
↑ Amari, Shun'ichi (2009). Leung, C.S.; Lee, M.; Chan, J.H. (eds.). Divergence, Optimization, Geometry. The 16th International Conference on Neural Information Processing (ICONIP 20009), Bangkok, Thailand, 1--5 December 2009. Lecture Notes in Computer Science, vol 5863. Berlin, Heidelberg: Springer. pp. 185–193. doi:10.1007/978-3-642-10677-4_21.
↑ Gorban, Alexander N. (29 April 2014). "General H-theorem and Entropies that Violate the Second Law". Entropy. 16 (5): 2408–2432. arXiv:1212.6767. Bibcode:2014Entrp..16.2408G. doi:10.3390/e16052408.
↑ Jiao, Jiantao; Courtade, Thomas; No, Albert; Venkat, Kartik; Weissman, Tsachy (December 2014). "Information Measures: the Curious Case of the Binary Alphabet". IEEE Transactions on Information Theory. 60 (12): 7616–7626. arXiv:1404.6810. Bibcode:2014ITIT...60.7616J. doi:10.1109/TIT.2014.2360184. ISSN 0018-9448. S2CID 13108908.
↑ Sriperumbudur, Bharath K.; Fukumizu, Kenji; Gretton, Arthur; Schölkopf, Bernhard; Lanckriet, Gert R. G. (2009). "On integral probability metrics, φ-divergences and binary classification". arXiv:0901.2698 [cs.IT].
↑ Soklakov, Andrei N. (2020). "Economics of Disagreement—Financial Intuition for the Rényi Divergence". Entropy. 22 (8): 860. arXiv:1811.08308. Bibcode:2020Entrp..22..860S. doi:10.3390/e22080860. PMC 7517462. PMID 33286632.

Csiszár, I. (1963). "Eine informationstheoretische Ungleichung und ihre Anwendung auf den Beweis der Ergodizitat von Markoffschen Ketten". Magyar. Tud. Akad. Mat. Kutato Int. Kozl. 8: 85–108.
Morimoto, T. (1963). "Markov processes and the H-theorem". J. Phys. Soc. Jpn. 18 (3): 328–331. Bibcode:1963JPSJ...18..328M. doi:10.1143/JPSJ.18.328.
Ali, S. M.; Silvey, S. D. (1966). "A general class of coefficients of divergence of one distribution from another". Journal of the Royal Statistical Society, Series B. 28 (1): 131–142. doi:10.1111/j.2517-6161.1966.tb00626.x. JSTOR 2984279. MR 0196777.
Csiszár, I. (1967). "Information-type measures of difference of probability distributions and indirect observation". Studia Scientiarum Mathematicarum Hungarica. 2: 229–318.
Csiszár, I.; Shields, P. (2004). "Information Theory and Statistics: A Tutorial" (PDF). Foundations and Trends in Communications and Information Theory. 1 (4): 417–528. doi:10.1561/0100000004. Retrieved 2009-04-08.
Liese, F.; Vajda, I. (2006). "On divergences and informations in statistics and information theory". IEEE Transactions on Information Theory. 52 (10): 4394–4412. Bibcode:2006ITIT...52.4394L. doi:10.1109/TIT.2006.881731. S2CID 2720215.
Nielsen, F.; Nock, R. (2013). "On the Chi square and higher-order Chi distances for approximating f-divergences". IEEE Signal Processing Letters. 21 (1): 10–13. arXiv:1309.3029. Bibcode:2014ISPL...21...10N. doi:10.1109/LSP.2013.2288355. S2CID 4152365.
Coeurjolly, J-F.; Drouilhet, R. (2006). "Normalized information-based divergences". arXiv:math/0604246.

[1] Rényi, Alfréd (1961). On measures of entropy and information (PDF). The 4th Berkeley Symposium on Mathematics, Statistics and Probability, 1960. Berkeley, CA: University of California Press. pp. 547–561. Eq. (4.20)

[:1-2] 1 2 3 4 Polyanskiy, Yury; Yihong, Wu (2022). Information Theory: From Coding to Learning (draft of October 20, 2022) (PDF). Cambridge University Press. Archived from the original (PDF) on 2023-02-01.

[3] Gorban, Pavel A. (15 October 2003). "Monotonically equivalent entropies and solution of additivity equation". Physica A. 328 (3–4): 380–390. arXiv:cond-mat/0304131. Bibcode:2003PhyA..328..380G. doi:10.1016/S0378-4371(03)00578-8. S2CID 14975501.

[4] Amari, Shun'ichi (2009). Leung, C.S.; Lee, M.; Chan, J.H. (eds.). Divergence, Optimization, Geometry. The 16th International Conference on Neural Information Processing (ICONIP 20009), Bangkok, Thailand, 1--5 December 2009. Lecture Notes in Computer Science, vol 5863. Berlin, Heidelberg: Springer. pp. 185–193. doi:10.1007/978-3-642-10677-4_21.

[5] Gorban, Alexander N. (29 April 2014). "General H-theorem and Entropies that Violate the Second Law". Entropy. 16 (5): 2408–2432. arXiv:1212.6767. Bibcode:2014Entrp..16.2408G. doi:10.3390/e16052408.

[:02-6] Jiao, Jiantao; Courtade, Thomas; No, Albert; Venkat, Kartik; Weissman, Tsachy (December 2014). "Information Measures: the Curious Case of the Binary Alphabet". IEEE Transactions on Information Theory. 60 (12): 7616–7626. arXiv:1404.6810. Bibcode:2014ITIT...60.7616J. doi:10.1109/TIT.2014.2360184. ISSN 0018-9448. S2CID 13108908.

[on-ipms-7] Sriperumbudur, Bharath K.; Fukumizu, Kenji; Gretton, Arthur; Schölkopf, Bernhard; Lanckriet, Gert R. G. (2009). "On integral probability metrics, φ-divergences and binary classification". arXiv:0901.2698 [cs.IT].

[8] Soklakov, Andrei N. (2020). "Economics of Disagreement—Financial Intuition for the Rényi Divergence". Entropy. 22 (8): 860. arXiv:1811.08308. Bibcode:2020Entrp..22..860S. doi:10.3390/e22080860. PMC 7517462. PMID 33286632.

F-divergence

History

Definition

Non-singular case

Extension to singular measures

Properties

Basic relations between f-divergences

Basic properties of f-divergences

Analytic properties

Basic variational representation

Example applications

Improved variational representation

Example applications

Common examples of f-divergences

Relations to other statistical divergences

Rényi divergence

Bregman divergence

Integral probability metrics

Financial interpretation

See also

References