Title: LEARNING RELEVANT FEATURES FOR STATISTICAL IN-FERENCE

Abstract: Given two views of data, we consider the problem of finding the features of one view which can be most faithfully inferred from the other. We find that these are also the most correlated variables in the sense of deep canonical correlation analysis (DCCA). Moreover, we show that these variables can be used to construct a non-parametric representation of the implied joint probability distribution. This representation can be used to compute the expectations of functions over one view of data conditioned on the other, such as Bayesian estimators and their standard deviations. We test the approach using inference on occluded MNIST images, and show that our representation contains multiple modes. Surprisingly, when applied to supervised learning (one dataset consists of labels), this approach automatically provides regularization and faster convergence compared to the cross-entropy objective. We also explore using this approach to discover salient independent variables of a single dataset.

1. INTRODUCTION:

Given samples (x 1 , y 1 ), . . . , (x n , y n ) from an unknown joint probability distribution p(x, y), we want to construct a useful representation of the conditional probabilities p(x|y) and p(y|x), so that we that we can infer one view from the other on new data.

For instance, x and y could be past and future histories of dynamical data, visual and auditory inputs, actions and their effects, etc.

Following the approach introduced in Bény & Osborne (2013; 2015b) in the context of quantum information theory, we look at the problem as follows: the conditional distributions p(y|x) can be thought of as representing a noisy communication channel (stochastic map). This channel is a linear map between spaces of typically ludicrously large dimensions (the spaces of all probability distributions over x or y). We want a pair of small subspaces which best represent the channel. Specifically, we look for those vectors representing probability distributions over x which lose least distinguishability under the channel, where the distinguishability is measured by the χ 2 divergence.

We show in Section 3 that this is equivalent to performing a certain singular value decomposition of the channel (seen as an operator in Hilbert space) and keep only the components with the largest singular values. Moreover, the full singular value decomposition is equivalent to the decomposition in terms of canonical variables introduced in Lancaster (1958), namely,

EQUATION

where u i and u j are real non-linear functions such that E(u i u j ) = δ ij , E(v i v j ) = δ ij , and 0 < η D ≤ • • • ≤ η 1 ≤ η 0 = 1 are the singular values.

The practical advantage of this representation for inference (or prediction) is that it reduces the evaluation of conditional expectations to that of empirical averages over the (unconditional) marginal p(y).

As observed in Michaeli et al. (2016) , the span of the first k canonical variables u i , v j is what is learned by the deep canonical correlation analysis (DCCA) (Andrew et al., 2013) . Indeed, these variables are those which maximize the correlations E(u i v i ) subject to the same constraints as above.

(This reduces to CCA (Hotelling, 1936) when u i , v j are linear maps).

In this work, besides establishing this new information-theoretical interpretation of canonical variables and DCCA, we experiment with using this representation for performing inference on new data. Moreover, we propose a strategy for extracting disentangled variables from the canonical variables, inspired by analytical solutions.

2. RELATED WORK:

This general problem (of building an effective representation of the conditional probability distributions implied by joint samples) covers many existing approaches in different contexts. For instance, if the variables y has few possible states, then it reduces to a classification problem, usually solved by minimizing the crossentropy between a predicted distribution and the one-hot encoding of the classes.

When y has a large number of states, or is fundamentally continuous, existing approaches usually do not model the whole conditional distribution, but either provide the average (regression), or approximately sample from it.

The main class of methods which allows for sampling from the conditional distributions are variational: a deterministic neural networks produces the parameters of analytical classes of probabilities. This includes variational autoencoders Kingma & Welling (2013) (e.g., Iten et al. (2018) ; Wang et al. (2016) ), and approaches based on the minimum description length principle such as Gregor et al. (2013) .

Alternatively, it may also be possible to use adversarial training Goodfellow et al. (2014) , by using a conditional Mirza & Osindero (2014) version of an energy-based GAN Zhao et al. (2016) .

By contrast, our approach doesn't require the training of a generative model. Instead, conditional expectations are constructed as linear combinations of unconditional empirical averages over the training data.

Previous approaches to equipping CCA or DCCA with an information-theoretic interpretation have explored different directions. For instance, in Wang et al. (2016) , the authors generalize a probabilistic interpretation for CCA in terms of gaussian distributions, which leads to a variational approach.

In Painsky et al. (2018) , additional constraints on the mutual information between the data and the learned variables are added to the optimizations.

