Marc Hoffmann, Markus Reiss
We study two nonlinear methods for statistical linear inverse problems when the operator is not known. The two constructions combine Galerkin regularization and wavelet thresholding. Their performances depend on the underlying structure of the operator, quantified by an index of sparsity. We prove their rate-optimality and adaptivity properties over Besov classes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We provide estimators for a large class of inverse problems, including nonlinear inverse problems. Using complexity regularization technics we provide adaptive estimators achieving the best rate over the collection of models.
We prove a Bernstein-von Mises theorem for a general class of high dimensional nonlinear Bayesian inverse problems in the vanishing noise limit. We propose a sufficient condition on the growth rate of the number of unknown parameters under which the posterior distribution is asymptotically normal. This growth condition is expressed explicitly in terms of the model dimension, the degree of ill-posedness of the inverse problem and the noise parameter. The theoretical results are applied to a Bayesian estimation of the medium parameter in an elliptic problem.
This work examines under what circumstances adaptivity for truncated SVD estimation can be achieved by an early stopping rule based on the smoothed residuals $ \| ( A A^{\top} )^{α/ 2} ( Y - A \hatμ^{( m )}) \|^{2} $. Lower and upper bounds for the risk are derived, which show that moderate smoothing of the residuals can be used to adapt over classes of signals with varying smoothness, while oversmoothing yields suboptimal convergence rates. The theoretical results are illustrated by Monte-Carlo simulations.
We consider the estimation of quadratic functionals in a Gaussian sequence model where the eigenvalues are supposed to be unknown and accessible through noisy observations only. Imposing smoothness assumptions both on the signal and the sequence of eigenvalues, we develop a minimax theory for this problem. We propose a truncated series estimator and show that it attains the optimal rate of convergence if the truncation parameter is chosen appropriately. Consequences for testing problems in inverse problems are equally discussed: in particular, the minimax rates of testing for signal detection …
The optimum quality that can be asymptotically achieved in the estimation of a probability p using inverse binomial sampling is addressed. A general definition of quality is used in terms of the risk associated with a loss function that satisfies certain assumptions. It is shown that the limit superior of the risk for p asymptotically small has a minimum over all (possibly randomized) estimators. This minimum is achieved by certain non-randomized estimators. The model includes commonly used quality criteria as particular cases. Applications to the non-asymptotic regime are discussed considerin…
Unbiased estimation in one-parameter exponential families for the inverse of the natural parameter with extensions
本文研究单参数连续指数族中自然参数倒数的无偏估计，给出多类模型应用，并推广至负幂及完全单调函数的估计。
We develop a method for estimating well-conditioned and sparse covariance and inverse covariance matrices from a sample of vectors drawn from a sub-gaussian distribution in high dimensional setting. The proposed estimators are obtained by minimizing the quadratic loss function and joint penalty of `1 norm and variance of its eigenvalues. In contrast to some of the existing methods of covariance and inverse covariance matrix estimation, where often the interest is to estimate a sparse matrix, the proposed method is flexible in estimating both a sparse and well-conditioned covariance matrix simu…
Nonparametric estimation of sliced inverse regression by the $ k$-nearest neighbors kernel method
本文提出基于k近邻核方法的切片逆回归非参数估计，引入协方差矩阵估计量以估计有效降维空间，证明渐近正态性，并通过模拟验证其有限样本性能优于核估计。
We consider Bayesian nonparametric density estimation using a Pitman-Yor or a normalized inverse-Gaussian process kernel mixture as the prior distribution for a density. The procedure is studied from a frequentist perspective. Using the stick-breaking representation of the Pitman-Yor process or the expression of the finite-dimensional distributions for the normalized-inverse Gaussian process, we prove that, when the data are replicates from an infinitely smooth density, the posterior distribution concentrates on any shrinking $L^p$-norm ball, $1\leq p\leq\infty$, around the sampling density at…
Tikhonov regularization with oversmoothing penalty for nonlinear statistical inverse problems
针对统计学习中含噪非线性不适定逆问题，本文采用 Hilbert 尺度下的 Tikhonov 正则化重建估计量，并基于算子与先验假设推导收敛速率及 RKHS 误差估计。
In this paper we will discuss a procedure to improve the usual estimator of a linear functional of the unknown regression function in inverse nonparametric regression models. In Klaassen, Lee, and Ruymgaart (2001) it has been proved that this traditional estimator is not asymptotically efficient (in the sense of the Hájek - Le Cam convolution theorem) except, possibly, when the error distribution is normal. Since this estimator, however, is still root-n consistent a procedure in Bickel, Klaassen, Ritov, and Wellner (1993) applies to construct a modification which is asymptotically efficient. A…
In this paper, we develop interval estimation methods for means of bounded random variables based on a sequential procedure such that the sampling is continued until the sample sum is no less than a prescribed threshold.
In this paper, we develop a general theory of truncated inverse binomial sampling. In this theory, the fixed-size sampling and inverse binomial sampling are accommodated as special cases. In particular, the classical Chernoff-Hoeffding bound is an immediate consequence of the theory. Moreover, we propose a rigorous and efficient method for probability estimation, which is an adaptive Monte Carlo estimation method based on truncated inverse binomial sampling. Our proposed method of probability estimation can be orders of magnitude more efficient as compared to existing methods in literature and…
Sequential estimation of the success probability $p$ in inverse binomial sampling is considered in this paper. For any estimator $\hat p$, its quality is measured by the risk associated with normalized loss functions of linear-linear or inverse-linear form. These functions are possibly asymmetric, with arbitrary slope parameters $a$ and $b$ for $\hat p<p$ and $\hat p>p$ respectively. Interest in these functions is motivated by their significance and potential uses, which are briefly discussed. Estimators are given for which the risk has an asymptotic value as $p$ tends to $0$, and which guaran…
We derive an upper bound for the efficiency of estimating entries in the inverse covariance matrix of a high dimensional distribution. We show that in order to approximate an off-diagonal entry of the density matrix of a $d$-dimensional Gaussian random vector, one needs at least a number of samples proportional to $d$. Furthermore, we show that with $n \ll d$ samples, the hypothesis that two given coordinates are fully correlated, when all other coordinates are conditioned to be zero, cannot be told apart from the hypothesis that the two are uncorrelated.
In a recent paper, Nguyen, Kuhn, and Esfahani (2018) built a distributionally robust estimator for the precision matrix of the Gaussian distribution. The distributional uncertainty size is a key ingredient in the construction of this estimator. We develop a statistical theory which shows how to optimally choose the uncertainty size to minimize the associated Stein loss. Surprisingly, rather than the expected canonical square-root scaling rate, the optimal uncertainty size scales linearly with the sample size.
In this paper, we estimate the high dimensional precision matrix under the weak sparsity condition where many entries are nearly zero. We revisit the sparse column-wise inverse operator (SCIO) estimator \cite{liu2015fast} and derive its general error bounds under the weak sparsity condition. A unified framework is established to deal with various cases including the heavy-tailed data, the non-paranormal data, and the matrix variate data. These new methods can achieve the same convergence rates as the existing methods and can be implemented efficiently.
Expectation Propagation for Nonlinear Inverse Problems -- with an Application to Electrical Impedance Tomography
本文提出基于期望传播的快速近似推断方法，用于求解非线性反问题的后验概率分布，通过高效估计后验均值和协方差，提供反演解及不确定性量化，应用于电阻抗断层成像并对比马尔可夫链蒙特卡洛方法。
The Bayesian solution to a statistical inverse problem can be summarised by a mode of the posterior distribution, i.e. a MAP estimator. The MAP estimator essentially coincides with the (regularised) variational solution to the inverse problem, seen as minimisation of the Onsager-Machlup functional of the posterior measure. An open problem in the stability analysis of inverse problems is to establish a relationship between the convergence properties of solutions obtained by the variational approach and by the Bayesian approach. To address this problem, we propose a general convergence theory fo…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。