12 citations · 28 across the 11 of their papers we have counts for
5 papers · 1 filter
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…
Fair quantile regression
Dana Yang, John Lafferty, David Pollard
Quantile regression is a tool for learning conditional distributions. In this paper we study quantile regression in the setting where a protected attribute is unavailable when fitt…
The cost-free nature of optimally tuning Tikhonov regularizers and other ordered smoothers
Pierre C Bellec, Dana Yang
We consider the problem of selecting the best estimator among a family of Tikhonov regularized estimators, or, alternatively, to select a linear combination of these regularizers t…