A previous attempt at designing a numerical solution for our singular value problem can be found in Bény (2018b) . In that work, the relevant variables were represented through a PCA kernel produced by Monte Carlo sampling, but wasn't practical.

3. THEORY:

We formalize the problem by assuming that our data was sampled from an unknown joint distribution p(x, y) over two random variables X and Y .

Let V X and V Y denote the linear spaces spanned by all probability distributions over X and Y respectively. Here we assume that X and Y take finitely many values for simplicity, but this formalism can be straightforwardly extended to infinite-dimensional vector spaces.

We will need inner products on V X and V Y , to make them into real Hilbert spaces. We use the Fisher information metrics evaluated at the points p(x) and p(y) respectively (marginals of p(x, y)), that is,

EQUATION

for any vectors µ, µ ∈ V X and ν, ν ∈ V Y .

Below we also call the marginals p X and p Y respectively when omitting their arguments (p X (x) ≡ p(x) and p Y (y) ≡ p(y)).

These inner products allow us to define the χ 2 divergence:

EQUATION

which a measures of statistical distinguishability between q and p X . Specifically, it quantifies how easy it is to reject the null hypothesis that the state is p X when it is actually q, based on the empirical distribution obtained from independent samples. It is also the lowest order approximation of the Kullback-Leibler divergence.

The joint distribution p(x, y) yields conditional distributions p(y|x) and p(x|y). These can be understood as the components (or kernels) of stochastic maps N :

EQUATION

These stochastic maps N and N * perform inference of one variable given some (possibly imperfect) knowledge about the other, with priors given by the marginals p(x) or p(y) of p(x, y) depending on the direction of the inference. Importantly, N * is the transpose of N in terms of the inner products defined above:

EQUATION

We now have the tools to address the problem mentioned in the introduction. The distinguishability between q ∈ V X and p X after the action of the channel

N is χ 2 (N (q), p Y ) since p Y = N (p X ).

Hence we want to find the distributions p which maximize the relevance Bény & Osborne (2013) .

EQUATION

where µ = q -p X . The inner-product formulation makes it clear that this amounts to finding the eigenvector with largest eigenvalue for the symmetric map N * N , which is also the singular vector with largest singular value for N . On can then go on to find the eigenvector with next largest eigenvalue and so on, which are automatically orthogonal.

In practice, the inner products are more tractable to compute if we express elements µ ∈ V X and ν ∈ V Y in terms of variables f and g as µ = p X f and ν = p Y g, or µ(x) = p(x)f (x) and ν(y) = p(y)g(y)

for all x, y. Indeed, this yields simply µ, µ X = E(f f ) and ν, ν Y = E(gg ).

We are now in measure to make the connection with DCCA Andrew et al. (2013) . Indeed, the aims of DCCA is to maximize the correlations corr(f, g) = E(f g) over function f (x) and g(y) such that E(f 2 ) = E(g 2 ) = 1. But, using µ = p X f and ν = p Y g, we have

E(f g) = ν, N (µ) Y ,

which is maximized by the left-and right-singular vectors µ and ν of N with largest singular value.

Given all the singular vectors µ i = p X f i and ν i = p Y g i with singular values η i , we obtain the representation

N (µ) = i η i ν i µ i , µ X ,

which, using a more standard notation and the Kronecker delta δ x , yields Eq. 1:

p(y|x) = N (δ x )(y) = 1 p(x) i η i ν i (y)µ i (x) = p(y) i η i v i (y)u i (x),

where µ i = p X u i and ν i = p Y v i .

3.1. NON-DIAGONAL FORM AND RELEVANT VARIABLES:

For the purpose of the optimization and inference, we do not need to full diagonal decomposition, but just functions f i = µ i /p X and g j = ν j /p Y , i, j = 1, . . . , k 0 , which have the same span as the canonical variables u i and v j respectively for i, j = 1, . . . , k 0 (assuming that η 1 , . . . , η k0 are the largest singular vector). Below we refer to f i and g j as the k 0 most relevant variables.

Because these functions may not be orthogonal, we need the covariance matrices

K ij = µ i , µ j X = E(f i f j ), L ij = ν i , ν j X = E(g i g j ), A ij = ν i , N (µ j ) Y = E(g i f j ).

If N ij denote the components of N in the sense that N (p X f j ) =

i N ij p Y g i , then, using our inner products to isolate N ij , we obtain N = L -1 A. Similarly, the components of N * are N * ij = K -1 A . This implies that the sum of the square of the singular values of N restricted to the spans of the vectors p X f i and p Y g j for all i, j, which is what we want to maximize, is just given by k0 i=1

