Regularized Posteriors in Linear Ill‐Posed Inverse Problems

Abstract. We study the Bayesian solution of a linear inverse problem in a separable Hilbert space setting with Gaussian prior and noise distribution. Our contribution is to propose a new Bayes estimator which is a linear and continuous estimator on the whole space and is stronger than the mean of the exact Gaussian posterior distribution which is only defined as a measurable linear transformation. Our estimator is the mean of a slightly modified posterior distribution called regularized posterior distribution. Frequentist consistency of our estimator and of the regularized posterior distribution is proved. A Monte Carlo study and an application to real data confirm good small‐sample properties of our procedure.     

Minimax estimation via wavelets for indirect long-memory data

In this paper, we model linear inverse problems with long-range dependence by a fractional Gaussian noise model and study function estimation based on observations from the model. By using two wavelet-vaguelette decompositions, one for the inverse problem which simultaneously quasi-diagonalizes both the operator and the prior information, and one for long-range dependence which decorrelates fractional Gaussian noise, we establish asymptotics for minimax risks, and show that the wavelet shrinkage estimate can be tuned to achieve the minimax convergence rate and significantly outperform linear estimates.     

Minimax Linear Smoothers

We consider the problem of estimating the mean of a multivariate distribution. As a general alternative to penalized least squares estimators, we consider minimax estimators for squared error over a restricted parameter space where the restriction is determined by the penalization term. For a quadratic penalty term, the minimax estimator among linear estimators can be found explicitly. It is shown that all symmetric linear smoothers with eigenvalues in the unit interval can be characterized as minimax linear estimators over a certain parameter space where the bias is bounded. The minimax linear estimator depends on smoothing parameters that must be estimated in practice. Using results in Kneip (1994), this can be done using Mallows' C _L -statistic and the resulting adaptive estimator is now asymptotically minimax linear. The minimax estimator is compared to the penalized least squares estimator both in finite samples and asymptotically.     

Asymptotic minimax rates for abstract linear estimators

Abstract linear estimation concerns the estimation of an abstract parameter that depends on the underlying density via a linear transformation. An important subclass is the class of inverse problems where this transformation is naturally described as the inverse of some bounded operator. Suitable preconditioning allows us to restrict ourselves to the inverse of some Hermitian operator, which does not remain restricted to the class of compact operators. A lower bound to the minimax risk is obtained for the class of all estimators satisfying a natural moment condition and certain submodels. To establish the bound we use the Bayesian van Trees inequality and systems of (pseudo) eigenvectors of the operator involved. We also briefly sketch a general construction method for estimators, based on a regularized inverse of the operator involved, and show that these estimators attain the asymptotic minimax rate in interesting examples.     

Inference on proportional hazard rate model parameter under Type-I progressively hybrid censoring scheme

ABSTRACT

In this paper, under Type-I progressive hybrid censoring sample, we obtain maximum likelihood estimator of unknown parameter when the parent distribution belongs to proportional hazard rate family. We derive the conditional probability density function of the maximum likelihood estimator using moment-generating function technique. The exact confidence interval is obtained and compared by conducting a Monte Carlo simulation study for burr Type XII distribution. Finally, we obtain the Bayes and posterior regret gamma minimax estimates of the parameter under a precautionary loss function with precautionary index k = 2 and compare their behavior via a Monte Carlo simulation study.     

Bayesian Optimal Adaptive Estimation Using a Sieve Prior

We derive rates of contraction of posterior distributions on non‐parametric models resulting from sieve priors. The aim of the study was to provide general conditions to get posterior rates when the parameter space has a general structure, and rate adaptation when the parameter is, for example, a Sobolev class. The conditions employed, although standard in the literature, are combined in a different way. The results are applied to density, regression, nonlinear autoregression and Gaussian white noise models. In the latter we have also considered a loss function which is different from the usual l ² norm, namely the pointwise loss. In this case it is possible to prove that the adaptive Bayesian approach for the l ² loss is strongly suboptimal and we provide a lower bound on the rate.     

