Bayesian Adaptive Matrix Factorization With Automatic Model Selection

Peixian Chen, Naiyan Wang, Nevin L. Zhang, Dit-Yan Yeung; The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2015, pp. 1284-1292


Low-rank matrix factorization has long been recognized as a fundamental problem in many computer vision applications. Nevertheless, the reliability of existing matrix factorization methods is often hard to guarantee due to challenges brought by such model selection issues as selecting the noise model and determining the model capacity. We address these two issues simultaneously in this paper by proposing a robust non-parametric Bayesian adaptive matrix factorization (AMF) model. AMF proposes a new noise model built on the Dirichlet process Gaussian mixture model (DP-GMM) by taking advantage of its high flexibility on component number selection and capability of fitting a wide range of unknown noise. AMF also imposes an automatic relevance determination (ARD) prior on the low-rank factor matrices so that the rank can be determined automatically without the need for enforcing any hard constraint. An efficient variational method is then devised for model inference. We compare AMF with state-of-the-art matrix factorization methods based on data sets ranging from synthetic data to real-world application data. From the results, AMF consistently achieves better or comparable performance.

Related Material

author = {Chen, Peixian and Wang, Naiyan and Zhang, Nevin L. and Yeung, Dit-Yan},
title = {Bayesian Adaptive Matrix Factorization With Automatic Model Selection},
booktitle = {The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2015}