η 2 i = Tr (N * N ) = Tr (K -1 A L -1 A).

This is the DCCA objective. Below we use the objective function C = k 0 -Tr (N * N ), for the cosmetic reason that its optimal value is zero.

Moreover, the corresponding truncated representation of the conditional distribution is

p(y|x) = N (δ x )(y) p(y) k0 i,j=1 (L -1 AK -1 ) ij g i (y)f j (x),

where we used the fact that the components of δ x are δ j = i K -1 ji f i (x). Of course, This approach can produce a faithful representation of the correlations only if N is actually close to being of rank k 0 (see Appendix B for a more precise statement). If we interpret the relevant subspace as a space of probability over latent variable, this means that our latent variables have at most k 0 discrete states. However, even if the rank k 0 corner of N is a not a good approximation, this strategy allows us to nevertheless do the correct inference on certain random variables, namely those which are in the span of the canonical variables! Indeed, the exact conditional expectation of g k is (assuming D is the actual rank of N ),

y g k (y)p(y|x) = D i,j=1 (L -1 AK -1 ) ij E(g k g i )f j (x) = D j=1 (AK -1 ) kj f j (x) = k0 j=1 (AK -1 ) kj f j (x),

where the last truncation is exact if k ≤ k 0 due to the assumption that the basis f i and g j have the same span as the k 0 largest right and left singular vectors of N respectively.

For instance, if p(x, y) is Gaussian, the canonical variables can be computed analytically, as in Lancaster (1958) or Bény (2018a) in the multivariate case. Solutions for other distributions were also computed in Eagleson (1964) .

Notably, for any two dimensional Gaussian, the space of k most relevant variables is simply spanned by the moments f n (x) = x n and g n (y) = y n for n = 0, . . . , k -1. Hence, in this case the first k moments can be inferred exactly using only the k + 1 most relevant variables (See Appendix C).

4. ALGORITHM:

Let us explicit the algorithm resulting from the above analysis.

We assume that we are given independent samples (x 1 , y 1 ), (x 1 , y 2 ), . . . from the otherwise unknown joint distribution p(x, y).

We first perform DCCA (Andrew et al., 2013) . That is, we need two independent deterministic feedforward neural networks. The first maps x to a set of k 0 real-valued variables f 1 (x), . . . , f k0 (x). The second maps y to a different set of k 0 variables g 1 (y), . . . , g k0 (y).

The parameters of the neural networks are to be set to minimize the objective function

EQUATION

where the matrices K, L, A can be approximated over a mini-batch (x n , y n ), n = 1, . . . , N via

EQUATION

)

We found that, provided the batch size is sufficiently large compared to k 0 (about 10 times in our experience), this can be minimized using ADAM or direct gradient descent. However, to guarantee stability when using large k 0 , we needed to explicit the gradient of the objective function in order to force the use of the Moore-Penrose pseudo-inverses for K -1 and L -1 in both the forward and backward passes, in addition to using 64 bits floats in these computations.

Once the relevant variables have been learned, we still need to use the training data in a second step. Indeed, suppose that we wish to use our model to infer the value of some function Θ(x), i.e., to compute its approximate expectation value in terms of the conditional distribution x → p(x|y).

Then we need to store, for each variable j = 1, . . . , k 0 , the quantities

EQUATION

where the average is to be taken on the full training batch (of size N full ). The same can be done exchanging x with y and f j with g j for the reverse inference.

For instance, if a data point x is composed of real components x a -such as pixel color components for an image-and we are interested in the estimator which minimize the expected l 2 distance to the predicted values of these components, then we need the expectation values of the components Θ(x) = x a for all a, and possibly higher moments to gain more knowledge about the shape of the posterior distribution, such as the second moments Θ (x) = x 2 , etc.

Inference can then be performed with new data using

EQUATION

Moreover, the accuracy of these predictions does not depend on the rank k 0 if Θ is taken in the span of the relevant variables, i.e., Θ(

x) = k i=1 c i f i (x), for which Θ j = k0 i=1 c i K ij .

The reverse inference formulas are obtained simply by the exchanges K ↔ L, A ↔ A , and

g i ↔ f i .

5. EXPERIMENTS:

In all our experiments, we used the ADAM optimizer with learning rate 0.001. We used the Flux package (Innes, 2018) for Julia, as well as Tensorflow.

