research
∙
12/21/2022
Is it easier to count communities than find them?
Random graph models with community structure have been studied extensive...
share
research
∙
03/17/2021
The planted matching problem: Sharp threshold and infinite-order phase transition
We study the problem of reconstructing a perfect matching M^* hidden in ...
research
∙
02/23/2021
Learner-Private Online Convex Optimization
Online convex optimization is a framework where a learner sequentially q...
research
∙
11/18/2019
Consistent recovery threshold of hidden nearest neighbor graphs
Motivated by applications such as discovering strong ties in social netw...
research
∙
09/25/2019
Rapid mixing of a Markov chain for an exponentially weighted aggregation estimator
The Metropolis-Hastings method is often used to construct a Markov chain...
research
∙
09/21/2019
Optimal query complexity for private sequential learning
Motivated by privacy concerns in many practical applications such as Fed...
research
∙
07/19/2019
Fair quantile regression
Quantile regression is a tool for learning conditional distributions. In...
research
∙
05/29/2019
The cost-free nature of optimally tuning Tikhonov regularizers and other ordered smoothers
We consider the problem of selecting the best estimator among a family o...
research
∙
04/26/2018
Estimation of convex supports from noisy measurements
A popular class of problem in statistics deals with estimating the suppo...
research
∙
04/26/2017