Automatic Hyperparameter Tuning in Sparse Matrix Factorization

Ryota Kawasumi, Koujin Takeda
5/17/2023
stat.MLcond-mat.dis-nncs.IT

No confident code implementation found for this paper. 1 possible match can be shown below.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kawasumi2023automatic,
  title  = {Automatic Hyperparameter Tuning in Sparse Matrix Factorization},
  author = {Ryota Kawasumi and Koujin Takeda},
  year   = {2023},
  eprint = {2305.10114},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.10114v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.10114.svg)](https://codeofpaper.com/paper/2305.10114)

Discussion