Bayesian Principal Component AnalysisThis example provides an implementation of Bayesian principal components analysis as described, for example, in Chris Bishop's book Pattern Recognition and Machine Learning. The code is provided in the Examples Browser. Most of you will be familiar with standard Principal Component Analysis which is a widely used technique for dimensionality reduction. Given an observation space of dimension D we would like to find a latent space of lower dimension M (the 'principal space') which captures most of the data. The mapping from principal space to observation space is via a linear mapping represented by a mixing matrix W. PCA can be formulated in probabilistic way ('probabilistic PCA') and this in itself gives many benefits as itemised in Bishop. If in addition we adopt a Bayesian approach to inferring W, we can also determine the optimal value for M using 'automatic relevance determination' (ARD). A fully Bayesian treatment of probabilistic PCA (including ARD) is quite complex and it might take several weeks of work to implement an efficient deterministic inference algorithm. In Infer.NET, defining the model is 20 to 25 lines of code and a few hours' work. Below is a factor graph for Bayesian PCA. Factor graphs are a way to represent probabilistic models, and can be useful if you are going to build models in Infer.NET. If you can draw a factor graph, you should be able to code up the model in Infer.NET (subject to the currently available distributions, factors, and message operators). As a reminder, the first thing to note is that the variables in the problem are represented as circles/ovals, and the factors (functions, distributions, or constraints) are represented as small squares labelled by the type of factor. Each factor is only ever attached to its variables and each variable is only ever attached to its factors. The big enclosing rectangles represent 'plates' and show replications of variables and factors across arrays. Factor graphs are important both because they provide a clarifying visualisation of complex probabilistic models and because of the close relationship with the underlying inference and sampling algorithms (particularly those based on local message passing). The probabilistic model is defined as the product of all the factors.
The accompanying factor graph shows PCA as a generative model for randomly generating the N observations  these observations can be represented as an NxD array, and so are represented in the factor graph in the intersection of two plates of size N and D respectively. All indices are explicitly shown in the factor graph to make the comparison with the code clearer. The generative process starts at the top left where, for each observation and for each component in latent space, we sample from a standard Gaussian to give an NxM array Z (with elements z_{nm}_{}). In the top right we have the matrix variable W (elements w_{md}_{}) which maps latent space to observation space  so this will be an MxD matrix which will postmultiply Z. We have specified a maximum M in advance, but what we really want to do is learn the 'true' number of components that explain the data, and we do this by drawing the rows of W from a zeromean Gaussian whose precisions a (elements a_{m}) we are going to learn. If the precision on a certain row becomes very large (i.e. the variance becomes very small) then the row has negligible effect on the mapping and the effective dimension of the principal space is reduced by the number of such rows. The elements of a are drawn from a common Gamma prior. The MatrixMultiply factor multiplies the Z with W; as this factor takes two double arrays of variables, it sits outside the plates (this is shown in the diagram as a white 'hole' in the plates). The result of this factor is an NxD matrix variable T (elements t_{nd}_{}). We then add a bias vector variable m (elements m_{d} drawn from identical Gaussian priors) to each row of T to give matrix variable U (elements u_{nd}). Finally, the matrix X of observations vector is generated by drawing from Gaussians with mean U and precision given by the vector variable p (elements p_{d}_{} drawn from identical Gamma priors). The elements in this final array of Gaussian factors are the likelihood factors and represent the likelihood of the observations conditional on the parameters of the model. These parameters are W, m and p which we want to infer. The full code for this example provides a class (BayesianPCA) for constructing a general Bayesian PCA model for which we can specify priors and data at inference time. There is also some example code for running inference and extracting marginals. One important aspect of running inference on this model is that we initially need to break symmetries in the model by initialising the W marginals to random values using the InitialiseTo() method  for another example of this see the Mixture of Gaussians tutorial. The key aspects of the model are captured in the following few lines of C# code which, as you can hopefully see, directly matches the factor graph.
In order to test out this model, the test program generates 1000 data points from a model with M=3, D= 10. M is given a value of 6 to see if the inference could correctly determine the number of components. Here is the printout from a run. Only three of the rows of W have significant nonzero entries, and the bias and noise vectors are successfully inferred.
