Discrete minimax estimation with trees

From MaRDI portal
Publication:2323936

DOI10.1214/19-EJS1586zbMATH Open1429.62126arXiv1812.06063MaRDI QIDQ2323936FDOQ2323936


Authors: Tommy Reddad, Luc Devroye Edit this on Wikidata


Publication date: 13 September 2019

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/1812.06063




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Discrete minimax estimation with trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2323936)