Hierarchical bayesian curve fitting and smoothing

Estimation of a smooth function is considered when observations on this function added with Gaussian errors are observed. The problem is formulated as a general linear model, and a hierarchical Bayesian approach is then used to study it. Credible bands are also developed for the function. Sensitivity analysis is conducted to determine the influence of the choice of priors on hyperparameters. Finally, the methodology is illustrated using real and simulated examples where it is compared with classical cubic splines. It is also shown that our approach provides a Bayesian solution to some problems in discrete time series.     

Best linear corrector of classification estimates of proportions of objects in several unknown classes

It has been recognized that counting the objects allocated by a rule of classification to several unknown classes often does not provide good estimates of the true class proportions of the objects to be classified. We propose a linear transformation of these classification estimates, which minimizes the mean squared error of the transformed estimates over all possible sets of true proportions. This so-called best-linear-corrector (BLC) transformation is a function of the confusion (classification-error) matrix and of the first and second moments of the prior distribution of the vector of proportions. When the number of objects to be classified increases, the BLC tends to the inverse of the confusion matrix. The estimates that are obtained directly by this inverse-confusion corrector (ICC) are also the maximum-likelihood unbiased estimates of the probabilities that the objects originate from one or the other class, had the objects been preselected with those probabilities. But for estimating the actual proportions, the ICC estimates behave less well than the raw classification estimates for some collections. In that situation, the BLC is substantially superior to the ICC even for some large collections of objects and is always substantially superior to the raw estimates. The statistical model is applied concretely to the measure of forest covers in remote sensing.     

Wavelet deconvolution in a periodic setting

Summary.  Deconvolution problems are naturally represented in the Fourier domain, whereas thresholding in wavelet bases is known to have broad adaptivity properties. We study a method which combines both fast Fourier and fast wavelet transforms and can recover a blurred function observed in white noise with O { n    log ( n )²} steps. In the periodic setting, the method applies to most deconvolution problems, including certain 'boxcar' kernels, which are important as a model of motion blur, but having poor Fourier characteristics. Asymptotic theory informs the choice of tuning parameters and yields adaptivity properties for the method over a wide class of measures of error and classes of function. The method is tested on simulated light detection and ranging data suggested by underwater remote sensing. Both visual and numerical results show an improvement over competing approaches. Finally, the theory behind our estimation paradigm gives a complete characterization of the 'maxiset' of the method: the set of functions where the method attains a near optimal rate of convergence for a variety of L ^p loss functions.     

A minimally informative likelihood for decision analysis: Illustration and robustness

The authors discuss a class of likelihood functions involving weak assumptions on data generating mechanisms. These likelihoods may be appropriate when it is difficult to propose models for the data. The properties of these likelihoods are given and it is shown how they can be computed numerically by use of the Blahut-Arimoto algorithm. The authors then show how these likelihoods can give useful inferences using a data set for which no plausible physical model is apparent. The plausibility of the inferences is enhanced by the extensive robustness analysis these likelihoods permit.     

Asymptotic properties of a conditional maximum-likelihood estimator

Inference for a scalar interest parameter in the presence of nuisance parameters is considered in terms of the conditional maximum-likelihood estimator developed by Cox and Reid (1987). Parameter orthogonality is assumed throughout. The estimator is analyzed by means of stochastic asymptotic expansions in three cases: a scalar nuisance parameter, m nuisance parameters from m independent samples, and a vector nuisance parameter. In each case, the expansion for the conditional maximum-likelihood estimator is compared with that for the usual maximum-likelihood estimator. The means and variances are also compared. In each of the cases, the bias of the conditional maximum-likelihood estimator is unaffected by the nuisance parameter to first order. This is not so for the maximum-likelihood estimator. The assumption of parameter orthogonality is crucial in attaining this result. Regardless of parametrization, the difference in the two estimators is first-order and is deterministic to this order.     

Multiple roots of estimating functions

Estimating functions can have multiple roots. In such cases, the statistician must choose among the roots to estimate the parameter. Standard asymptotic theory shows that in a wide variety of cases, there exists a unique consistent root, and that this root will lie asymptotically close to other consistent (possibly inefficient) estimators for the parameter. For this reason, attention has largely focused on the problem of selecting this root and determining its approximate asymptotic distribution. In this paper, however, we concentrate on the exact distribution of the roots as a random set. In particular, we propose the use of higher-order root intensity functions as a tool for examining the properties of the roots and determining their most problematic features. The use of root intensity functions of first and second order is illustrated by application to the score function for the Cauchy location model.     

Asymptotic behavior of the grenander estimator at density flat regions

Over forty years ago, Grenander derived the MLE of a monotone decreasing density f with known mode. Prakasa Rao obtained the asymptotic distribution of this estimator at a fixed point x where f' (x) < 0. Here, we obtain the asymptotic distribution of this estimator at a fixed point x when f is constant and nonzero in some open neighborhood of x. This limiting distribution is expressible as the convolution of a closed-form density and a rescaled standard normal density. Groeneboom (1983) derived the aforementioned closed-form density and we provide an alternative, more direct derivation.     

Some topics of current interest in clinical trials

After a short review of the development of the modern approach to the design of clinical trials, attention is focused on the wide variety of trials, their ethical constraints, the criteria for stopping trials, and the possible use of Bayesian methods. Brief discussions are then presented of two specific topics: the analysis of categorical data, and the replication of trials with the consequent need for overviews.     

The rank von neumann test as a test for autocorrelation in regression models

