Editing Open Problems:34

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 1: Line 1:
βˆ’
{{Header
+
{{DISPLAYTITLE:Problem 34: Linear Algebra Computation}}
βˆ’
|source=kanpur09
+
{{Infobox
βˆ’
|who=Michael Mahoney
+
|label1 = Proposed by
 +
|data1 = Michael Mahoney
 +
|label2 = Source
 +
|data2 = [[Workshops:Kanpur_2009|Kanpur 2009]]
 +
|label3 = Short link
 +
|data3 = http://sublinear.info/34
 
}}
 
}}
 
It is often not the case that the entire data sits on a single machine and that we are allowed to make one or more passes over it. Instead the data is often distributed across multiple systems. This is one of the reasons why the streaming model does not have more impact in practice for linear algebra computation. It would be great to design new models that address this shortcoming.
 
It is often not the case that the entire data sits on a single machine and that we are allowed to make one or more passes over it. Instead the data is often distributed across multiple systems. This is one of the reasons why the streaming model does not have more impact in practice for linear algebra computation. It would be great to design new models that address this shortcoming.
  
 
Consider also the following problem. Let $A$ be an $m\times n$ matrix and let $k$ be a rank parameter. Let $P_{A,k}$ be the projection matrix on the best rank-$k$ left (or right) singular subspace. The goal is to compute the diagonal of $P_{A,k}$ exactly or approximately in a small number of passes in the streaming model, or even better, in a new model that addresses the aforementioned shortcoming.
 
Consider also the following problem. Let $A$ be an $m\times n$ matrix and let $k$ be a rank parameter. Let $P_{A,k}$ be the projection matrix on the best rank-$k$ left (or right) singular subspace. The goal is to compute the diagonal of $P_{A,k}$ exactly or approximately in a small number of passes in the streaming model, or even better, in a new model that addresses the aforementioned shortcoming.

Please note that all contributions to Open Problems in Sublinear Algorithms may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see Open Problems in Sublinear Algorithms:Copyrights for details). Do not submit copyrighted work without permission!

To edit this page, please answer the question that appears below (more info):

Cancel Editing help (opens in new window)