Automatic Hyperparameter Tuning in Sparse Matrix Factorization
This addresses hyperparameter tuning for sparse matrix factorization, which is an incremental improvement in Bayesian methods for matrix analysis.
The authors tackled the problem of hyperparameter tuning in sparse matrix factorization by proposing a novel numerical method based on evaluating the zero point of normalization factor in sparse prior, which showed excellent performance in ground-truth sparse matrix reconstruction compared to sparse principal component analysis.
We study the problem of hyperparameter tuning in sparse matrix factorization under Bayesian framework. In the prior work, an analytical solution of sparse matrix factorization with Laplace prior was obtained by variational Bayes method under several approximations. Based on this solution, we propose a novel numerical method of hyperparameter tuning by evaluating the zero point of normalization factor in sparse matrix prior. We also verify that our method shows excellent performance for ground-truth sparse matrix reconstruction by comparing it with the widely-used algorithm of sparse principal component analysis.