Flavio Chierichetti

activity

20172020

ℓ_{p}

Low Rank Approximation

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

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2020

On Additive Approximate Submodularity

Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar

A real-valued set function is (additively) approximately submodular if it satisfies the submodularity conditions with an additive error. Approximate submodularity arises in many se…

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 Additive Approximate Submodularity

On the Complexity of Sampling Nodes Uniformly from a Graph

Algorithms for ℓp​ Low Rank Approximation

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