222 citations · 591 across the 74 of their papers we have counts for
8 papers · 1 filter
Strong data processing constant is achieved by binary inputs
Or Ordentlich, Yury Polyanskiy
For any channel the strong data processing constant is defined as the smallest number such that holds for any Markov chain $U-X…
Broadcasting on Two-Dimensional Regular Grids
Anuran Makur, Elchanan Mossel, Yury Polyanskiy
We study a specialization of the problem of broadcasting on directed acyclic graphs, namely, broadcasting on 2D regular grids. Consider a 2D regular grid with source vertex at…
Self-regularizing Property of Nonparametric Maximum Likelihood Estimator in Mixture Models
Yury Polyanskiy, Yihong Wu
Introduced by Kiefer and Wolfowitz \cite{KW56}, the nonparametric maximum likelihood estimator (NPMLE) is a widely used methodology for learning mixture odels and empirical Bayes e…
Note on approximating the Laplace transform of a Gaussian on a complex disk
Yury Polyanskiy, Yihong Wu
In this short note we study how well a Gaussian distribution can be approximated by distributions supported on . Perhaps, the natural conjecture is that for large the a…
Extrapolating the profile of a finite population
Soham Jana, Yury Polyanskiy, Yihong Wu
We study a prototypical problem in empirical Bayes. Namely, consider a population consisting of individuals each belonging to one of types (some types can be empty). Withou…
Broadcasting on trees near criticality
Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy
We revisit the problem of broadcasting on -ary trees: starting from a Bernoulli random variable at a root vertex, each vertex forwards its value across binary symme…