Approximate matrix completion based on cavity method

06/29/2019
by   Chihiro Noguchi, et al.
0

In order to solve large matrix completion problems with practical computational cost, an approximate approach based on matrix factorization has been widely used. Alternating least squares (ALS) and stochastic gradient descent (SGD) are two major algorithms to this end. In this study, we propose a new algorithm, namely cavity-based matrix factorization (CBMF) and approximate cavity-based matrix factorization (ACBMF), which are developed based on the cavity method from statistical mechanics. ALS yields solutions with less iterations when compared to those of SGD. This is because its update rules are described in a closed form although it entails higher computational cost. CBMF can also write its update rules in a closed form, and its computational cost is lower than that of ALS. ACBMF is proposed to compensate a disadvantage of CBMF in terms of relatively high memory cost. We experimentally illustrate that the proposed methods outperform the two existing algorithms in terms of convergence speed per iteration, and it can work under the condition where observed entries are relatively fewer. Additionally, in contrast to SGD, (A)CBMF does not require scheduling of the learning rate.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2018

Approximate Method of Variational Bayesian Matrix Factorization/Completion with Sparse Prior

We derive analytical expression of matrix factorization/completion solut...
research
05/22/2019

Beyond Alternating Updates for Matrix Factorization with Inertial Bregman Proximal Gradient Algorithms

Matrix Factorization is a popular non-convex objective, for which altern...
research
06/24/2020

Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems

Matrix Factorization (MF) has been widely applied in machine learning an...
research
10/09/2014

Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares

The matrix-completion problem has attracted a lot of attention, largely ...
research
02/01/2021

Riemannian Perspective on Matrix Factorization

We study the non-convex matrix factorization approach to matrix completi...
research
05/27/2021

Towards a Better Understanding of Linear Models for Recommendation

Recently, linear regression models, such as EASE and SLIM, have shown to...
research
05/03/2016

Dictionary Learning for Massive Matrix Factorization

Sparse matrix factorization is a popular tool to obtain interpretable da...

Please sign up or login with your details

Forgot password? Click here to reset