DeepAI AI Chat
Log In Sign Up

Discrete minimax estimation with trees

12/14/2018
by   Luc Devroye, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/29/2019

Nonparametric estimation of jump rates for a specific class of Piecewise Deterministic Markov Processes

In this paper, we consider a piecewise deterministic Markov process (PDM...
02/27/2019

Optimal estimation of variance in nonparametric regression with random design

Consider the heteroscedastic nonparametric regression model with random ...
01/12/2018

Minimax Optimal Additive Functional Estimation with Discrete Distribution: Slow Divergence Speed Case

This paper addresses an estimation problem of an additive functional of ...
05/06/2020

Dependence structure estimation using Copula Recursive Trees

We construct the Copula Recursive Tree (CORT) estimator: a flexible, con...
06/24/2022

Error estimates for fractional semilinear optimal control on Lipschitz polytopes

We adopt the integral definition of the fractional Laplace operator and ...
04/16/2021

Estimation of the Global Mode of a Density: Minimaxity, Adaptation, and Computational Complexity

We consider the estimation of the global mode of a density under some de...
12/17/2012

Co-clustering separately exchangeable network data

This article establishes the performance of stochastic blockmodels in ad...