Flavio Chierichetti

most citedAlgorithms for

ℓ_{p}

Low Rank Approximation

5 citations · 5 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2017

On the Complexity of Sampling Nodes Uniformly from a Graph

Flavio Chierichetti, Shahrzad Haddadan

We study a number of graph exploration problems in the following natural scenario: an algorithm starts exploring an undirected graph from some seed node; the algorithm, for an arbi…

cs.DS2017★ 5 cited

Algorithms for $ℓ_{p}$ Low Rank Approximation

Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar +3

We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise $ℓ_{p}$ -approximation error, for any $p \geq 1$ ; the case $p = 2$ is t…

On the Complexity of Sampling Nodes Uniformly from a Graph

Algorithms for ℓp​ Low Rank Approximation

Algorithms for $ℓ_{p}$ Low Rank Approximation