Discrete minimax estimation with trees

12/14/2018

∙

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

Discrete minimax estimation with trees

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

Optimal estimation of variance in nonparametric regression with random design

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

Dependence structure estimation using Copula Recursive Trees

Error estimates for fractional semilinear optimal control on Lipschitz polytopes

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

Co-clustering separately exchangeable network data

Discrete minimax estimation with trees

Related Research

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

Optimal estimation of variance in nonparametric regression with random design

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

Dependence structure estimation using Copula Recursive Trees

Error estimates for fractional semilinear optimal control on Lipschitz polytopes

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

Co-clustering separately exchangeable network data