As usual the data is divided into a training set and a testing set. No aspect of the testing set is used during training. The loss function refers to Eq. ( 7). In order to monitor overfitting, we compute a "test loss" and a "training loss". The test loss is computed from the trained variables using only the test data, and accordingly, the training loss is computed purely using the training data.

Moreover, when performing inference on test data using Eq. ( 10), we use the covariances A, L, K and expectations Θ j (Equ. ( 9)) built from the training data only.

5.1. INFERENCE ON OCCLUDED MNIST:

In this experiment, we use the left and right halves of the MNIST digit images as correlated variables X and Y . The goal is to obtain the expected left halves given the right halves, or vice versa.

The training set was augmented by random small rotations and displacements to make the task more ambiguous, as we want to explore the uncertainty in the prediction.

The relevant variables were represented by two convolutional neural networks of identical architecture. They are composed of four convolutional layers and one fully connected layer, an architecture that performs well for supervised learning on this dataset. For ease of implementation, these CNN have the whole image as input, but with either half zeroed (same value as black pixels). Half-width CNNs with proper padding at the cut perform similarly.

After training, we used the training dataset to also compute the expected pixel gray value as well as their covariance for each relevant variable using Eq. ( 9). These were used into Eq. ( 10) to compute the mean pixel gray values and their covariances over the conditional probability of X given Y on test data. This mean is the Bayesian estimator for the l 2 distance between half images, i.e., it should minimize the expected distance d l 2 over the conditional distribution, where

d 2 l 2 (x, y) = i (x i -y i ) 2

, where x i ∈ [0, 1] is the value of the i th pixel. (This is equivalent to minimizing the mean square error).

The results on a randomly selected subset of test digits is shown in Fig. 1 . For each example, we also computed the images obtained by adding plus or minus one standard deviation along the direction of greatest variance in the space of relevant variables. This reveals the main ambiguities (such as between 8 and 3 or 7 and 9 which share a similar right half).

The graph of the singular values shows that the rank cutoff of 200 is too low to capture all of the relevant variables (the sudden drop at the end is not robust to an increase in the cutoff), but the results are reasonable nevertheless. This shows that our representation of the conditional distributions contains valuable information besides the simple mean.

5.2. SUPERVISED LEARNING:

In the context of a supervised classification task, one of the dataset (the labels) is of sufficiently low dimensionality that we can use a complete basis over its probability space as our relevant variables, such as the standard one-hot encoding of labels. This serves as a good first sanity test for our approach. Surprisingly, we find that it converges faster than standard approaches, and without the need for regularization.

Let the variable Y stands for the labels, with values in {1, . . . , k}. The probability space consists of vectors with k real components. The canonical basis corresponds to the one-hot encoding g i (j) = δ ij (Kronecker delta). All we need is a neural network to encode k variables f 1 , . . . , f k on X. After learning the most relevant variables f i , we apply the reverse of Eq. ( 10) for function Θ(y) = y, and use the maximum component of expected value y to infer the labels from the data.

Let us refer to this procedure as DCCI (Deep Canonical Correlations based Inference).

We tested this approach on the MNIST and CIFAR10 datasets, and compared the results to the standard cross-entropy objective (Fig. 2 ).

We plotted the accuracy as function of the epoch rather than clock time which would depend on many factors. But the time per epoch is roughly the same for each approaches in the above experiments. Indeed, the training time is dominated by the forward and backward evaluations of the neural networks which are identical. (However, the time it takes to evaluate our objective can become significant for much larger number of labels k, since it involves the inversion of matrices of dimension k. This is in addition to the fact that a greater dimension would require also larger batches.)

We found that, without regularization, simply changing the objective from cross-entropy to DCCI provided a large improvement both of convergence speed and final accuracy for both models. Figure 2 : Loss and inaccuracy (error rate) on test sets for two classification tasks. The models were trained either using the cross-entropy (CE) or our approach (DCCI), with or without regularization layers. On the MNIST dataset, we used an "all CNN" network, and for the CIFAR10 dataset we used a short VGG variation with 10 convolutions and 3 fully connected layers. In the regularized form, post-activation Batchnorm layers were placed after each convolutional layers on the VGG network. What is shown is the mean over 10 independent runs for MNIST and 5 runs for CIFAR10. The shaded area spans the standard deviation. ADAM with default parameters was used in all cases. No data augmentation was used except for horizontal flips for CIFAR10 (resulting in epochs of 100,000 images). On MNIST, DCCI alone also outperformed cross-entropy with dropout. (Dropout did not yield any improvement in conjunction with DCCI). However, adding batch-normalization layers on the CIFAR example, erased any distinction between DCCI and cross-entropy.

