activity
20222026
most citedPrivate Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust

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

collaborators
Showing 2024Show all

3 papers · 1 filter

cs.DS2024

Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares

Hongjie Chen, Deepak Narayanan Sridharan, David Steurer

We revisit the problem of estimating the mean of a high-dimensional distribution in the presence of an -fraction of adversarial outliers. When is at most…

cs.DS2024★ 1 cited

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust

Hongjie Chen, Jingqiu Ding, Yiding Hua +1

We give the first polynomial-time, differentially node-private, and robust algorithm for estimating the edge density of Erdős-Rényi random graphs and their generalization, inhomoge…

cs.DS2024

Private graphon estimation via sum-of-squares

Hongjie Chen, Jingqiu Ding, Tommaso d'Orsi +3

We develop the first pure node-differentially-private algorithms for learning stochastic block models and for graphon estimation with polynomial running time for any constant numbe…