Jelani Nelson

most citedPrivate Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

cs.DS2024

Space Complexity of Minimum Cut Problems in Single-Pass Streams

Matthew Ding, Alexandro Garces, Jason Li +4

We consider the problem of finding a minimum cut of a weighted graph presented as a single-pass stream. While graph sparsification in streams has been intensively studied, the spec…

cs.DS2024★ 1 cited

Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages

Hilal Asi, Vitaly Feldman, Jelani Nelson +3

We study the problem of private vector mean estimation in the shuffle model of privacy where $n$ users each have a unit vector $v^{(i)} \in R^{d}$ . We propose a new multi-mes…