5.3. STRUCTURE OF THE RELEVANT VARIABLES:

We mentioned in Section 3 that if p(x, y) is a two-dimensional Gaussian distribution with zero mean, then the n most relevant variables of X are the first n powers of X itself, independently of the covariance matrix. This implies that the canonical variables are the Hermite polynomials in X (which results from applying the Gram-Schmidt procedure to the basis {1, x, x 2 , . . . }).

A similar property holds for multivariate Gaussians, namely, the less relevant singular values are polynomials in the more relevant ones. If this is true more generally, it should be possible to further compress and organize the latent space extracted with DCCA by finding a minimal set of generators, which ought to also be in the span of the most relevant variables.

We applied DCCA to a synthetic dataset to explore this idea, shown in Fig. 3 . In this case, we actually performed a final SVD to obtain the unique uncorrelated canonical variables, and ordered them by decreasing relevance (their respective singular values).

Here, X consists of two real numbers, distributed uniformly within a ring and a disk. The variable Y is obtained by adding a random Gaussian shift to X with a small standard deviation. The more relevant variables ought to be those which are more robust to such small random displacement. This formalizes the idea that we are interested in extracting "large-scale" variables Bény (2018b).

We would expect the relevant independent variables to be: the binary variable indicating whether the point is in the disk or the ring and the angle around the ring, followed by the radial component in the ring, and finally the Cartesian coordinates inside the disk. This is precisely what we see in Fig. 3 .

Indeed-if we put aside for now the fact that the angle itself is not directly represented-besides the constant function, the two most relevant variables are the sine and cosine of the angle, followed by the binary variable separating the disk from the ring.

But these variables ought to span the space of probabilities over the relevant variables, not just the variables themselves. Hence the next six variables are sines and cosines of smaller wavelength, reconstruction error vs latent dimension which can encode probability distributions which are increasingly more precisely localized, down to a precision (wavelength) comparable with the diameter of the inner disk. Accordingly, the next two most relevant variables are the Cartesian coordinates inside the disk. This is followed by additional moments of the angle, down to a wavelength equal to the ring's thickness, at which point we see the radius in the ring appear.

As mentioned, we see that the angle itself is not represented, likely because it is discontinuous. However, as shown also in Fig. 3 , creating a gap in the ring allows for the angle to emerge as most relevant variable. This suggests that this approach may be able to automatically learn intrinsic coordinates of the latent variable manifold.

5.4. INDEPENDENT VARIABLES AND GENERATIVE MODEL:

If we postulate that the independent (or disentangled) relevant latent variables can be found in the linear span of the relevant variables, we can attempt to extract them by optimizing a neural network composed of two parts. Firstly, a linear layer maps the relevant variables to a small number of outputs (equal to the latent dimension). The purpose of this linear layer is to find the independent variables. These latent variables are then processed by an arbitrarily complex generative network to produce a possible value of the variable X. As objective function, we may us an appropriate measure of similarity between the output and the data element from which the variables were obtained.

We tested this idea as follows. We took X to consist of the MNIST digits, and produced Y by randomly permuting neighboring pixels in the image, until the mean displacement per pixel is of order 1. In addition, we added independent Gaussian noise to the pixel values. (Hence the noise map N simulates the coarse-graining channel introduced in Bény & Osborne (2015a)).

As in the previous experiment, we do so to implement our intuition that the more relevant variables ought to be the ones which are of larger scale, or more robust to local perturbations.

The relevant variables of the clean images were produced by the same convolutional neural network as in Section 5.2, while the variables of the coarse-grained images were extracted by a network of the same geometry, but with half the number of filters and neurons.

We extracted the 1000 most relevant out of 1200 learned variables in this way. (The least relevant variables in this system happen to be highly dependent on the total number of variables and hence cannot be trusted to be correct). As a second step, we trained a linear layer coupled to a network composed of 5 fully-connected layers of 800 hidden neurons each. We refer to the number of output neurons in the first linear layer as the latent dimension.

As input, this network received the variables extracted from MNIST images using the above convolutional neural net (after it was fully trained using DCCA), and was trained to minimize the mean square error between its output and the original MNIST digit.

The resulting best mean square errors are shown in Fig. 4 , as function of the latent dimension. Here we see a distinct change of polynomial scaling law at dimension 19. Increasing the dimension further provides no improvement. This behaviour is compatible with our hypothesis that the extra variables are just functions of those first twenty variables (functions which are effectively re-implemented by the generative network).

