arXiv subjects

Anatoly Zhigljavsky

Publications and source records attributed to Anatoly Zhigljavsky.

29 records · Page 2Linked to original sources

arXiv2019

Approximating Shepp's constants for the Slepian process

Slepian process $S(t)$ is a stationary Gaussian process with zero mean and covariance $ E S(t)S(t')=\max\{0,1-|t-t'|\}\, . $ For any $T>0$ and $h>0$, define $F_T(h ) = {\rm Pr}\left\{\max_{t \in [0,T]} S(t) < h \right\} $ and the constants $Λ(h) = -\lim_{T \to \infty} \frac1T \log F_T(h)$ and $λ(h)=\exp\{-Λ(h) \}$; we will call them `Shepp's constants'. The aim of the paper is construction of accurate approximations for $F_T(h)$ and hence for the Shepp's constants. We demonstrate that at least some of the approximations are extremely accurate.

math.PR↗

arXiv2019

First passage time for Slepian process with linear barrier

In this paper we extend results of L.A. Shepp by finding explicit formulas for the first passage probability $F_{a,b}(T\, |\, x)={\rm Pr}(S(t) 0$, where $S(t)$ is a Gaussian process with mean 0 and covariance $\mathbb{E} S(t)S(t')=\max\{0,1-|t-t'|\}\,.$ We then extend the results to the case of piecewise-linear barriers and outline applications to change-point detection problems. Previously, explicit formulas for $F_{a,b}(T\, |\, x)$ were known only for the cases $b=0$ (constant barrier) or $T\leq 1$ (short interval).

math.PR↗

arXiv2018

Bregman divergences based on optimal design criteria and simplicial measures of dispersion

In previous work the authors defined the k-th order simplicial distance between probability distributions which arises naturally from a measure of dispersion based on the squared volume of random simplices of dimension k. This theory is embedded in the wider theory of divergences and distances between distributions which includes Kullback-Leibler, Jensen-Shannon, Jeffreys-Bregman divergence and Bhattacharyya distance. A general construction is given based on defining a directional derivative of a function $ϕ$ from one distribution to the other whose concavity or strict concavity influences the properties of the resulting divergence. For the normal distribution these divergences can be expressed as matrix formula for the (multivariate) means and covariances. Optimal experimental design criteria contribute a range of functionals applied to non-negative, or positive definite, information matrices. Not all can distinguish normal distributions but sufficient conditions are given. The k-th order simplicial distance is revisited from this aspect and the results are used to test empirically the identity of means and covariances.

math.ST↗

arXiv2018

Bayesian quadrature and energy minimization for space-filling design

A standard objective in computer experiments is to approximate the behaviour of an unknown function on a compact domain from a few evaluations inside the domain. When little is known about the function, space-filling design is advisable: typically, points of evaluation spread out across the available space are obtained by minimizing a geometrical (for instance, covering radius) or a discrepancy criterion measuring distance to uniformity. The paper investigates connections between design for integration (quadrature design), construction of the (continuous) BLUE for the location model, space-filling design, and minimization of energy (kernel discrepancy) for signed measures. Integrally strictly positive definite kernels define strictly convex energy functionals, with an equivalence between the notions of potential and directional derivative, showing the strong relation between discrepancy minimization and more traditional design of optimal experiments. In particular, kernel herding algorithms, which are special instances of vertex-direction methods used in optimal design, can be applied to the construction of point sequences with suitable space-filling properties.

math.ST↗

arXiv2016

Best linear unbiased estimators in continuous time regression models

In this paper the problem of best linear unbiased estimation is investigated for continuous-time regression models. We prove several general statements concerning the explicit form of the best linear unbiased estimator (BLUE), in particular when the error process is a smooth process with one or several derivatives of the response process available for construction of the estimators. We derive the explicit form of the BLUE for many specific models including the cases of continuous autoregressive errors of order two and integrated error processes (such as integrated Brownian motion). The results are illustrated by several examples.

stat.ME↗

arXiv2016

Optimal designs for regression models with autoregressive errors structure

In the one-parameter regression model with AR(1) and AR(2) errors we find explicit expressions and a continuous approximation of the optimal discrete design for the signed least square estimator. The results are used to derive the optimal variance of the best linear estimator in the continuous time model and to construct efficient estimators and corresponding optimal designs for finite samples. The resulting procedure (estimator and design) provides nearly the same efficiency as the weighted least squares and its variance is close to the optimal variance in the continuous time model. The results are illustrated by several examples demonstrating the feasibility of our approach.

math.ST↗

arXiv2015

A new approach to optimal designs for correlated observations

This paper presents a new and efficient method for the construction of optimal designs for regression models with dependent error processes. In contrast to most of the work in this field, which starts with a model for a finite number of observations and considers the asymptotic properties of estimators and designs as the sample size converges to infinity, our approach is based on a continuous time model. We use results from stochastic anal- ysis to identify the best linear unbiased estimator (BLUE) in this model. Based on the BLUE, we construct an efficient linear estimator and corresponding optimal designs in the model for finite sample size by minimizing the mean squared error between the opti- mal solution in the continuous time model and its discrete approximation with respect to the weights (of the linear estimator) and the optimal design points, in particular in the multi-parameter case. In contrast to previous work on the subject the resulting estimators and corresponding optimal designs are very efficient and easy to implement. This means that they are practi- cally not distinguishable from the weighted least squares estimator and the corresponding optimal designs, which have to be found numerically by non-convex discrete optimization. The advantages of the new approach are illustrated in several numerical examples.

stat.ME↗

arXiv2015

An extended Generalised Variance, with Applications

We consider a measure $ψ$ k of dispersion which extends the notion of Wilk's generalised variance, or entropy, for a d-dimensional distribution, and is based on the mean squared volume of simplices of dimension k $\le$ d formed by k + 1 independent copies. We show how $ψ$ k can be expressed in terms of the eigenvalues of the covariance matrix of the distribution, also when a n-point sample is used for its estimation, and prove its concavity when raised at a suitable power. Some properties of entropy-maximising distributions are derived, including a necessary and sufficient condition for optimality. Finally, we show how this measure of dispersion can be used for the design of optimal experiments, with equivalence to A and D-optimal design for k = 1 and k = d respectively. Simple illustrative examples are presented.

math.ST↗

arXiv2015

Optimal designs in regression with correlated errors

This paper discusses the problem of determining optimal designs for regression models, when the observations are dependent and taken on an interval. A complete solution of this challenging optimal design problem is given for a broad class of regression models and covariance kernels. We propose a class of estimators which are only slightly more complicated than the ordinary least-squares estimators. We then demonstrate that we can design the experiments, such that asymptotically the new estimators achieve the same precision as the best linear unbiased estimator computed for the whole trajectory of the process. As a by-product we derive explicit expressions for the BLUE in the continuous time model and analytic expressions for the optimal designs in a wide class of regression models. We also demonstrate that for a finite number of observations the precision of the proposed procedure, which includes the estimator and design, is very close to the best achievable. The results are illustrated on a few numerical examples.

stat.ME↗

arXiv2013

Optimal design for linear models with correlated observations

In the common linear regression model the problem of determining optimal designs for least squares estimation is considered in the case where the observations are correlated. A necessary condition for the optimality of a given design is provided, which extends the classical equivalence theory for optimal designs in models with uncorrelated errors to the case of dependent data. If the regression functions are eigenfunctions of an integral operator defined by the covariance kernel, it is shown that the corresponding measure defines a universally optimal design. For several models universally optimal designs can be identified explicitly. In particular, it is proved that the uniform distribution is universally optimal for a class of trigonometric regression models with a broad class of covariance kernels and that the arcsine distribution is universally optimal for the polynomial regression model with correlation structure defined by the logarithmic potential. To the best knowledge of the authors these findings provide the first explicit results on optimal designs for regression models with correlated observations, which are not restricted to the location scale model.

math.ST↗

arXiv2012

Asymptotic optimal designs under long-range dependence error structure

We discuss the optimal design problem in regression models with long-range dependence error structure. Asymptotic optimal designs are derived and it is demonstrated that these designs depend only indirectly on the correlation function. Several examples are investigated to illustrate the theory. Finally, the optimal designs are compared with asymptotic optimal designs which were derived by Bickel and Herzberg [Ann. Statist. 7 (1979) 77--95] for regression models with short-range dependent error.

math.ST↗