arXiv 0802.21862008-02math.STstat.TH

Weak convergence of the supremum distance for supersmooth kernel deconvolution

Bert van Es, Shota Gugushvili

备注：: 12 pages
发表信息：: Statist. Probab. Lett. 78 (2008), no. 17, 2932-2938
DOI：: 10.1016/j.spl.2008.05.002

英文摘要：

We derive the asymptotic distribution of the supremum distance of the deconvolution kernel density estimator to its expectation for certain supersmooth deconvolution problems. It turns out that the asymptotics are essentially different from the corresponding results for ordinary smooth deconvolution.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Minimax rates of convergence for Wasserstein deconvolution with supersmooth errors in any dimension

The subject of this paper is the estimation of a probability measure on ${\mathbb R}^d$ from data observed with an additive noise, under the Wasserstein metric of order $p$ (with $p\geq 1$). We assume that the distribution of the errors is known and belongs to a class of supersmooth distributions, and we give optimal rates of convergence for the Wasserstein metric of order $p$. In particular, we show how to use the existing lower bounds for the estimation of the cumulative distribution function in dimension one to find lower bounds for the Wasserstein deconvolution in any dimension.

2013-07-18math.STstat.TH

Adaptive Posterior Convergence Rates in Bayesian Density Deconvolution with Supersmooth Errors

Bayesian density deconvolution using nonparametric prior distributions is a useful alternative to the frequentist kernel based deconvolution estimators due to its potentially wide range of applicability, straightforward uncertainty quantification and generalizability to more sophisticated models. This article is the first substantive effort to theoretically quantify the behavior of the posterior in this recent line of research. In particular, assuming a known supersmooth error density, a Dirichlet process mixture of Normals on the true density leads to a posterior convergence rate same as the …

2013-09-09math.STstat.TH

Nonparametric deconvolution problem for dependent sequences

We consider the nonparametric estimation of the density function of weakly and strongly dependent processes with noisy observations. We show that in the ordinary smooth case the optimal bandwidth choice can be influenced by long range dependence, as opposite to the standard case, when no noise is present. In particular, if the dependence is moderate the bandwidth, the rates of mean-square convergence and, additionally, central limit theorem are the same as in the i.i.d. case. If the dependence is strong enough, then the bandwidth choice is influenced by the strength of dependence, which is dif…

2008-08-13math.STstat.TH

Some thoughts on the asymptotics of the deconvolution kernel density estimator

Via a simulation study we compare the finite sample performance of the deconvolution kernel density estimator in the supersmooth deconvolution problem to its asymptotic behaviour predicted by two asymptotic normality theorems. Our results indicate that for lower noise levels and moderate sample sizes the match between the asymptotic theory and the finite sample performance of the estimator is not satisfactory. On the other hand we show that the two approaches produce reasonably close results for higher noise levels. These observations in turn provide additional motivation for the study of deco…

2008-01-17stat.ME

Improved rates for Wasserstein deconvolution with ordinary smooth error in dimension one

This paper deals with the estimation of a probability measure on the real line from data observed with an additive noise. We are interested in rates of convergence for the Wasserstein metric of order $p\geq 1$. The distribution of the errors is assumed to be known and to belong to a class of supersmooth or ordinary smooth distributions. We obtain in the univariate situation an improved upper bound in the ordinary smooth case and less restrictive conditions for the existing bound in the supersmooth one. In the ordinary smooth case, a lower bound is also provided, and numerical experiments illus…

2015-03-04math.STstat.TH

Rates of convergence for nonparametric deconvolution

This Note presents original rates of convergence for the deconvolution problem. We assume that both the estimated density and noise density are supersmooth and we compute the risk for two kinds of estimators.

2006-11-22math.STstat.TH

更多相关论文收起更多论文

Global uniform risk bounds for wavelet deconvolution estimators

We consider the statistical deconvolution problem where one observes $n$ replications from the model $Y=X+ε$, where $X$ is the unobserved random signal of interest and $ε$ is an independent random error with distribution $ϕ$. Under weak assumptions on the decay of the Fourier transform of $ϕ,$ we derive upper bounds for the finite-sample sup-norm risk of wavelet deconvolution density estimators $f_n$ for the density $f$ of $X$, where $f:\mathbb{R}\to \mathbb{R}$ is assumed to be bounded. We then derive lower bounds for the minimax sup-norm risk over Besov balls in this estimation problem and s…

2011-03-08math.STstat.TH

Deconvolution with unknown error distribution

We consider the problem of estimating a density $f_X$ using a sample $Y_1,...,Y_n$ from $f_Y=f_X\star f_ε$, where $f_ε$ is an unknown density. We assume that an additional sample $ε_1,...,ε_m$ from $f_ε$ is observed. Estimators of $f_X$ and its derivatives are constructed by using nonparametric estimators of $f_Y$ and $f_ε$ and by applying a spectral cut-off in the Fourier domain. We derive the rate of convergence of the estimators in case of a known and unknown error density $f_ε$, where it is assumed that $f_X$ satisfies a polynomial, logarithmic or general source condition. It is shown that…

2009-08-21math.STstat.TH