deposit_your_work

Multiscale Density Estimation

Files in this item

Files Size Format View
Wil2003Aug9Multiscal.PDF 1.018Mb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Multiscale Density Estimation
Author: Willett, Rebecca; Nowak, Robert David
Type: Tech Report
Keywords: Nonparametric estimation; wavelets; minimax risk
Citation: R. Willett and R. D. Nowak, "Multiscale Density Estimation," Rice University ECE Technical Report, 2003.
Abstract: The nonparametric density estimation method proposed in this paper is computationally fast, capable of detecting density discontinuities and singularities at a very high resolution, spatially adaptive, and offers near minimax convergence rates for broad classes of densities including Besov spaces. At the heart of this new method lie multiscale signal decompositions based on piecewise-polynomial functions and penalized likelihood estimation. Upper bounds on the estimation error are derived using an information-theoretic risk bound based on squared Hellinger loss. The method and theory share many of the desirable features associated with wavelet-based density estimators, but also offers several advantages including guaranteed non-negativity, bounds on the L1 error, small-sample quantification of the estimation errors, and additional flexibility and adaptability. In particular, the method proposed here can adapt the degrees as well as the locations of the polynomial pieces. For a certain class of densities, the error of the variable degree estimator converges at nearly the parametric rate. Experimental results demonstrate the advantages of the new approach compared to traditional density estimators and wavelet-based estimators.
Date Published: 2003-08-20

This item appears in the following Collection(s)

  • ECE Publications [1043 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students
  • DSP Publications [508 items]
    Publications by Rice Faculty and graduate students in digital signal processing.