Gaussian process

About: Gaussian process is a research topic. Over the lifetime, 18944 publications have been published within this topic receiving 486645 citations. The topic is also known as: Gaussian stochastic process.

Estimation in Gaussian Noise: Properties of the Minimum Mean-Square Error

Abstract: Consider the minimum mean-square error (MMSE) of estimating an arbitrary random variable from its observation contaminated by Gaussian noise. The MMSE can be regarded as a function of the signal-to-noise ratio (SNR) as well as a functional of the input distribution (of the random variable to be estimated). It is shown that the MMSE is concave in the input distribution at any given SNR. For a given input distribution, the MMSE is found to be infinitely differentiable at all positive SNR, and in fact a real analytic function in SNR under mild conditions. The key to these regularity results is that the posterior distribution conditioned on the observation through Gaussian channels always decays at least as quickly as some Gaussian density. Furthermore, simple expressions for the first three derivatives of the MMSE with respect to the SNR are obtained. It is also shown that, as functions of the SNR, the curves for the MMSE of a Gaussian input and that of a non-Gaussian input cross at most once over all SNRs. These properties lead to simple proofs of the facts that Gaussian inputs achieve both the secrecy capacity of scalar Gaussian wiretap channels and the capacity of scalar Gaussian broadcast channels, as well as a simple proof of the entropy power inequality in the special case where one of the variables is Gaussian.

Computing with Infinite Networks

Abstract: For neural networks with a wide class of weight-priors, it can be shown that in the limit of an infinite number of hidden units the prior over functions tends to a Gaussian process. In this paper analytic forms are derived for the covariance function of the Gaussian processes corresponding to networks with sigmoidal and Gaussian hidden units. This allows predictions to be made efficiently using networks with an infinite number of hidden units, and shows that, somewhat paradoxically, it may be easier to compute with infinite networks than finite ones.

On semi-competing risks data

Abstract: SUMMARY We consider a variation of the competing risks problem in which a terminal event censors a non-terminal event, but not vice versa. The joint distribution of the events is formulated via a gamma frailty model in the upper wedge where data are observable (Day et al., 1997), with the marginal distributions unspecified. An estimator for the association parameter is obtained from a concordance estimating function. A novel plug-in estimator for the marginal distribution of the non-terminal event is shown to be uniformly consistent and to converge weakly to a Gaussian process. The assumptions on the joint distribution outside the upper wedge are weaker than those usually made in competing risks analyses. Simulations demonstrate that the methods work well with practical sample sizes. The proposals are illustrated with data on morbidity and mortality in leukaemia patients.