RAS Algorithm

The iterative proportional fitting procedure (IPF or IPFP, also known as biproportional fitting or biproportion in statistics or economics (input-output analysis, etc.), RAS algorithm in economics, raking in survey statistics, and matrix scaling in computer science) is the operation of finding the fitted matrix $X$ which is the closest to an initial matrix $Z$ but with the row and column totals of a target matrix $Y$ (which provides the constraints of the problem; the interior of $Y$ is unknown). The fitted matrix being of the form $X=PZQ$, where $P$ and $Q$ are diagonal matrices such that $X$ has the margins (row and column sums) of $Y$. Some algorithms can be chosen to perform biproportion. We have also the entropy maximization, information loss minimization (or cross-entropy) or RAS which consists of factoring the matrix rows to match the specified row totals, then factoring its columns to match the specified column totals; each step usually disturbs the previous step’s match, so these steps are repeated in cycles, re-adjusting the rows and columns in turn, until all specified marginal totals are satisfactorily approximated. However, all algorithms give the same solution.
In three- or more-dimensional cases, adjustment steps are applied for the marginals of each dimension in turn, the steps likewise repeated in cycles.

History

IPF has been "re-invented" many times, the earliest by Kruithof in 1937

in relation to telephone traffic ("Kruithof’s double factor method"), Deming and Stephan in 1940 for adjusting census crosstabulations, and G.V. Sheleikhovskii for traffic as reported by Bregman. (Deming and Stephan proposed IPFP as an algorithm leading to a minimizer of the Pearson X-squared statistic, which Stephan later reported it ''does not'',.
Early proofs of uniqueness and convergence came from Sinkhorn (1964), Bacharach (1965), Bishop (1967), and Fienberg (1970). Bishop's proof that IPFP finds the maximum likelihood estimator for any number of dimensions extended a 1959 proof by Brown for 2x2x2... cases. Fienberg's proof by differential geometry exploits the method's constant crossproduct ratios, for strictly positive tables. Csiszár (1975). found necessary and sufficient conditions for general tables having zero entries. Pukelsheim and Simeone (2009)
give further results on convergence and error behavior.

An exhaustive treatment of the algorithm and its mathematical foundations can be found in the book of Bishop et al. (1975). Idel (2016) gives a more recent survey.

Other general algorithms can be modified to yield the same limit as the IPFP, for instance the Newton–Raphson method and
the EM algorithm. In most cases, IPFP is preferred due to its computational speed, low storage requirements, numerical stability and algebraic simplicity.

Applications of IPFP have grown to include trip distribution models, Fratar or Furness and other applications in transportation planning (Lamond and Stewart), survey weighting, synthesis of cross-classified demographic data, adjusting input–output models in economics, estimating expected quasi-independent contingency tables, biproportional apportionment systems of political representation, and for a preconditioner in linear algebra.

Biproportion

Biproportion, whatever the algorithm used to solve it, is the following concept: $Z$, matrix $Y$ and matrix $X$ are known real nonnegative matrices of dimension $n,m$; the interior of $Y$ is unknown and $X$ is searched such that $X$ has the same margins than $Y$, i.e. $Xs=Ys$ and $s'X=s'Y$ ($s$ being the sum vector, and such that $X$ is closed to $Z$ following a given criterion, the fitted matrix being of the form $X=K(Z,Y)=PZQ$, where $P$ and $Q$ are diagonal matrices.

$min \sum_i\sum_j x_\log(x_/z_)$ s.t.$\sum_j x_=y_$, ∀$i$ and $\sum_i x_=y_$, ∀$j$.
The Lagrangian is $L=\sum_i\sum_j x_\log(x_/z_)-\sum_i p_i(y_-\sum_j x_)-\sum_jq_j(y_-\sum_i x_)$.

Thus $x_=z_ \exp-(1+p_i+q_j)$, for ∀$i,j$,

which, after posing $P_i=\exp-(1+p_i)$ and $Q_j=\exp-q_j$, yields

$x_=P_i z_ Q_j$, ∀$i,j$, i.e., $X=PZQ$,

with $P_i=z_i.(\sum_j z_Q_j)^$, ∀$i$ and $Q_j=z_(\sum_i z_P_i)^$, ∀$j$. $P_i$ and $Q_j$ form a system that can be solve iteratively:

$P_i=z_i.^(\sum_j z_Q_j^)^$, ∀$i$ and $Q_j^=z_(\sum_i z_P_i^)^$, ∀$j$.

The solution $X$ is independent of the initialization chosen (i.e., we can begin by $q_j^=1$, ∀$j$ or by$p_i^=1$, ∀$i$. If the matrix $Z$ is “indecomposable”, then this process has a unique fixed-point because it is deduced from program a program where the function is a convex and continuously derivable function defined on a compact set. In some cases the solution may not exist: see de Mesnard's example cited by Miller and Blair (Miller R.E. & Blair P.D. (2009) Input-output analysis: Foundations and Extensions, Second edition, Cambridge (UK): Cambridge University Press, p. 335-336 (freely available)).

Some properties (see de Mesnard (1994)):

Lack of information: if $Z$ brings no information, i.e., $z_ij=z$, ∀$i,j$ then $X=PQ$.

Idempotency: $X=K(Z,Y)=Z$ if $Y$ has the same margins than $Z$.

Composition of biproportions: $K(K(Z,Y_1),Y_2=K(Z,Y_2)$; $K(...K(Z,Y_1),Y_2)...Z_N)=K(Z,Y_N)$.

Zeros: a zero in $Z$ is projected as a zero in $X$. Thus, a bloc-diagonal matrix is projected as a bloc-diagonal matrix and a triangular matrix is projected as a triangular matrix.

Theorem of separable modifications: if $Z$ is premutiplied by a diagonal matrix and/or postmultiplied by a diagonal matrix, then the solution is unchanged.

Theorem of "unicity": If $K^$ is any non-specified algorithm, with $\hat=K^(Z,Y)=UZV$, $U$ and $V$ being unknown, then $U$ and $V$ can always be changed into the standard form of $P$ and $Q$. The demonstrations calls some above properties, particularly the Theorem of separable modifications and the composition of biproportions.

Algorithm 1 (classical IPF)

Given a two-way (''I'' × ''J'')-table $x_$, we wish to estimate a new table $\hat_ = a_i b_j x_$ for all ''i'' and ''j'' such that the marginals satisfy $\sum_j \hat_\ = u_,$ and $\sum_i \hat_\ = v_$.

Choose initial values $\hat_^ := x_$, and for $\eta \geq 1$ set

: $\hat_^ = \frac$

: $\hat_^ = \frac.$

Repeat these steps until row and column totals are sufficiently close to u and v.

Notes:
* For the RAS form of the algorithm, define the diagonalization operator $diag: \mathbb^k \longrightarrow \mathbb^$, which produces a (diagonal) matrix with its input vector on the main diagonal and zero elsewhere. Then, for each row adjustment, let $R^=diag(\frac)$, from which $M^=R^M^$. Similarly each column adjustment's $S^=diag(\frac)$, from which $M^=M^S^$. Reducing the operations to the necessary ones, it can easily be seen that RAS does the same as classical IPF. In practice, one would not implement actual matrix multiplication with the whole R and S matrices; the RAS form is more a notational than computational convenience.

Algorithm 2 (factor estimation)

Assume the same setting as in the classical IPFP.
Alternatively, we can estimate the row and column factors separately: Choose initial values $\hat_j^ := 1$, and for $\eta \geq 1$ set

: $\hat_i^ = \frac,$

: $\hat_j^ = \frac$

Repeat these steps until successive changes of a and b are sufficiently negligible (indicating the resulting row- and column-sums are close to u and v).

Finally, the result matrix is
$\hat_ = \hat_i^\hat_j^x_$

Notes:

* The two variants of the algorithm are mathematically equivalent, as can be seen by formal induction. With factor estimation, it is not necessary to actually compute each cycle's $\hat_^$.
* The factorization is not unique, since it is $m_ = a_i b_j x_ = (\gamma a_i)(\fracb_j)x_$ for all $\gamma > 0$.

Discussion

The vaguely demanded 'similarity' between M and X can be explained as follows: IPFP (and thus RAS)
maintains the crossproduct ratios, i.e.

: $\frac = \frac\ \forall\ \eta \geq 0\texti\neq h,\quad j\neq k$

since $m^_ = a_i^b_j^x_.$

This property is sometimes called structure conservation and directly leads to the geometrical interpretation of contingency tables and the proof of convergence in the seminal paper of Fienberg (1970).

Direct factor estimation (algorithm 2) is generally the more efficient way to solve IPF: Whereas a form of the classical IPFP needs

: $IJ(2+J) + IJ(2+I) = I^2J + IJ^2 + 4IJ \,$

elementary operations in each iteration step (including a row and a column fitting step), factor estimation needs only

: $I(1+J) + J(1+I) = 2IJ + I + J \,$

operations being at least one order in magnitude faster than classical IPFP.

IPFP can be used to estimate expected quasi-independent (incomplete) contingency tables, with $u_i = x_, v_j = x_$, and $m^_=1$ for included cells and $m^_=0$ for excluded cells. For fully independent (complete) contingency tables, estimation with IPFP concludes exactly in one cycle.

Comparison with the NM-method

Similar to the IPF, the NM-method is also an operation of finding a matrix $X$ which is the “closest” to matrix $Z$ ($Z \in \mathbb^$) while its row totals and column totals are identical to those of a target matrix $Y$ $( Y \in \mathbb^)$.

However, there are differences between the NM-method and the IPF. For instance, the NM-method defines closeness of matrices of the same size differently from the IPF. Also, the NM-method was developed to solve for matrix $X$ in problems, where matrix $\boldsymbol$ is not a sample from the population characterized by the row totals and column totals of matrix $Y$, but represents another population. In contrast, matrix $\boldsymbol$ is a sample from this population in problems where the IPF is applied as the maximum likelihood estimator.

Existence and uniqueness of MLEs

Necessary and sufficient conditions for the existence and uniqueness of MLEs are complicated in the general case (see), but sufficient conditions for 2-dimensional tables are simple:

* the marginals of the observed table do not vanish (that is, $x_ > 0,\ x_ > 0$) and
* the observed table is inseparable (i.e. the table does not permute to a block-diagonal shape).

If unique MLEs exist, IPFP exhibits linear convergence in the worst case (Fienberg 1970), but exponential convergence has also been observed (Pukelsheim and Simeone 2009). If a direct estimator (i.e. a closed form of $(\hat_)$) exists, IPFP converges after 2 iterations. If unique MLEs do not exist, IPFP converges toward the so-called ''extended MLEs'' by design (Haberman 1974), but convergence may be arbitrarily slow and often computationally infeasible.

If all observed values are strictly positive, existence and uniqueness of MLEs and therefore convergence is ensured.

Example

Consider the following table, given with the row- and column-sums and targets.

For executing the classical IPFP, we first adjust the rows:

The first step exactly matched row sums, but not the column sums. Next we adjust the columns:

Now the column sums exactly match their targets, but the row sums no longer match theirs. After completing three cycles, each with a row adjustment and a column adjustment, we get a closer approximation:

Implementation

The R package mipfp (currently in version 3.1) provides a multi-dimensional implementation of the traditional iterative proportional fitting procedure. The package allows the updating of a ''N''-dimensional array with respect to given target marginal distributions (which, in turn can be multi-dimensional).

Python has an equivalent package, ipfn that can be installed via pip. The package supports numpy and pandas input objects.

See also

* Data cleansing
* Data editing
* NM-method
* Triangulation (social science) for quantitative and qualitative study data enhancement.

References

{{DEFAULTSORT:Iterative Proportional Fitting
Contingency table
Statistical algorithms