1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2019★ 1 cited
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…
math.ST2019★ 1 cited
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…
math.ST2014
Remarks on Kneip's linear smoothers
Sören R. Künzel, David Pollard, Dana Yang
We were trying to understand the analysis provided by Kneip (1994, Ordered Linear Smoothers). In particular we wanted to persuade ourselves that his results imply the oracle inequa…