# Discrete minimax estimation with trees

arXiv: https://arxiv.org/abs/1812.06063 · HTML: https://mlsanity.com/paper/1812.06063/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Dec 2018.

## Built on by (most cited first, 1 of 1)

- [Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditing](https://mlsanity.com/paper/2503.07775/) (2025)

## Abstract (arXiv)

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 determine the optimal L1 minimax rate for some discrete nonparametric classes.