Another look at Huber's estimator: A new minimax estimator in regression with stochastically bounded noise

Huber's estimator has had a long lasting impact, particularly on robust statistics. It is well known that under certain conditions, Huber's estimator is asymptotically minimax. A moderate generalization in rederiving Huber's estimator shows that Huber's estimator is not the only choice. We develop an alternative asymptotic minimax estimator and name it regression with stochastically bounded noise (RSBN). Simulations demonstrate that RSBN is slightly better in performance, although it is unclear how to justify such an improvement theoretically. We propose two numerical solutions: an iterative numerical solution, which is extremely easy to implement and is based on the proximal point method; and a solution by applying state-of-the-art nonlinear optimization software packages, e.g., SNOPT. Contribution: the generalization of the variational approach is interesting and should be useful in deriving other asymptotic minimax estimators in other problems.     

Block‐threshold‐adapted Estimators via a Maxiset Approach

We study the maxiset performance of a large collection of block thresholding wavelet estimators, namely the horizontal block thresholding family. We provide sufficient conditions on the choices of rates and threshold values to ensure that the involved adaptive estimators obtain large maxisets. Moreover, we prove that any estimator of such a family reconstructs the Besov balls with a near‐minimax optimal rate that can be faster than the one of any separable thresholding estimator. Then, we identify, in particular cases, the best estimator of such a family, that is, the one associated with the largest maxiset. As a particularity of this paper, we propose a refined approach that models method‐dependent threshold values. By a series of simulation studies, we confirm the good performance of the best estimator by comparing it with the other members of its family.     

Bayes minimax estimation of a bernoulli p in a restricted parameter space

In many estimation problems the parameter of interest is known,a priori, to belong to a proper subspace of the natural parameter space. Although useful in practice this type of additional information can lead to surprising theoretical difficulties. In this paper the problem of minimax estimation of a Bernoulli pwhen pis restricted to a symmetric subinterval of the natural parameter space is considered. For the sample sizes n = 1,2,3, and 4 least favorable priors with finite support are provided and the corresponding Bayes estimators are shown to be minimax. For n = 5 and 6 the usual constant risk minimax estimator is shown to be the Bayes minimax estimator corresponding to a least favorable prior with finite support, provided the restriction on the parameter space is not too tight.     

A general method of finding a minimax estimator of a distribution function when no equalizer rule is available

We propose a feasible general method for finding a minimax estimator of an unknown distribution function F in the nonparametric problem. As an application, some minimax estimators are proposed. Furthermore, some minimax binomial parametric problems are studied.     

Restricted minimax estimation in semiparametric linear models

Abstract

In this article we develop the minimax estimation approach of general linear models to the semiparametric linear models when the parameters are simultaneously constrained by an ellipsoid and linear restrictions. Combining sample information and prior constraints the minimax estimator is obtained and compared with partially least square estimator by theoretical and simulation methods.     

On posterior distribution of Bayesian wavelet thresholding

We investigate the posterior rate of convergence for wavelet shrinkage using a Bayesian approach in general Besov spaces. Instead of studying the Bayesian estimator related to a particular loss function, we focus on the posterior distribution itself from a nonparametric Bayesian asymptotics point of view and study its rate of convergence. We obtain the same rate as in Abramovich et al. (2004) where the authors studied the convergence of several Bayesian estimators.     

Penalized contrast estimation in functional linear models with circular data

Our aim is to estimate the unknown slope function in the functional linear model when the response Y is real and the random function X is a second-order stationary and periodic process. We obtain our estimator by minimizing a standard (and very simple) mean-square contrast on linear finite dimensional spaces spanned by trigonometric bases. Our approach provides a penalization procedure which allows to automatically select the adequate dimension, in a non-asymptotic point of view. In fact, we can show that our penalized estimator reaches the optimal (minimax) rate of convergence in the sense of the prediction error. We complete the theoretical results by a simulation study and a real example that illustrates how the procedure works in practice.     

