Amari distance

The Amari distance,^[1][2] also known as Amari index^[3] and Amari metric^[4] is a similarity measure between two invertible matrices, useful for checking for convergence in independent component analysis algorithms and for comparing solutions. It is named after Japanese information theorist Shun'ichi Amari and was originally introduced as a performance index for blind source separation.^[5]

For two invertible matrices ${\displaystyle A,B\in \mathbb {R} ^{n\times n}}$, it is defined as:

${\displaystyle d(A,B)=\sum _{i=1}^{n}\left(\sum _{j=1}^{n}{\frac {|p_{ij}|}{\max _{k}|p_{ik}|}}-1\right)+\sum _{j=1}^{n}\left(\sum _{i=1}^{n}{\frac {|p_{ij}|}{\max _{k}|p_{kj}|}}-1\right),P=A^{-1}B}$

It is non-negative and cancels if and only if ${\displaystyle A^{-1}B}$ is a scale and permutation matrix, i.e. the product of a diagonal matrix and a permutation matrix. The Amari distance is invariant to permutation and scaling of the columns of ${\displaystyle A}$ and ${\displaystyle B}$.^[6]