Weighted Low Rank Matrix Approximation and Acceleration

09/22/2021
by   Elena Tuzhilina, et al.
10

Low-rank matrix approximation is one of the central concepts in machine learning, with applications in dimension reduction, de-noising, multivariate statistical methodology, and many more. A recent extension to LRMA is called low-rank matrix completion (LRMC). It solves the LRMA problem when some observations are missing and is especially useful for recommender systems. In this paper, we consider an element-wise weighted generalization of LRMA. The resulting weighted low-rank matrix approximation technique therefore covers LRMC as a special case with binary weights. WLRMA has many applications. For example, it is an essential component of GLM optimization algorithms, where an exponential family is used to model the entries of a matrix, and the matrix of natural parameters admits a low-rank structure. We propose an algorithm for solving the weighted problem, as well as two acceleration techniques. Further, we develop a non-SVD modification of the proposed algorithm that is able to handle extremely high-dimensional data. We compare the performance of all the methods on a small simulation example as well as a real-data application.

READ FULL TEXT
research
02/21/2023

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time

Given a matrix M∈ℝ^m× n, the low rank matrix completion problem asks us ...
research
12/06/2019

Hybrid Kronecker Product Decomposition and Approximation

Discovering the underlying low dimensional structure of high dimensional...
research
08/07/2016

Robust High-Dimensional Linear Regression

The effectiveness of supervised learning techniques has made them ubiqui...
research
06/14/2023

Graph-Based Matrix Completion Applied to Weather Data

Low-rank matrix completion is the task of recovering unknown entries of ...
research
05/28/2019

Polynomial Tensor Sketch for Element-wise Function of Low-Rank Matrix

This paper studies how to sketch element-wise functions of low-rank matr...
research
09/28/2011

Low-rank data modeling via the Minimum Description Length principle

Robust low-rank matrix estimation is a topic of increasing interest, wit...
research
07/31/2019

Binary component decomposition Part II: The asymmetric case

This paper studies the problem of decomposing a low-rank matrix into a f...

Please sign up or login with your details

Forgot password? Click here to reset