Images generated by sampling from a Gaussian approximation of the latent distribution for different latent dimensions are shown in Fig. 4 . Below dimension 20, most generated image can be recognized as a specific digit.

6. OUTLOOK:

We studied the classical (non-quantum) form of the theory introduced in Bény & Osborne (2013), and found that the relevant observables of that theory are just the most correlated canonical variables in the sense of DCCA Andrew et al. (2013) , and can be learned effectively using standard machine learning methods.

This point of views on DCCA provided us with several new insights. The first is that the learned relevant variables provide a useful representation of a joint probability distribution. We showed that performing inference using this representation can outperform crossentropy in predicting classes.

Our experiments on halves of MNIST also show that the conditional distribution we obtain can effectively represent the uncertainty in the prediction of high-dimensional data.

A second insight relates to the interpretation of the canonical variables as spanning directions in the space of probability distributions. As suggested by the gaussian solutions and our experiment on synthetic data, we postulate that the canonical variables are functions of a small number of independent generators contained in their span. This hypothesis is supported by our experiment on MNIST, but further work is required to find a way to cleanly extract these variables.

We have yet to explore the potential applications of one of the salient aspect of this approach to inference, the fact that the canonical variables learned using DCCA are also those which can be most reliably predicted, irrespective of the value of the cutoff. To see why this is potentially significant, we observe that a central feature of scientific exploration is that we are not so concerned with making predictions about some given variables, as much as we are with discovering variables which can be predicted.

Another important feature of this approach is the fact that the resulting model allows for the direct evaluation of the expectation values in the posterior distribution without sampling. In particular this allows for the evaluation of credible intervals. Hence it should be especially suited to scientific applications where the ability to quantify uncertainty is essential.

Finally, the relationship that we established with theory of quantum origin points towards a potential quantum generalization of DCCA that would apply to quantum data, or classical measurements of quantum systems.

B.1 INNER PRODUCT ON PROBABILITY VECTORS:

In order to define our strategy, we need to equip the spaces of probability distributions for X and Y with an inner product structure. Let us focus on X, and assume that it takes discrete values to avoid unnecessary technicalities. The set of probability vectors is a convex subset of the real linear space V X = R n . Let us equip this space with the product µ, µ X :=

EQUATION

for any µ, µ ∈ V X . We also write µ 2 X = µ, µ X . Importantly, this depends explicitly on the fixed probability vector p X (x), which we took to be the marginal of p(x, y). If p X has full support, this makes V X into a real inner product space. The same can be done for the variable Y , yielding the inner product ν, ν Y for ν, ν ∈ V Y .

Had we interpreted µ and µ as tangent vectors to V X , considered as a manifold, this would be the Fisher information (Riemannian) metric, as in Bény & Osborne (2015b) . But this quantity is also meaningful for finite vectors: the induced norm distance between p X and any probability vector q is the χ 2 -divergence:

EQUATION

The set of conditional probability distributions p Y |X form a stochastic map, i.e., a linear map N :

V X → V Y , µ → N (µ),

where

EQUATION

for any µ ∈ V X .

It is straightforward to check that the stochastic map N * defined by

EQUATION

