Claire Lacour
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We derive asymptotic normality of kernel type deconvolution density estimators. In particular we consider deconvolution problems where the known component of the convolution has a symmetric lambda-stable distribution, 0<lambda<= 2. It turns out that the limit behavior changes if the exponent parameter lambda passes the value one, the case of Cauchy deconvolution.
Partial heteroscedastic deconvolution estimation in nonparametric regression
本文提出了一种非参数回归中处理部分异方差测量误差的核估计方法，证明其在合适条件下具有最优收敛速率，并通过模拟验证了其有效性。
Polynomial rates via deconvolution for nonparametric estimation in McKean-Vlasov SDEs
针对McKean-Vlasov随机微分方程的交互函数估计，本文提出基于反卷积的方法，在交互函数尾部指数衰减假设下实现多项式收敛速率，并通过不变密度复变换分析提供理论支撑。
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…
Nonparametric Estimation in Uniform Deconvolution and Interval Censoring
本文研究均匀去卷积中非参数最大似然估计的渐近行为，揭示 $F_0(1)=1$ 与 $F_0(1)<1$ 的二分法，并通过理论分析与模拟对后者提出并筛选竞争性猜想。
Deconvolution in unlinked linear models
本文研究了在未链接线性回归框架下非参数反卷积问题，提出了一种在Wasserstein距离下达到参数收敛速率的非参数估计器，且噪声平滑度不影响收敛速度。
Fiducial inference, as generalized by Hannig et al. (2016), is applied to nonparametric g-modeling (Efron, 2016) in the discrete case. We propose a computationally efficient algorithm to sample from the fiducial distribution, and use the generated samples to construct point estimates and confidence intervals. We study the theoretical properties of the fiducial distribution and perform extensive simulations in various scenarios. The proposed approach yields good statistical performance in terms of the mean squared error of point estimators and the coverage of confidence intervals. Furthermore, …
We consider a continuous-time stochastic volatility model. The model contains a stationary volatility process, the multivariate density of the finite dimensional distributions of which we aim to estimate. We assume that we observe the process at discrete instants in time. The sampling times will be equidistant with vanishing distance. A multivariate Fourier-type deconvolution kernel density estimator based on the logarithm of the squared processes is proposed to estimate the multivariate volatility density. An expansion of the bias and a bound on the variance are derived. Key words: stochastic…
Stochastic volatility modelling of financial processes has become increasingly popular. The proposed models usually contain a stationary volatility process. We will motivate and review several nonparametric methods for estimation of the density of the volatility process. Both models based on discretely sampled continuous time processes and discrete time models will be discussed. The key insight for the analysis is a transformation of the volatility density estimation problem to a deconvolution model for which standard methods exist. Three type of nonparametric density estimators are reviewed: …
We study nonparametric Bayesian inference with location mixtures of the Laplace density and a Dirichlet process prior on the mixing distribution. We derive a contraction rate of the corresponding posterior distribution, both for the mixing distribution relative to the Wasserstein metric and for the mixed density relative to the Hellinger and $L_q$ metrics.
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.
We identify the average dose-response function (ADRF) for a continuously valued error-contaminated treatment by a weighted conditional expectation. We then estimate the weights nonparametrically by maximising a local generalised empirical likelihood subject to an expanding set of conditional moment equations incorporated into the deconvolution kernels. Thereafter, we construct a deconvolution kernel estimator of ADRF. We derive the asymptotic bias and variance of our ADRF estimator and provide its asymptotic linear expansion, which helps conduct statistical inference. To select our smoothing p…
We consider discrete time models for asset prices with a stationary volatility process. We aim at estimating the multivariate density of this process at a set of consecutive time instants. A Fourier type deconvolution kernel density estimator based on the logarithm of the squared process is proposed to estimate the volatility density. Expansions of the bias and bounds on the variance are derived.
Let $X$ and $Y$ be two independent identically distributed random variables with density $p(x)$ and $Z=αX+βY$ for some constants $α>0$ and $β>0$. We consider the problem of estimating $p(x)$ by means of the samples from the distribution of $Z$. Non-parametric estimator based on the sync kernel is constructed and asymptotic behaviour of the corresponding mean integrated square error is investigated.
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.
We show that there is an intimate connection between the theory of nonparametric (smoothed) maximum likelihood estimators for certain inverse problems and integral equations. This is illustrated by estimators for interval censoring and deconvolution problems. We also discuss the asymptotic efficiency of the MLE for smooth functionals in these models.
We derive estimators of the density of the event times of current status data. The estimators are derived for the situations where the distribution of the observation times is known and where this distribution is unknown. The density estimators are constructed from kernel estimators of the density of transformed current status data, which have a distribution similar to uniform deconvolution data. Expansions of the expectation and variance as well as asymptotic normality are derived. A reference density based bandwidth selection method is proposed. A simulated example is presented.
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 …
This article deals with adaptive nonparametric estimation for Lévy processes observed at low frequency. For general linear functionals of the Lévy measure, we construct kernel estimators, provide upper risk bounds and derive rates of convergence under regularity assumptions. Our focus lies on the adaptive choice of the bandwidth, using model selection techniques. We face here a non-standard problem of model selection with unknown variance. A new approach towards this problem is proposed, which also allows a straightforward generalization to a classical density deconvolution framework.
Vertex direction algorithms have been around for a few decades in the experimental design and mixture models literature. We briefly review this type of algorithm and describe a new member of the family: the support reduction algorithm. The support reduction algorithm is applied to the problem of computing nonparametric estimates in two inverse problems: convex density estimation and the Gaussian deconvolution problem. Usually, VD algorithms solve a finite dimensional (version of the) optimization problem of interest. We introduce a method to solve the true infinite dimensional optimization pro…
This paper concerns the nonparametric estimation problem of the distribution-state dependent drift vector field in an interacting $N$-particle system. Observing single-trajectory data for each particle, we derive the mean-field rate of convergence for the maximum likelihood estimator (MLE), which depends on both Gaussian complexity and Rademacher complexity of the function class. In particular, when the function class contains $α$-smooth H{ö}lder functions, our rate of convergence is minimax optimal on the order of $N^{-\fracα{d+2α}}$. Combining with a Fourier analytical deconvolution argument…
We consider linear inverse problems in a nonparametric statistical framework. Both the signal and the operator are unknown and subject to error measurements. We establish minimax rates of convergence under squared error loss when the operator admits a blockwise singular value decomposition (blockwise SVD) and the smoothness of the signal is measured in a Sobolev sense. We construct a nonlinear procedure adapting simultaneously to the unknown smoothness of both the signal and the operator and achieving the optimal rate of convergence to within logarithmic terms. When the noise level in the oper…
We consider a stochastic individual-based model in continuous time to describe a size-structured population for cell divisions. This model is motivated by the detection of cellular aging in biology. We address here the problem of nonparametric estimation of the kernel ruling the divisions based on the eigenvalue problem related to the asymptotic behavior in large population. This inverse problem involves a multiplicative deconvolution operator. Using Fourier technics we derive a nonparametric estimator whose consistency is studied. The main difficulty comes from the non-standard equations conn…
This paper provides a mathematical framework for estimation of the service time distribution and the expected service time of an infinite-server queueing system with a nonhomogeneous Poisson arrival process, in the case of partial information, where only the number of busy servers are observed over time. The problem is reduced to a statistical deconvolution problem, which is solved by using Laplace transform techniques and kernels for regularization. Upper bounds on the mean squared error of the proposed estimators are derived. Some concrete simulation experiments are performed to illustrate h…
The subject of this paper is the problem of nonparametric estimation of a continuous distribution function from observations with measurement errors. We study minimax complexity of this problem when unknown distribution has a density belonging to the Sobolev class, and the error density is ordinary smooth. We develop rate optimal estimators based on direct inversion of empirical characteristic function. We also derive minimax affine estimators of the distribution function which are given by an explicit convex optimization problem. Adaptive versions of these estimators are proposed, and some nu…
We consider two kinds of stochastic volatility models. Both kinds of models contain a stationary volatility process, the density of which, at a fixed instant in time, we aim to estimate. We discuss discrete time models where for instance a log price process is modeled as the product of a volatility process and i.i.d. noise. We also consider samples of certain continuous time diffusion processes. The sampled time instants will be be equidistant with vanishing distance. A Fourier type deconvolution kernel density estimator based on the logarithm of the squared processes is proposed to estimate t…
In this paper we consider a novel statistical inverse problem on the Poincaré, or Lobachevsky, upper (complex) half plane. Here the Riemannian structure is hyperbolic and a transitive group action comes from the space of $2\times2$ real matrices of determinant one via Möbius transformations. Our approach is based on a deconvolution technique which relies on the Helgason--Fourier calculus adapted to this hyperbolic space. This gives a minimax nonparametric density estimator of a hyperbolic density that is corrupted by a random Möbius transform. A motivation for this work comes from the reconstr…
This paper is concerned with nonparametric estimation of the Lévy density of a pure jump Lévy process. The sample path is observed at $n$ discrete instants with fixed sampling interval. We construct a collection of estimators obtained by deconvolution methods and deduced from appropriate estimators of the characteristic function and its first derivative. We obtain a bound for the ${\mathbb L}^2$-risk, under general assumptions on the model. Then we propose a penalty function that allows to build an adaptive estimator. The risk bound for the adaptive estimator is obtained under additional assum…
In the present paper we consider Laplace deconvolution for discrete noisy data observed on the interval whose length may increase with a sample size. Although this problem arises in a variety of applications, to the best of our knowledge, it has been given very little attention by the statistical community. Our objective is to fill this gap and provide statistical treatment of Laplace deconvolution problem with noisy discrete data. The main contribution of the paper is explicit construction of an asymptotically rate-optimal (in the minimax sense) Laplace deconvolution estimator which is adapti…
We construct an adaptive wavelet estimator that attains minimax near-optimal rates in a wide range of Besov balls. The convergence rates are affected only by the weakest dependence amongst the channels, and take into account both noise sources.
We look into the minimax results for the anisotropic two-dimensional functional deconvolution model with the two-parameter fractional Gaussian noise. We derive the lower bounds for the $L^p$-risk, $1 \leq p < \infty$, and taking advantage of the Riesz poly-potential, we apply a wavelet-vaguelette expansion to de-correlate the anisotropic fractional Gaussian noise. We construct an adaptive wavelet hard-thresholding estimator that attains asymptotically quasi-optimal convergence rates in a wide range of Besov balls. Such convergence rates depend on a delicate balance between the parameters of th…
In the present paper we consider the problem of estimating a periodic $(r+1)$-dimensional function $f$ based on observations from its noisy convolution. We construct a wavelet estimator of $f$, derive minimax lower bounds for the $L^2$-risk when $f$ belongs to a Besov ball of mixed smoothness and demonstrate that the wavelet estimator is adaptive and asymptotically near-optimal within a logarithmic factor, in a wide range of Besov balls. We prove in particular that choosing this type of mixed smoothness leads to rates of convergence which are free of the "curse of dimensionality" and, hence, a…
Wasserstein convergence in Bayesian and frequentist deconvolution models
本文建立联系Wasserstein距离与观测密度$L^1$距离的改进反演不等式，并据此给出贝叶斯自适应后验收敛与频率核估计极小极大结果。
Let $X_1,..., X_n$ be i.i.d.\ copies of a random variable $X=Y+Z,$ where $ X_i=Y_i+Z_i,$ and $Y_i$ and $Z_i$ are independent and have the same distribution as $Y$ and $Z,$ respectively. Assume that the random variables $Y_i$'s are unobservable and that $Y=AV,$ where $A$ and $V$ are independent, $A$ has a Bernoulli distribution with probability of success equal to $1-p$ and $V$ has a distribution function $F$ with density $f.$ Let the random variable $Z$ have a known distribution with density $k.$ Based on a sample $X_1,...,X_n,$ we consider the problem of nonparametric estimation of the densit…
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…
Empirical Bayes Estimation and Inference via Smooth Nonparametric Maximum Likelihood
针对非参数最大似然估计的离散性和慢对数解卷积率，引入高斯平滑层，提出光滑NPMLE，实现多项式解卷积率、近参数去噪性能及后验一致估计，并构建最优边际覆盖集。
We consider the nonparametric estimation of a periodic function that is observed in additive Gaussian white noise after convolution with a ``boxcar,'' the indicator function of an interval. This is an idealized model for the problem of recovery of noisy signals and images observed with ``motion blur.'' If the length of the boxcar is rational, then certain frequencies are irretreviably lost in the periodic model. We consider the rate of convergence of estimators when the length of the boxcar is irrational, using classical results on approximation of irrationals by continued fractions. A basic q…
Using the asymptotical minimax framework, we examine convergence rates equivalency between a continuous functional deconvolution model and its real-life discrete counterpart over a wide range of Besov balls and for the $L^2$-risk. For this purpose, all possible models are divided into three groups. For the models in the first group, which we call uniform, the convergence rates in the discrete and the continuous models coincide no matter what the sampling scheme is chosen, and hence the replacement of the discrete model by its continuous counterpart is legitimate. For the models in the second g…
We study the reknown deconvolution problem of recovering a distribution function from independent replicates (signal) additively contaminated with random errors (noise), whose distribution is known. We investigate whether a Bayesian nonparametric approach for modelling the latent distribution of the signal can yield inferences with asymptotic frequentist validity under the $L^1$-Wasserstein metric. When the error density is ordinary smooth, we develop two inversion inequalities relating either the $L^1$ or the $L^1$-Wasserstein distance between two mixture densities (of the observations) to th…
Minimax rates of convergence for nonparametric location-scale models
本文在Hellinger可微性等温和条件下，证明非参数位置-尺度模型中回归函数估计的极小极大收敛速率由函数类的度量熵决定，并通过多种误差分布实例及低阶交互模型和多指标模型加以验证。
This paper considers the deconvolution problem in the case where the target signal is multidimensional and no information is known about the noise distribution. More precisely, no assumption is made on the noise distribution and no samples are available to estimate it: the deconvolution problem is solved based only on the corrupted signal observations. We establish the identifiability of the model up to translation when the signal has a Laplace transform with an exponential growth smaller than $2$ and when it can be decomposed into two dependent components. Then, we propose an estimator of the…
We study the asymptotic behavior of posterior distributions. We present general posterior convergence rate theorems, which extend several results on posterior convergence rates provided by Ghosal and Van der Vaart (2000), Shen and Wasserman (2001) and Walker, Lijor and Prunster (2007). Our main tools are the Hausdorff $α$-entropy introduced by Xing and Ranneby (2008) and a new notion of prior concentration, which is a slight improvement of the usual prior concentration provided by Ghosal and Van der Vaart (2000). We apply our results to several statistical models.
We investigate minimax results for the anisotropic functional deconvolution model when observations are affected by the presence of long-memory. Under specific conditions about the covariance matrices of the errors, we follow a standard procedure to construct an adaptive wavelet-based estimator that attains asymptotically near-optimal convergence rates. These rates depend on the parameter associated with the weakest long-range dependence, and deteriorate as the intensity of long-memory increases. This behavior suggests that the estimator adjusts to the best case scenario and that the weakest L…
We consider deconvolution from repeated observations with unknown error distribution. So far, this model has mostly been studied under the additional assumption that the errors are symmetric. We construct an estimator for the non-symmetric error case and study its theoretical properties and practical performance. It is interesting to note that we can improve substantially upon the rates of convergence which have so far been presented in the literature and, at the same time, dispose of most of the extremely restrictive assumptions which have been imposed so far.
We study the uniform convergence rate of the nonparametric maximum likelihood estimator (MLE) for the sub-distribution functions in the current status data with competing risks model. It is known that the MLE have $L^2$-norm convergence rate $O_P(n^{-1/3})$ in the absolutely continuous case, but there is no arguments for the same rate of uniform convergence. We specify conditions for the uniform convergence rate $O_P(n^{-1/3}\log^{1/3} n)$ of the MLE for the sub-distribution functions of competing risks on finite intervals. The obtained result refines known uniform convergence rate in the part…
Minimax Optimal rates of convergence in the shuffled regression, unlinked regression, and deconvolution under vanishing noise
本文研究消失噪声下的单调函数估计问题，推导了混洗回归、无链接回归的极小极大风险阶数关系及反卷积误差界，且未对链接函数加光滑性假设，填补了相关领域空白。
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…
Uniform convergence rates and automatic variable selection in nonparametric regression with functional and categorical covariates
本文研究了具有函数型和分类协变量的非参数预测方法的渐近性质，证明了一致收敛速度，并表明数据驱动的最小二乘交叉验证能自动移除不相关的噪声变量。
We survey classical kernel methods for providing nonparametric solutions to problems involving measurement error. In particular we outline kernel-based methodology in this setting, and discuss its basic properties. Then we point to close connections that exist between kernel methods and much newer approaches based on minimum contrast techniques. The connections are through use of the sinc kernel for kernel-based inference. This `infinite order' kernel is not often used explicitly for kernel-based deconvolution, although it has received attention in more conventional problems where measurement …
We consider nonparametric estimation of the mean and covariance functions for functional/longitudinal data. Strong uniform convergence rates are developed for estimators that are local-linear smoothers. Our results are obtained in a unified framework in which the number of observations within each curve/cluster can be of any rate relative to the sample size. We show that the convergence rates for the procedures depend on both the number of sample curves and the number of observations on each curve. For sparse functional data, these rates are equivalent to the optimal rates in nonparametric reg…
We consider nonparametric functional regression when both predictors and responses are functions. More specifically, we let $(X_1,Y_1),...,(X_n,Y_n)$ be random elements in $\mathcal{F}\times\mathcal{H}$ where $\mathcal{F}$ is a semi-metric space and $\mathcal{H}$ is a separable Hilbert space. Based on a recently introduced notion of weak dependence for functional data, we showed the almost sure convergence rates of both the Nadaraya-Watson estimator and the nearest neighbor estimator, in a unified manner. Several factors, including functional nature of the responses, the assumptions on the fun…
Looking at bivariate copulas from the perspective of conditional distributions and considering weak convergence of almost all conditional distributions yields the notion of weak conditional convergence. At first glance, this notion of convergence for copulas might seem far too restrictive to be of any practical importance - in fact, given samples of a copula $C$ the corresponding empirical copulas do not converge weakly conditional to $C$ with probability one in general. Within the class of Archimedean copulas and the class of Extreme Value copulas, however, standard pointwise convergence and …
Posterior consistency of Pólya trees for deconvolution under the linear model
研究线性模型反卷积问题，提出基于Pólya树先验的贝叶斯非参数方法，证明在X^TX最小特征值条件下后验分布依上确界范数集中于真实密度g0。
It is a typical standard assumption in the density deconvolution problem that the characteristic function of the measurement error distribution is non-zero on the real line. While this condition is assumed in the majority of existing works on the topic, there are many problem instances of interest where it is violated. In this paper we focus on non--standard settings where the characteristic function of the measurement errors has zeros, and study how zeros multiplicity affects the estimation accuracy. For a prototypical problem of this type we demonstrate that the best achievable estimation ac…
In a large class of statistical inverse problems it is necessary to suppose that the transformation that is inverted is known. Although, in many applications, it is unrealistic to make this assumption, the problem is often insoluble without it. However, if additional data are available, then it is possible to estimate consistently the unknown error density. Data are seldom available directly on the transformation, but repeated, or replicated, measurements increasingly are becoming available. Such data consist of ``intrinsic'' values that are measured several times, with errors that are general…
Rates of convergence for nonparametric estimation of singular distributions using generative adversarial networks
本文针对奇异分布的非参数估计问题，利用生成对抗网络（GANs）获得基于$L^1$-Wasserstein度量的收敛速率，该速率仅依赖底层结构和噪声水平，且严格快于VAE，并给出了极小极大最优速率的下界。
This paper considers the problem of estimating a mean pattern in the setting of Grenander's pattern theory. Shape variability in a data set of curves or images is modeled by the random action of elements in a compact Lie group on an infinite dimensional space. In the case of observations contaminated by an additive Gaussian white noise, it is shown that estimating a reference template in the setting of Grenander's pattern theory falls into the category of deconvolution problems over Lie groups. To obtain this result, we build an estimator of a mean pattern by using Fourier deconvolution and ha…
Bayesian Nonparametric Inference in Elliptic PDEs: Convergence Rates and Implementation
本文针对椭圆PDE中的扩散系数推断问题，提出基于高斯级数先验的贝叶斯非参数方法，推导后验一致性与收敛速率，并通过数值模拟验证理论。
For the problem of nonparametric estimation of signal in Gaussian noise we point out the strong asymptotically minimax estimators on maxisets for linear estimators (see \cite{ker93,rio}). It turns out that the order of rates of convergence of Pinsker estimator on this maxisets is worse than the order of rates of convergence for the class of linear estimators considered on this maxisets. We show that balls in Sobolev spaces are maxisets for Pinsker estimators.
We introduce new nonparametric predictors for homogeneous pooled data in the context of group testing for rare abnormalities and show that they achieve optimal rates of convergence. In particular, when the level of pooling is moderate, then despite the cost savings, the method enjoys the same convergence rate as in the case of no pooling. In the setting of "over-pooling" the convergence rate differs from that of an optimal estimator by no more than a logarithmic factor. Our approach improves on the random-pooling nonparametric predictor, which is currently the only nonparametric method availab…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。