# Discrete minimax estimation with trees

**Authors:** Luc Devroye, Tommy Reddad

arXiv: 1812.06063 · 2019-07-01

## TL;DR

This paper introduces a recursive partitioning method for density estimation that achieves optimal $L_1$ minimax rates for certain discrete nonparametric classes, enhancing nonparametric density estimation techniques.

## Contribution

The paper presents a novel recursive partitioning scheme that effectively estimates densities and attains optimal minimax rates in discrete settings.

## Key findings

- Achieves optimal $L_1$ minimax rates for specific classes.
- Provides a simple, recursive data-based partitioning approach.
- Demonstrates effectiveness in discrete nonparametric density estimation.

## Abstract

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 $L_1$ minimax rate for some discrete nonparametric classes.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1812.06063/full.md

## Figures

4 figures with captions in the complete paper: https://tomesphere.com/paper/1812.06063/full.md

## References

35 references — full list in the complete paper: https://tomesphere.com/paper/1812.06063/full.md

---
Source: https://tomesphere.com/paper/1812.06063