is the transpose N * of N with respect to the inner products we defined (Ohya & Petz, 2004) , i.e., for all ν ∈ V Y and µ ∈ V X , ν, N (µ

EQUATION

Also, we observe that N (p X ) = p Y and N * (p Y ) = p X .

B.2 EIGEN-RELEVANCE DECOMPOSITION:

We can use the inner products on V X and V Y to define a singular value decomposition of the stochastic map N . That is, there is an orthonormal family u 1 , . . . , u k of V X and an orthonormal family

EQUATION

for j = 1, . . . , k. For each j, η j is a singular value of N , whose square we call the relevance of the vector v j . Moreover η j ∈ [0, 1] since the χ 2 divergence is contractive under any stochastic map.

Given that N * is the transpose of N :

EQUATION

Equivalently, u j is an eigenvector of N * • N and v j is an eigenvectors of N • N * , both with eigenvalue η 2 j . Because N maps p X to p Y , we always have the dual eigenvectors u 0 = p X and v 0 = p Y with eigenvalue 1.

B.3 LOW-RANK APPROXIMATION:

Typically, the dimension k of the space of probabilities is more than astronomically large. For instance, if the values of X consists of small 256 gray level images of 28 × 28 pixels, then k = The core of our approach is to approximate N and N * by restricting them to the span of the first k 0 eigenvectors u j and v j with largest singular values η j . That is, if we order the singular values η j , j = 1, . . . , k in decreasing order, we propose to use the approximations

EQUATION

(20) to N and N * respectively, for some k 0 typically much smaller than k, and any µ ∈ V X , ν ∈ V Y .

We denote the components of N 0 and N * 0 by q(y|x) and q(x|y), e.g., N 0 (µ)(y) =

x q(y|x)µ(x).

(21)

Since N 0 and N * 0 are adjoint, we can define q(x, y) = q(x|y)p Y (y) = q(y|x)p X (x). Although the marginals of q(x, y) are the probability distributions p X and p Y , the numbers q(x, y) are not necessarily positive.

The quality of this approximation for a given k 0 does not directly depend on the dimensionality of X and Y , but only on the amount of correlations between the two variables. Our aim is to use a k 0 small enough that the components of N 0 and N * 0 can be computed explicitly. Theorem 1. N 0 is the map of rank k 0 which minimizes the average distance

EQUATION

Proof. The low rank approximation N 0 minimizes the distance N 0 -N F where

EQUATION

) is the Hilbert-Schmidt (or Frobenius) norm (Eckart & Young, 1936) . This follows from the fact that this is also the l 2 -norm of the vector of singular values of M. Let us find the explicit form of the trace. Each possible value x of the variable X is associated with a probability distribution δ x (y) = 1 when x = y and zero otherwise. These distributions form an orthogonal basis of V X , and have norms δ x , δ x = 1/p X (x). Therefore,

Tr (M * M) = x p X (x) δ x , M * M(δ x ) Y = x p X (x) M(δ x ) 2 Y B.4 RELEVANT VARIABLES

We express the elements µ ∈ V X and ν ∈ V Y in terms of the marginals p X and p Y as simple products:

µ(x) = p X (x)f (x) and ν(y) = p Y (y)g(y) (24) for all x, y, where f and g are real functions of x and y.

The inner products then simply become correlations among variables. Using also µ = p X f and ν = p Y g , we obtain

EQUATION

These are simple expectation values with respect to p, which we assumed is the type of quantity we can evaluate for arbitrary functions f, f , g, g .

Since N * N is self-adjoint in terms of this inner product, its eigenvectors u i are orthogonal, and hence the corresponding variables a i defined by u i (x) = p X (x)a i (x) are uncorrelated. Indeed,

EQUATION

for all i, j. Moreover, accounting for the eigenvector u 0 = p X (corresponding to the constant feature a 0 (x) = 1 for all x), a i = 0

for all i = 0. Hence we trivially have

EQUATION

for all i, j = 0.

Likewise for the eigenvectors of

EQUATION

for all i, j = 0.

Importantly, this does not mean that the variables u 1 , u 2 , . . . nor v 1 , v 2 , . . . are "disentangled", i.e., they are not statistically independent. These variables represent components in the space of probability vectors, rather than the "sample" space. They should be understood as spanning a subspace of the space of functions over the relevant independent variables. We discuss this in more detail in Section 5.3.

B.5 CORNERS OF N AND LOSS FUNCTION:

The final piece of puzzle we need, is the ability to express the components (corners) of N and N * in the span of possible non-orthogonal families of variables.

Let us therefore consider two arbitrary families f 1 , . . . , f k0 and g 1 , . . . , g k0 of variables, which respectively represent the vectors p X f j ∈ V X and p Y g j ∈ V Y .

Firstly, we need matrices representing the components of the inner products on V X and V Y . Those are the symmetric matrices

EQUATION

EQUATION

The components N ij of N are defined by

EQUATION

)

Taking the inner product with p Y g k , we obtain

EQUATION

)

The left-hand side can be computed using Equ. 13. It is the matrix

A kj = p Y g k , N (p X f j ) =

x,y p Y (y)g k (y)p Y |X (y|x)p X (x)f j (x) p Y (y) =

x,y p(x, y)g k (y)f j (x) = g k f j .

(35)

Therefore, in matrix notation, Equ. ( 34) is A = LN , or

EQUATION

)

The components N * ij of N * are obtained by just swapping X and Y , yielding

EQUATION

)

Hence the singular values of the corner of N defined by the variables f j and g j are just the squareroot of the eigenvalues of the matrix N * N = K -1 A L -1 A. In order to find the variables f j and g j with the same span as the first k 0 eigenvectors u j , v j , we just need to maximize all the eigenvalues of N * N . A simple way to do this is to use (minus) the trace of N * N as loss function, since it is the sum of the square of the singular values. We call Tr (N * N ) the relevance of the subspaces defines by the variables f j ad g i for all i, j. This yields the loss/cost function:

