Boolean Matrix Factorization and Noisy Completion via Message Passing

09/28/2015
by   Siamak Ravanbakhsh, et al.
0

Boolean matrix factorization and Boolean matrix completion from noisy observations are desirable unsupervised data-analysis methods due to their interpretability, but hard to perform due to their NP-hardness. We treat these problems as maximum a posteriori inference problems in a graphical model and present a message passing approach that scales linearly with the number of observations and factors. Our empirical study demonstrates that message passing is able to recover low-rank Boolean matrices, in the boundaries of theoretically possible recovery and compares favorably with state-of-the-art in real-world applications, such collaborative filtering with large-scale Boolean data.

READ FULL TEXT

page 6

page 14

research
07/31/2022

Unitary Approximate Message Passing for Matrix Factorization

We consider matrix factorization (MF) with certain constraints, which fi...
research
05/01/2021

Matrix completion based on Gaussian belief propagation

We develop a message-passing algorithm for noisy matrix completion probl...
research
02/20/2017

Bayesian Boolean Matrix Factorisation

Boolean matrix factorisation aims to decompose a binary data matrix into...
research
09/15/2020

Bilinear Generalized Vector Approximate Message Passing

We introduce the bilinear generalized vector approximate message passing...
research
11/06/2018

Fast OBDD Reordering using Neural Message Passing on Hypergraph

Ordered binary decision diagrams (OBDDs) are an efficient data structure...
research
05/15/2018

On the glassy nature of the hard phase in inference problems

An algorithmically hard phase was described in a range of inference prob...
research
07/05/2011

Distributed Matrix Completion and Robust Factorization

If learning methods are to scale to the massive sizes of modern datasets...

Please sign up or login with your details

Forgot password? Click here to reset