Deconvolution of supersmooth densities with smooth noise

The author considers the estimation of the common probability density of independent and identically distributed random variables observed with added white noise. She assumes that the unknown density belongs to some class of supersmooth functions, and that the error distribution is ordinarily smooth, meaning that its characteristic function decays polynomially asymptotically. In this context, the author evaluates the minimax rate of convergence of the pointwise risk and describes a kernel estimator having this rate. She computes upper bounds for the L₂ risk of this estimator.     

A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models

Minimax optimal experimental designs are notoriously difficult to study largely because the optimality criterion is not differentiable and there is no effective algorithm for generating them. We apply semi-infinite programming (SIP) to solve minimax design problems for nonlinear models in a systematic way using a discretization based strategy and solvers from the General Algebraic Modeling System (GAMS). Using popular models from the biological sciences, we show our approach produces minimax optimal designs that coincide with the few theoretical and numerical optimal designs in the literature. We also show our method can be readily modified to find standardized maximin optimal designs and minimax optimal designs for more complicated problems, such as when the ranges of plausible values for the model parameters are dependent and we want to find a design to minimize the maximal inefficiency of estimates for the model parameters.     

Wavelet-Based Density Estimation in a Heteroscedastic Convolution Model

We consider a heteroscedastic convolution density model under the “ordinary smooth assumption.” We introduce a new adaptive wavelet estimator based on term-by-term hard thresholding rule. Its asymptotic properties are explored via the minimax approach under the mean integrated squared error over Besov balls. We prove that our estimator attains near optimal rates of convergence (lower bounds are determined). Simulation results are reported to support our theoretical findings.     

Optimal estimation in functional linear regression for sparse noise‐contaminated data

In this article, we propose a novel approach to fit a functional linear regression in which both the response and the predictor are functions. We consider the case where the response and the predictor processes are both sparsely sampled at random time points and are contaminated with random errors. In addition, the random times are allowed to be different for the measurements of the predictor and the response functions. The aforementioned situation often occurs in longitudinal data settings. To estimate the covariance and the cross‐covariance functions, we use a regularization method over a reproducing kernel Hilbert space. The estimate of the cross‐covariance function is used to obtain estimates of the regression coefficient function and of the functional singular components. We derive the convergence rates of the proposed cross‐covariance, the regression coefficient, and the singular component function estimators. Furthermore, we show that, under some regularity conditions, the estimator of the coefficient function has a minimax optimal rate. We conduct a simulation study and demonstrate merits of the proposed method by comparing it to some other existing methods in the literature. We illustrate the method by an example of an application to a real‐world air quality dataset. The Canadian Journal of Statistics 47: 524–559; 2019 © 2019 Statistical Society of Canada     

Blind deconvolution model in periodic setting with fractional Gaussian noise

We consider the problem of estimating the response function in a deconvolution model under fractional Gaussian noise and noisy kernel. A preliminary threshold is used to stabilize the inversion. Our estimator is adaptive and attains minimax optimal or near-optimal rates in a wide range of Besov balls.     

Estimation of parameters of inverse Weibull distribution and application to multi-component stress-strength model

The problem of estimation of the parameters of two-parameter inverse Weibull distributions has been considered. We establish existence and uniqueness of the maximum likelihood estimators of the scale and shape parameters. We derive Bayes estimators of the parameters under the entropy loss function. Hierarchical Bayes estimator, equivariant estimator and a class of minimax estimators are derived when shape parameter is known. Ordered Bayes estimators using information about second population are also derived. We investigate the reliability of multi-component stress-strength model using classical and Bayesian approaches. Risk comparison of the classical and Bayes estimators is done using Monte Carlo simulations. Applications of the proposed estimators are shown using real data sets.