The rank Von Neumann test, which performs extremely well as a test for serial correlation in raw data, is here compared with the Durbin-Watson and Geary tests as a test for autocorrelation in regression residuals. The test convincingly outperforms the Geary test but it is less robust than the Durbin-Watson test     

Limit theorems for a general weighted process under random censoring

Necessary and sufficient conditions for weak and strong convergence are derived for the weighted version of a general process under random censoring. To be more explicit, this means that for this process complete analogues are obtained of the Chibisov-O'Reilly theorem, the Lai-Wellner Glivenko-Cantelli theorem, and the James law of the iterated logarithm for the empirical process. The process contains as special cases the so-called basic martingale, the empirical cumulative hazard process, and the product-limit process. As a tool we derive a Kiefer-process-type approximation of our process, which may be of independent interest.     

Orthogonalizing parametric link transformation families in binary regression analysis

This paper studies the application of the orthogonalization technique of Cox and Reid (1987) to parametric families of link functions used in binary regression analysis. The explicit form of Cox and Reid's condition (4), for orthogonality at a point, is derived for arbitrary link families. This condition is used to determine a transform of a family introduced by Burr (1942) and Prentice (1975, 1976) which is locally orthogonal when the regression parameter is zero. Thus the benefits of having orthogonal parameters are limited to “small” regression effects. The extent to which approximate orthogonality holds for nonzero regression coefficients is investigated for two data sets from the literature. Two specific issues considered are: (1) the ability of orthogonal reparametrization to reduce the variability of the regression parameters caused by estimation of the link parameter and (2) the improved numerical stability (and hence interpretability) of regression estimates corresponding to different link parameters.     

Error reduction in density estimation under shape restrictions

For the problems of nonparametric estimation of nonincreasing and symmetric unimodal density functions with bounded supports we determine the projections of estimates onto the convex families of possible parent densities with respect to the weighted integrated squared error. We also describe the method of approximating the analogous projections onto the respective density classes satisfying some general moment conditions. The method of projections reduces the estimation errors for all possible values of observations of a given finite sample size in a uniformly optimal way and provides estimates sharing the properties of the parent densities.     

Testing lack of fit of regression models under heteroscedasticity

A test is proposed for assessing the lack of fit of heteroscedastic nonlinear regression models that is based on comparison of nonparametric kernel and parametric fits. A data-driven method is proposed for bandwidth selection using the asymptotically optimal bandwidth of the parametric null model which leads to a test that has a limiting normal distribution under the null hypothesis and is consistent against any fixed alternative. The resulting test is applied to the problem of testing the lack of fit of a generalized linear model.     

Partial deconvolution estimation in nonparametric regression

In this article, we propose a class of partial deconvolution kernel estimators for the nonparametric regression function when some covariates are measured with error and some are not. The estimation procedure combines the classical kernel methodology and the deconvolution kernel technique. According to whether the measurement error is ordinarily smooth or supersmooth, we establish the optimal local and global convergence rates for these proposed estimators, and the optimal bandwidths are also identified. Furthermore, lower bounds for the convergence rates of all possible estimators for the nonparametric regression functions are developed. It is shown that, in both the super and ordinarily smooth cases, the convergence rates of the proposed partial deconvolution kernel estimators attain the lower bound. The Canadian Journal of Statistics 48: 535–560; 2020 © 2020 Statistical Society of Canada     

Asymptotics for L1-estimators of regression parameters under heteroscedasticityY

We consider the asymptotic behaviour of L₁ -estimators in a linear regression under a very general form of heteroscedasticity. The limiting distributions of the estimators are derived under standard conditions on the design. We also consider the asymptotic behaviour of the bootstrap in the heteroscedastic model and show that it is consistent to first order only if the limiting distribution is normal.     

Simulations and computations of nonparametric density estimates for the deconvolution problem

The nonparametric density function estimation using sample observations which are contaminated with random noise is studied. The particular form of contamination under consideration is Y = X + Z, where Y is an observable random variableZ is a random noise variable with known distribution, and X is an absolutely continuous random variable which cannot be observed directly. The finite sample size performance of a strongly consistent estimator for the density function of the random variable X is illustrated for different distributions. The estimator uses Fourier and kernel function estimation techniques and allows the user to choose constants which relate to bandwidth windows and limits on integration and which greatly affect the appearance and properties of the estimates. Numerical techniques for computation of the estimated densities and for optimal selection of the constant are given.     

Estimating crop yield via Gaussian quadrature

The present study proposes a method to estimate the yield of a crop. The proposed Gaussian quadrature (GQ) method makes it possible to estimate the crop yield from a smaller subsample. Identification of plots and corresponding weights to be assigned to the yield of plots comprising a subsample is done with the help of information about the full sample on certain auxiliary variables relating to biometrical characteristics of the plant. Computational experience reveals that the proposed method leads to about 78% reduction in sample size with absolute percentage error of 2.7%. Performance of the proposed method has been compared with that of random sampling on the basis of the values of average absolute percentage error and standard deviation of yield estimates obtained from 40 samples of comparable size. Interestingly, average absolute percentage error as well as standard deviation is considerably smaller for the GQ estimates than for the random sample estimates. The proposed method is quite general and can be applied for other crops as well-provided information on auxiliary variables relating to yield contributing biometrical characteristics is available.     

Consistent deconvolution in density estimation

Suppose we have n observations from X = Y + Z, where Z is a noise component with known distribution, and Y has an unknown density f. When the characteristic function of Z is nonzero almost everywhere, we show that it is possible to construct a density estimate f_n such that for all f, Iim_n| |=0.