• Corpus ID: 239016497

Quantile Regression by Dyadic CART

  title={Quantile Regression by Dyadic CART},
  author={Oscar Hernan Madrid Padilla and Sabyasachi Chatterjee},
In this paper we propose and study a version of the Dyadic Classification and Regression Trees (DCART) estimator from Donoho (1997) for (fixed design) quantile regression in general dimensions. We refer to this proposed estimator as the QDCART estimator. Just like the mean regression version, we show that a) a fast dynamic programming based algorithm with computational complexity O(N logN) exists for computing the QDCART estimator and b) an oracle risk bound (trading off squared error and a… 

Figures and Tables from this paper

A Cross Validation Framework for Signal Denoising with Applications to Trend Filtering, Dyadic CART and Beyond
This paper formulates a general cross validation framework for signal denoising. The general framework is then applied to nonparametric regression methods such as Trend Filtering and Dyadic CART. The


Quantile regression with ReLU Networks: Estimators and minimax rates
Quantile regression is the task of estimating a specified percentile response, such as the median, from a collection of known covariates. We study quantile regression with rectified linear unit
Robust nonparametric estimation via wavelet median regression
In this paper we develop a nonparametric regression method that is simultaneously adaptive over a wide range of function classes for the regression function and robust over a large collection of
Multiscale Quantile Segmentation
Simulations and data examples from genetic sequencing and ion channel recordings confirm the robustness of the proposed procedure, which at the same hand reliably detects changes in quantiles from arbitrary distributions with precise statistical guarantees.
Adaptive risk bounds in univariate total variation denoising and trend filtering
We study trend filtering, a relatively recent method for univariate nonparametric regression. For a given positive integer $r$, the $r$-th order trend filtering estimator is defined as the minimizer
Lattice partition recovery with dyadic CART
It is proved that, under appropriate regularity conditions on the shape of the partition elements, a DCART-based procedure consistently estimates the underlying partition at a rate of order σ2k∗ log(N)/κ, where k∗ is the minimal number of rectangular sub-graphs obtained using recursive dyadic partitions supporting the signal partition, σ is the noise variance.
Adaptive piecewise polynomial estimation via trend filtering
We study trend filtering, a recently proposed tool of Kim et al. [SIAM Rev. 51 (2009) 339-360] for nonparametric regression. The trend filtering estimate is defined as the minimizer of a penalized
Total Variation Classes Beyond 1d: Minimax Rates, and the Limitations of Linear Smoothers
It is proved that these estimators, and more broadly all estimators given by linear transformations of the input data, are suboptimal over the class of functions with bounded variation, which means that the computationally simpler methods cannot be used for such sophisticated denoising tasks, without sacrificing statistical accuracy.
Minimax-optimal classification with dyadic decision trees
  • C. Scott, R. Nowak
  • Mathematics, Computer Science
    IEEE Transactions on Information Theory
  • 2006
It is shown that a new family of decision trees, dyadic decision trees (DDTs), attain nearly optimal rates of convergence for a broad range of classification problems.
Multiscale Poisson Intensity and Density Estimation
  • R. Willett, R. Nowak
  • Mathematics, Computer Science
    IEEE Transactions on Information Theory
  • 2007
Nonparametric Poisson intensity and density estimation methods studied in this paper offer near minimax convergence rates for broad classes of densities and intensities with arbitrary levels of smoothness and it is demonstrated that platelet-based estimators in two dimensions exhibit similar near-optimal error convergence rates.