Fast Rank-1 NMF for Missing Data with KL Divergence
We propose a fast non-gradient-based method of rank-1 non-negative matrix factorization (NMF) for missing data, called A1GM, that minimizes the KL divergence from an input matrix to the reconstructed rank-1 matrix. Our method is based on our new finding of an analytical closed-formula of the best rank-1 non-negative multiple matrix factorization (NMMF), a variety of NMF. NMMF is known to exactly solve NMF for missing data if positions of missing values satisfy a certain condition, and A1GM transforms a given matrix so that the analytical solution to NMMF can be applied. We empirically show that A1GM is more efficient than a gradient method with competitive reconstruction errors.
Code (1)
Tasks
Matrix Factorization / DecompositionMissing ValuesSimilar Papers 제목 키워드 기반
Divergence Frontiers for Generative Models: Sample Complexity, Quantization Effects, and Frontier Integrals
The spectacular success of deep generative models calls for quantitative tools to measure their statistical performance. Divergence frontiers have recently been proposed as an evaluation framework for generative models, …
DiversityQuantizationFast Rank Reduction for Non-negative Matrices via Mean Field Theory
We propose an efficient matrix rank reduction method for non-negative matrices, whose time complexity is quadratic in the number of rows or columns of a matrix. Our key insight is to formulate rank reduction as a mean-fi…
Matrix Factorization / DecompositionFast Hyperspectral Image Denoising and Inpainting Based on Low-Rank and Sparse Representations
This paper introduces two very fast and competitive hyperspectral image (HSI) restoration algorithms: fast hyperspectral denoising (FastHyDe), a denoising algorithm able to cope with Gaussian and Poissonian noise, and fa…
DenoisingHyperspectral Image DenoisingImage DenoisingTrust No One: Low Rank Matrix Factorization Using Hierarchical RANSAC
In this paper we present a system for performing low rank matrix factorization. Low-rank matrix factorization is an essential problem in many areas including computer vision, with applications in e.g. affine structure-fr…
Imputation and low-rank estimation with Missing Not At Random data
Missing values challenge data analysis because many supervised and unsupervised learning methods cannot be applied directly to incomplete data. Matrix completion based on low-rank assumptions are very powerful solution f…
ImputationMatrix CompletionMissing Values