Distributed Asynchronous Matrix Completion Simulator.
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
dist
src
LICENSE
README.md

README.md

GASGD

Distributed Asynchronous Matrix Completion Simulator

A multithread simulator for Distributed Asynchronous Matrix Completion. Based on the publication:

  • 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.

If you use the application please cite the paper.

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.

To run the project from the command line, go to the dist folder and type the following:

java -Xmx§GB -jar GASGD.jar inputfile nmachines [options]

Parameters:

  • §: number of GB for the java virtual machine
  • inputfile: the name of the file that stores the <user,item,rating> triples.
  • nmachines: the number of machines for the simulated cluster. Maximum value 256.

Options:

  • -separator string -> specifies the separator between user, item and rating in the input file . Default '\t'.
  • -partitioning_algorithm string -> specifies the algorithm to be used by the input partitioner procedure (hdrf greedy hashing grid pds). Default greedy.
  • -frequency integer -> specifies how many times the machines comunicate during each epoch. Default 1.
  • -partitioned string -> specifies if the greedy algorithm is bipartite aware, partitioning 'user' or 'item' respectively. Default null.
  • -output_dir string -> specifies the name of the directory where the output files will be stored.
  • -iterations integer -> specifies how many iterations to be performed by the sgd algorithm. Default 30.
  • -lambda double -> specifies the regularization parameter for the sgd algorithm. Default 0.05.
  • -learning_rate double -> specifies the learning rate for the sgd algorithm. Default 0.01.
  • -rank integer -> specifies the number of latent features for the low rank approximation. Default 50.