3 papers
math.ST2018
Discrete minimax estimation with trees
Luc Devroye, Tommy Reddad
We propose a simple recursive data-based partitioning scheme which produces piecewise-constant or piecewise-linear density estimates on intervals, and show how this scheme can dete…
math.ST2018
On the discovery of the seed in uniform attachment trees
Luc Devroye, Tommy Reddad
We investigate the size of vertex confidence sets for including part of (or the entirety of) the seed in seeded uniform attachment trees, given knowledge of some of the seed's prop…
math.ST2018
The Minimax Learning Rates of Normal and Ising Undirected Graphical Models
Luc Devroye, Abbas Mehrabian, Tommy Reddad
Let be an undirected graph with edges and vertices. We show that -dimensional Ising models on can be learned from i.i.d. samples within expected total variat…