Search results
Results from the WOW.Com Content Network
The information geometry definition of divergence (the subject of this article) was initially referred to by alternative terms, including "quasi-distance" Amari (1982, p. 369) and "contrast function" Eguchi (1985), though "divergence" was used in Amari (1985) for the α-divergence, and has become standard for the general class.
The divergence theorem can be used to calculate a flux through a closed surface that fully encloses a volume, like any of the surfaces on the left. It can not directly be used to calculate the flux through surfaces with boundaries, like those on the right.
The only divergence on that is both a Bregman divergence and an f-divergence is the Kullback–Leibler divergence. [ 6 ] If n ≥ 3 {\displaystyle n\geq 3} , then any Bregman divergence on Γ n {\displaystyle \Gamma _{n}} that satisfies the data processing inequality must be the Kullback–Leibler divergence.
This article uses the standard notation ISO 80000-2, which supersedes ISO 31-11, for spherical coordinates (other sources may reverse the definitions of θ and φ): . The polar angle is denoted by [,]: it is the angle between the z-axis and the radial vector connecting the origin to the point in question.
The distance (or perpendicular distance) from a point to a line is the shortest distance from a fixed point to any point on a fixed infinite line in Euclidean geometry. It is the length of the line segment which joins the point to the line and is perpendicular to the line. The formula for calculating it can be derived and expressed in several ways.
The divergence of a vector field is often illustrated using the simple example of the velocity field of a fluid, a liquid or gas. A moving gas has a velocity, a speed and direction at each point, which can be represented by a vector, so the velocity of the gas forms a vector field. If a gas is heated, it will expand.
In information geometry, the Fisher information metric [1] is a particular Riemannian metric which can be defined on a smooth statistical manifold, i.e., a smooth manifold whose points are probability distributions. It can be used to calculate the distance between probability distributions. [2] The metric is interesting in several aspects.
The total variation distance (or half the norm) arises as the optimal transportation cost, when the cost function is (,) =, that is, ‖ ‖ = (,) = {(): =, =} = [], where the expectation is taken with respect to the probability measure on the space where (,) lives, and the infimum is taken over all such with marginals and , respectively.