Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
F. Petroni and L. Querzoni:
"GASGD: Stochastic Gradient Descent for Distributed Asynchronous Matrix Completion via Graph Partitioning."
In: Proceedings of the 8th ACM Conference on Recommender Systems (RecSys), 2014.
Abstract: "Matrix completion latent factors models are known to be an effective method to build recommender systems. Currently,
stochastic gradient descent (SGD) is considered one of the best latent factor-based algorithm for matrix completion. In this paper we discuss GASGD, a distributed asynchronous variant of SGD for large-scale matrix completion, that (i) leverages data partitioning schemes based on graph partitioning techniques, (ii) exploits specific characteristics of the input data and (iii) introduces an explicit parameter to tune synchronization frequency among the computing nodes. We empirically show how, thanks to these features, GASGD achieves a fast convergence rate incurring in smaller communication cost with respect to current asynchronous distributed SGD implementations."
F. Petroni and L. Querzoni: "GASGD: Stochastic Gradient Descent for Distributed Asynchronous Matrix Completion via Graph Partitioning." In: Proceedings of the 8th ACM Conference on Recommender Systems (RecSys), 2014. Abstract: "Matrix completion latent factors models are known to be an effective method to build recommender systems. Currently, stochastic gradient descent (SGD) is considered one of the best latent factor-based algorithm for matrix completion. In this paper we discuss GASGD, a distributed asynchronous variant of SGD for large-scale matrix completion, that (i) leverages data partitioning schemes based on graph partitioning techniques, (ii) exploits specific characteristics of the input data and (iii) introduces an explicit parameter to tune synchronization frequency among the computing nodes. We empirically show how, thanks to these features, GASGD achieves a fast convergence rate incurring in smaller communication cost with respect to current asynchronous distributed SGD implementations."
Total views
956
On Slideshare
0
From embeds
0
Number of embeds
434
Downloads
14
Shares
0
Comments
0
Likes
1
The SlideShare family just got bigger. You now have unlimited* access to books, audiobooks, magazines, and more from Scribd.
Cancel anytime.Join the community of over 1 million readers
Join the community of over 1 million readers
Sign up for a Scribd 60 day free trial to download this document plus get access to the world’s largest digital library.
Cancel anytime.
Be the first to comment