Automatic Hyperparameter Tuning in Sparse Matrix Factorization
Machine Learning
2023-05-18 v1 Disordered Systems and Neural Networks
Information Theory
Machine Learning
math.IT
Abstract
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.
Cite
@article{arxiv.2305.10114,
title = {Automatic Hyperparameter Tuning in Sparse Matrix Factorization},
author = {Ryota Kawasumi and Koujin Takeda},
journal= {arXiv preprint arXiv:2305.10114},
year = {2023}
}
Comments
13 pages, 5 figures