1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
cs.LG2023
SQ Lower Bounds for Random Sparse Planted Vector Problem
Jingqiu Ding, Yiding Hua
Consider the setting where a -sparse Rademacher vector is planted in a random -dimensional subspace of . A classical question is how to recover this planted vector given…