mlsanityData to 14 Oct 2026

Discrete minimax estimation with trees

arXiv 1812.06063 ↗First posted 14 Dec 2018math.ST cs.LG stat.THcited by 1

Not on the map. Why?

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.

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

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.

  1. 2025Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditingcited by 0