activity
20182021
most citedThe cost-free nature of optimally tuning Tikhonov regularizers and other ordered smoothers

3 citations · 9 across the 5 of their papers we have counts for

collaborators
Showing math.STShow all

5 papers · 1 filter

math.ST20213 cited

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…

math.ST20191 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.ST20191 cited

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…

math.ST20193 cited

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…

math.ST2018

Estimation of convex supports from noisy measurements

Victor-Emmanuel Brunel, Jason M. Klusowski, Dana Yang

A popular class of problem in statistics deals with estimating the support of a density from observations drawn at random from a -dimensional distribution. The one-dimension…