SVD and Higher Order Correlations for Distributed Data
published: July 15, 2014, recorded: June 2014, views: 2564
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
We consider algorithmic problems in the setting in which the input data has been partitioned arbitrarily on many servers. The goal is to compute a function of all the data, and the bottleneck is the communication used by the algorithm. We present algorithms for two illustrative problems on massive data sets: (1) computing a low-rank approximation of a matrix A=A1+A2+…+As, with matrix At stored on server t and (2) computing a function of a vector a1+a2+…+as, where server t has the vector at; this includes the well-studied special case of computing frequency moments and separable functions, as well as higher-order correlations such as the number of subgraphs of a specified type occurring in a graph. For both problems we give algorithms with nearly optimal communication, and in particular the only dependence on n, the size of the data, is in the number of bits needed to represent indices and words (O(logn)).
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !