Distributed matrix completion and robust factorization

MaRDI QIDQ5502138zbMATH OpenFDO

Authors Lester Mackey, Ameet Talwalkar, Michael Jordan

Publication date 17 August 2015

Full work available at URL https://arxiv.org/abs/1107.0789, http://jmlr.csail.mit.edu/papers/v16/mackey15a.html

zbMATH Keywords

matrix factorizationmatrix completionrandomized algorithmsdistributed algorithmscollaborative filteringparallel algorithmsdivide-and-conquervideo surveillancerobust matrix factorization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Factorization of matrices (15A23) Randomized algorithms (68W20) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Abstract: If learning methods are to scale to the massive sizes of modern datasets, it is essential for the field of machine learning to embrace parallel and distributed computing. Inspired by the recent development of matrix factorization methods with rich theory but poor computational complexity and by the relative ease of mapping matrices onto distributed architectures, we introduce a scalable divide-and-conquer framework for noisy matrix factorization. We present a thorough theoretical analysis of this framework in which we characterize the statistical errors introduced by the "divide" step and control their magnitude in the "conquer" step, so that the overall algorithm enjoys high-probability estimation guarantees comparable to those of its base algorithm. We also present experiments in collaborative filtering and video background modeling that demonstrate the near-linear to superlinear speed-ups attainable with this approach.

Recommendations

• Parallel stochastic gradient algorithms for large-scale matrix completion
• Distributed Bayesian matrix factorization with limited communication
• Matrix completion and low-rank SVD via fast alternating least squares
• Spectral regularization algorithms for learning large incomplete matrices
• Online learning for matrix factorization and sparse coding

Cited in

(19)

• Distributed Bayesian matrix factorization with limited communication
• Decentralized Gradient-Quantization Based Matrix Factorization for Fast Privacy-Preserving Point-of-Interest Recommendation
• Distributed Orthogonal Factorization: Givens and Householder Algorithms
• scientific article; zbMATH DE number 7164697 (Why is no real title available?)
• A distributed Frank-Wolfe framework for learning low-rank matrices with the trace norm
• Parallelizing spectrally regularized kernel algorithms
• Communication-efficient distributed \(M\)-estimation with missing data
• Communication-efficient distributed statistical inference
• Meta Clustering for Collaborative Learning
• scientific article; zbMATH DE number 7307470 (Why is no real title available?)
• A MOM-based ensemble method for robustness, subsampling and hyperparameter tuning
• Distributed Robust Subspace Recovery
• LIBMF: a library for parallel matrix factorization in shared-memory systems
• CEDAR: Communication Efficient Distributed Analysis for Regressions
• Robust PCA by manifold optimization
• scientific article; zbMATH DE number 7626717 (Why is no real title available?)
• Partitioned Approach for High-dimensional Confidence Intervals with Large Split Sizes
• A distributed and integrated method of moments for high-dimensional correlated data analysis
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset

Describes a project that uses

Uses Software

• HOGWILD
• Jellyfish

This page was built for publication: Distributed matrix completion and robust factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502138)