Search Results for author:
Found 3 papers, 0 papers with code
Private graphon estimation via sum-of-squares
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 number of blocks.
Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions
We study robust community detection in the context of node-corrupted stochastic block model, where an adversary can arbitrarily modify all the edges incident to a fraction of the $n$ vertices.
SQ Lower Bounds for Random Sparse Planted Vector Problem
A classical question is how to recover this planted vector given a random basis in this subspace.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
