# Infinite Sparse Structured Factor Analysis

**Authors:** Matthew C. Pearce, Simon R. White

arXiv: 1704.04031 · 2017-04-14

## TL;DR

This paper extends matrix factorisation with Indian Buffet Process priors to include structured covariance, such as smoothness, improving feature recovery and denoising, especially in neuroimaging data.

## Contribution

It introduces a new model incorporating nondiagonal covariance structures into IBP-based factor analysis, enabling structured latent features.

## Key findings

- Smoothness prior improves latent feature recovery
- Enhanced denoising accuracy demonstrated
- Method is computationally efficient for neuroimaging data

## Abstract

Matrix factorisation methods decompose multivariate observations as linear combinations of latent feature vectors. The Indian Buffet Process (IBP) provides a way to model the number of latent features required for a good approximation in terms of regularised reconstruction error. Previous work has focussed on latent feature vectors with independent entries. We extend the model to include nondiagonal latent covariance structures representing characteristics such as smoothness. This is done by . Using simulations we demonstrate that under appropriate conditions a smoothness prior helps to recover the true latent features, while denoising more accurately. We demonstrate our method on a real neuroimaging dataset, where computational tractability is a sufficient challenge that the efficient strategy presented here is essential.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1704.04031/full.md

## Figures

24 figures with captions in the complete paper: https://tomesphere.com/paper/1704.04031/full.md

## References

23 references — full list in the complete paper: https://tomesphere.com/paper/1704.04031/full.md

---
Source: https://tomesphere.com/paper/1704.04031