Parallelized preconditioned model building algorithm for matrix factorization

Kaya, Kamer and Birbil, Ş. İlker and Öztürk, Mehmet Kaan and Emami Gohari, Amir (2018) Parallelized preconditioned model building algorithm for matrix factorization. In: 3rd International Conference on Machine Learning, Optimization, and Big Data, MOD 2017, Volterra, Italy

This is the latest version of this item.

Full text not available from this repository. (Request a copy)


Matrix factorization is a common task underlying several machine learning applications such as recommender systems, topic modeling, or compressed sensing. Given a large and possibly sparse matrix A, we seek two smaller matrices W and H such that their product is as close to A as possible. The objective is minimizing the sum of square errors in the approximation. Typically such problems involve hundreds of thousands of unknowns, so an optimizer must be exceptionally efficient. In this study, a new algorithm, Preconditioned Model Building is adapted to factorize matrices composed of movie ratings in the MovieLens data sets with 1, 10, and 20 million entries. We present experiments that compare the sequential MATLAB implementation of the PMB algorithm with other algorithms in the minFunc package. We also employ a lock-free sparse matrix factorization algorithm and provide a scalable shared-memory parallel implementation. We show that (a) the optimization performance of the PMB algorithm is comparable to the best algorithms in common use, and (b) the computational performance can be significantly increased with parallelization.
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: Matrix factorization; Multicore parallelism; Preconditioned model building
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Kamer Kaya
Date Deposited: 22 May 2023 11:54
Last Modified: 22 May 2023 11:54

Available Versions of this Item

Actions (login required)

View Item
View Item