EQUATION

)

Once optimal variables have been found, one can obtain the components of the eigenvectors in the span of f 1 , . . . , f k0 through standard numerical diagonalization of N * N .

B.6 INFERENCE:

The variables minimizing C can be used to infer one variable from the other. For instance, given y, the inferred probability distribution over x is given by p X|Y (x|y) = N * (δ y )(x), where δ y (y ) is 1 when y = y and zero otherwise. In order to compute this, we first need the components of the distribution δ y in terms of the family p Y g 1 , . . . , p Y g k0 , i.e., the real numbers (δ y ) j such that 

Then, for instance, the expected inferred value of X is

EQUATION

For the inference of Y from x, we have

EQUATION

:

1888 . However, in many case, only very few of these dimensions may be relevant for the purpose of inferring other variables.

Figures and Tables:

Figure 1: Left mosaic: the left halves of the MNIST digits in a random sample from the test set are inferred from the right half, with cutoff k 0 = 200. Three images are shown for each digit. Within each triplet, the middle image represents the mean over pixel intensity of the inferred condition distribution, while left and right images corresponds to a plus and minus one standard deviation from the mean in the direction of largest covariance (in the space of half-images). A particularly interesting example is highlighted. Top-right: loss per epoch for k 0 = 200. Bottom-right: the singular values for different values of the cutoff k 0 , after 150 epochs in each case.

Figure3: Top-left: First 20 relevant variables (on X) determined by DCCA for a system where X consists of two coordinates uniformly sampled over a circle and a surrounding ring, and Y consists of the same points but shifted by a small normally distributed vector. The variables are arranged from left-to-right and top-to-bottom in order of decreasing relevance. Top-right: the same variables multiplied by the marginal p X . Bottom row: introducing a gap in the ring allows for a monotonous function of the angle to serve as second most relevant variable (instead of the sine/cosine couple). Hence the angle is automatically "disentangled" from the other variables. (Mid-gray represents the value 0).

Figure 4: Left: Best mean squared error for images reconstructed from the k most relevant variables, as a function of k (the latent dimension). This logarithmic plot shows that improvements stop once the dimension reaches 19 (where the two lines cross). Right: images produced by the generator from latent variables sampled according to the best Gaussian fit in latent space, for feature subspaces of dimensions 2, 8 and 19.

δ y (y ) = p Y (y ) k0 i=1 (δ y ) i g i (y ) + r(y ),(39)where r, p Y δ i Y = 0 for all i. Taking the inner product with p Y g j , we obtainp Y g j , δ y Y = k0 i=1 (δ y ) i L ji ,(40)where the left hand side is also justp Y g j , δ y Y = g j (y).(41)Therefore the components of δ y are explicitly(δ y ) i = j (L -1 ) ij g j (y).(42)It follows thatp X|Y (x|y) = N * (δ y )(x) ≈ N * 0 (δ y )(x) = ijk N *ki (L -1 ) ij g j (y)f k (x).

Peer review (iclr2020):
The paper proposes an approach to find a map between two feature spaces to maximize correlation between them and to use the resulting map for inference. A theoretical exposition is given and some empirical results are provided showing that the approach speeds up convergence on supervised MNIST and can be used for image completion (again on MNIST). The paper should be rejected for the following reasons. First, the approach looks very similar to deep CCA, but the connection is never mentioned. This connection needs to be clarified. The objective function needs to be clearly stated and related to the loss function in eq. (7). In particular, I would suggest to give a clear definition of the problem before delving into the theory in section 2. In its current version, it is difficult to assess how the parts of section 2 relate to the overall objective. The paper severely lacks in relation to relevant related work. Half(!) of the 14 referenced papers are by the author himself. This can be verified since the double blind review process is compromised as the paper links to code in the author’s public github account. Finally, the empirical results are quite incomplete. It is not clear how the results compare to generative methods like VAEs, which are referenced as a motivation for this work in this work. The improvement in convergence from RFA for supervised learning is interesting and this aspect deserves more analysis. It would be useful to look at the total amount of computation required to reach a given loss. I also wonder how this differs from simply mapping the output of the first network to a low-rank space via PCA. Is the dual-view really necessary in this case since the information content in the label space must be very limited, beyond simple class balance statistics?