Automatic Hyperparameter Tuning in Sparse Matrix Factorization
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 25 references that are in the map. First posted on arXiv 17 May 2023.
Builds on
6 of 25 references.
References · 6
- 2014Phase transitions and sample complexity in Bayes-optimal matrix factorizationcited by 22
- 2015Phase Transitions in Sparse PCAcited by 15
- 2018Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensionscited by 15
- 2013Phase Diagram and Approximate Message Passing for Blind Calibration and Dictionary Learningcited by 6
- 2015Consistent Parameter Estimation for LASSO and Approximate Message Passingcited by 6
- 2018Approximate Method of Variational Bayesian Matrix Factorization/Completion with Sparse Priorcited by 1
Built on by
Citing papers per year: 2024: 1.
1 paper.