12 citations · 28 across the 11 of their papers we have counts for
12 papers
Is it easier to count communities than find them?
Cynthia Rush, Fiona Skerman, Alexander S. Wein +1
Random graph models with community structure have been studied extensively in the literature. For both the problems of detecting and recovering community structure, an interesting…
The planted matching problem: Sharp threshold and infinite-order phase transition
Jian Ding, Yihong Wu, Jiaming Xu +1
We study the problem of reconstructing a perfect matching hidden in a randomly weighted bipartite graph. The edge set includes every node pair in and each o…
Learner-Private Convex Optimization
Jiaming Xu, Kuang Xu, Dana Yang
Convex optimization with feedback is a framework where a learner relies on iterative queries and feedback to arrive at the minimizer of a convex function. It has gained considerabl…
Consistent recovery threshold of hidden nearest neighbor graphs
Jian Ding, Yihong Wu, Jiaming Xu +1
Motivated by applications such as discovering strong ties in social networks and assembling genome subsequences in biology, we study the problem of recovering a hidden -nearest…
Rapid mixing of a Markov chain for an exponentially weighted aggregation estimator
David Pollard, Dana Yang
The Metropolis-Hastings method is often used to construct a Markov chain with a given as its stationary distribution. The method works even if is known only up to an intrac…
Optimal query complexity for private sequential learning against eavesdropping
Jiaming Xu, Kuang Xu, Dana Yang
We study the query complexity of a learner-private sequential learning problem, motivated by the privacy and security concerns due to eavesdropping that arise in practical applicat…