CART and Best-Ortho-Basis: A Connection


We study what we call \Dyadic CART" { a method of nonparametric regression which constructs a recursive partition by optimizing a complexity-penalized sum of squares, where the optimization is over all recursive partitions arising from midpoint splits. We show that the method is adaptive to unknown degree of anisotropic smoothness. Speci cally, consider the… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

174 Citations

Semantic Scholar estimates that this publication has 174 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics