D-optimal weighing designs for six objects

For all integers m≥6, we determine the maximum value of det X ^T X, where X is an m×6 (0, 1)-matrix, and exhibit (D-optimal) matrices X for which the maximum occurs. For D-optimal matrices X, the uniqueness of the Gram matrix X ^T X is discussed. Received: May 2000     

A note on the estimation of total weight in chemical balance weighing designs

Summary This paper studies the problem of estimation of the total weight of objects using a chemical balance weighing design under the restriction |L−R| ≤a, whereL andR represent the number of objects placed on the left and right pans, respectively. A lower bound for the variance of the estimated total weight is given and a necessary and sufficient condition for this lower bound to be attained is obtained. Finally, weighing designs for which this lower bound is attainable are constructed.     

Identification in models with autoregressive errors

Consider the model

$\text{A(L)x}{}_{\mathrm{t}}\text{=B(L)y}{}_{\mathrm{t}}\text{+C(L)z}{}_{\mathrm{t}}\text{=u}{}_{\mathrm{t}}\text{, t=1,…,T}$

, where

$\text{A(L)=(B(L):C(L))}$

is a matrix of polynomials in the lag operator so that $\text{L}{}^{\mathrm{r}}\text{x}{}_{\mathrm{t}}\text{=x}{}_{\mathrm{t?r}}$, and $\text{y}{}_{\mathrm{t}}$ is a vector of n endogenous variables,

$\text{B(L)=}\text{∑}\text{s=0}\text{k}\text{B}{}_{\mathrm{s}}\text{L}{}^{\mathrm{s}}$

$\text{B}{}_0\text{I}{}_{\mathrm{n}}$, and the remaining $\text{B}{}_{\mathrm{s}}$ are $\text{n × n}$ square matrices,

$\text{C(L)=}\text{∑}\text{s=0}\text{k}\text{C}{}_{\mathrm{s}}\text{L}{}^{\mathrm{s}}$

, and $\text{C}{}_{\mathrm{s}}$ is $\text{n × m}$.Suppose that $\text{u}{}_{\mathrm{t}}$ satisfies

$\text{R(L)u}{}_{\mathrm{t}}\text{=e}{}_{\mathrm{t}}$

, where

$\text{R(L)=}\text{∑}\text{s=0}\text{r}\text{R}{}_{\mathrm{s}}\text{L}{}^{\mathrm{s}}$

, $\text{R}{}_0\text{=I}{}_{\mathrm{n}}$, and $\text{R}{}_{\mathrm{s}}$ is a $\text{n × n}$ square matrix. $\text{e}{}_{\mathrm{t}}$ may be white noise, or generated by a vector moving average stochastic process.Now writing

$\text{Ψ(L)=R(L)A(L)}$

, it is assumed that ignoring the implicit restrictions which follow from eq. (1), $\text{Ψ(L)}$ can be consistently estimated, so that if the equation

$\text{Ψ(L)x}{}_{\mathrm{t}}\text{=e}{}_{\mathrm{t}}$

has a moving average error stochastic process, suitable conditions [see E.J. Hannan] for the identification of the unconstrained model are satisfied, and that the appropriate conditions (lack of multicollinearity) on the data second moments matrices discussed by Hannan are also satisfied. Then the essential conditions for identification of the A(L) and R(L) can be considered by requiring that for the true $\text{Ψ(L)}$ eq. (1) has a unique solution for $\text{A(L)}$ and $\text{R(L)}$.There are three types of lack of identification to be distinguished. In the first there are a finite number of alternative factorisations. Apart from a factorisation condition which will be satisfied with probability one a necessary and sufficient condition for lack of identification is that $\text{A(L)}$ has a latent root λ in the sense that for some non-zero vector β,

$\text{β′A(λ)=0}$

.The second concept of lack of identification corresponds to the Fisher conditions for local identifiability on the derivatives of the constraints. It is shown that a necessary and sufficient condition that the model is locally unidentified in this sense is that R(L) and A(L) have a common latent root, i.e., that for some vectors δ and β,

$\text{R(λ)δ=0 and β′A(λ)=0}$

.Firstly it is shown that only if further conditions are satisfied will this lead to local unidentifiability in the sense that there are solutions of the equation

$\text{Ψ(z)=R(z)A(z)}$

in any neighbourhood of the true values.     

Exact and approximate D-optimal designs in polynomial regression

If the sample sizen is large enough, then the exact polynomial regression designs obtained by rounding the weights of the approximate D-optimal design to integral multiples of 1/n are D-optimal. This was shown by alaevskiî (1966) and Gaffke (1987). In this note, an efficient algorithm to determine the minimum sample sizen _d for a polynomial model of degreed is derived from a condition given by Huang (1987). Under an additional assumption we show that the conditions of Gaffke and Huang are equivalent; we verify the additional assumption for polynomial degreed40.     

On exact D-optimal designs with 2 two-level factors and n autocorrelated observations

In this paper we consider the exact D-optimal designs for estimation of the unknown parameters in the two factors, each at only two-level, main effects model with autocorrelated errors. The vector of the n random errors in the observed responses is assumed to follow a first-order autoregressive model (AR(1)). The exact D-optimal designs seek the optimal combinations of the design levels as well as the optimal run orders, so that the determinant of the information matrix of BLUEs for the unknown parameters is maximized. Bora-Senta and Moyssiadis (1999) gave some conjectures about the exact D-optimal designs based on their experience of several exhaustive searches. In this paper their conjectures are partially proved to be true.Received: January 2003 / Accepted: October 2003Partially supported by the National Science Council of Taiwan, R.O.C. under grant NSC 91-2115-M-008-013.Supported in part by the National Science Council of Taiwan, R.O.C. under grant NSC 89-2118-M-110-003.     

R-optimal designs for multi-factor models with heteroscedastic errors

In this paper, we consider the R-optimal design problem for multi-factor regression models with heteroscedastic errors. It is shown that a R-optimal design for the heteroscedastic Kronecker product model is given by the product of the R-optimal designs for the marginal one-factor models. However, R-optimal designs for the additive models can be constructed from R-optimal designs for the one-factor models only if sufficient conditions are satisfied. Several examples are presented to illustrate and check optimal designs based on R-optimality criterion.     

Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments

In this paper, we study the problem of D-optimal experimental design under two linear constraints, which can be interpreted as simultaneous restrictions on the size and on the cost of the experiment. For computing a size- and cost-constrained approximate D-optimal design, we propose a specification of the “barycentric” multiplicative algorithm with sequential removal of redundant design points. We analytically prove convergence results for the proposed algorithm and numerically demonstrate its favorable properties compared to competing methods.     

Exact D-optimal designs for first-order trigonometric regression models on a partial circle

Recently, various approximate design problems for low-degree trigonometric regression models on a partial circle have been solved. In this paper we consider approximate and exact optimal design problems for first-order trigonometric regression models without intercept on a partial circle. We investigate the intricate geometry of the non-convex exact trigonometric moment set and provide characterizations of its boundary. Building on these results we obtain a solution of the exact $D$ -optimal design problem. It is shown that the structure of the optimal designs depends on both the length of the design interval and the number of observations.     

The adequacy of asymptotic approximations in the near-integrated autoregressive model with dependent errors

We consider the normalized least squares estimator of the parameter in a nearly integrated first-order autoregressive model with dependent errors. In a first step we consider its asymptotic distribution as well as asymptotic expansion up to order O_p(T⁻¹). We derive a limiting moment generating function which enables us to calculate various distributional quantities by numerical integration. A simulation study is performed to assess the adequacy of the asymptotic distribution when the errors are correlated. We focus our attention on two leading cases: MA(1) errors and AR(1) errors. The asymptotic approximations are shown to be inadequate as the MA root gets close to −1 and as the AR root approaches either −1 or 1. Our theoretical analysis helps to explain and understand the simulation results of Schwert (1989) and DeJong, Nankervis, Savin, and Whiteman (1992) concerning the size and power of Phillips and Perron's (1988) unit root test. A companion paper, Nabeya and Perron (1994), presents alternative asymptotic frameworks in the cases where the usual asymptotic distribution fails to provide an adequate approximation to the finite-sample distribution.     

Bayesian robust designs for linear models with possible bias and correlated errors

Consider the design problem for the approximately linear model with serially correlated errors. The correlated structure is the qth degree moving average process, MA(q), especially for q = 1, 2. The optimal design is derived by using Bayesian approach. The Bayesian designs derived with various priors are compared with the classical designs with respect to some specific correlated structures. The results show that any prior knowledge about the sign of the MA(q) process parameters leads to designs that are considerately more efficient than the classical ones based on homoscedastic assumptions.     

Testing for autoregressive against moving average errors in the linear regression model

This paper presents a new approach to hypotheses testing problems which are non-nested in the classical sense and which concern the covariance matrix of the disturbance vector of the linear regression model. In particular, the application of the approach to testing for AR(1) disturbances against MA(1) disturbances is explored in some detail. Practical difficulties are discussed and selected upper bounds for the test's five percent significance points are tabulated. The small sample power of four versions of the new test are compared empirically and a clear conclusion is made in regard to the best overall test.     

Optimality and efficiency of small chessboard designs for correlated errors

Optimal p × q row–column designs are obtained via complete enumeration of all possible designs for two treatments in some fixed effects models with errors specified by a doubly geometric covariance structure. This is done, in part, by a computer search, for a finite set of sizes of the correlation coefficients and in cases where p and q are small enough to make such a search feasible.     

Dynamic spatial autoregressive models with autoregressive and heteroskedastic disturbances

We propose a new class of models specifically tailored for spatiotemporal data analysis. To this end, we generalize the spatial autoregressive model with autoregressive and heteroskedastic disturbances, that is, SARAR(1, 1), by exploiting the recent advancements in score‐driven (SD) models typically used in time series econometrics. In particular, we allow for time‐varying spatial autoregressive coefficients as well as time‐varying regressor coefficients and cross‐sectional standard deviations. We report an extensive Monte Carlo simulation study in order to investigate the finite‐sample properties of the maximum likelihood estimator for the new class of models as well as its flexibility in explaining a misspecified dynamic spatial dependence process. The new proposed class of models is found to be economically preferred by rational investors through an application to portfolio optimization.     

Specification and estimation of spatial autoregressive models with autoregressive and heteroskedastic disturbances

This study develops a methodology of inference for a widely used Cliff–Ord type spatial model containing spatial lags in the dependent variable, exogenous variables, and the disturbance terms, while allowing for unknown heteroskedasticity in the innovations. We first generalize the GMM estimator suggested in  and  for the spatial autoregressive parameter in the disturbance process. We also define IV estimators for the regression parameters of the model and give results concerning the joint asymptotic distribution of those estimators and the GMM estimator. Much of the theory is kept general to cover a wide range of settings.     

Adaptive estimation of autoregressive models with time-varying variances

Stable autoregressive models are considered with martingale differences errors scaled by an unknown nonparametric time-varying function generating heterogeneity. An important special case involves structural change in the error variance, but in most practical cases the pattern of variance change over time is unknown and may involve shifts at unknown discrete points in time, continuous evolution or combinations of the two. This paper develops kernel-based estimators of the residual variances and associated adaptive least squares (ALS) estimators of the autoregressive coefficients. Simulations show that efficiency gains are achieved by the adaptive procedure.     

DeepAR: Probabilistic forecasting with autoregressive recurrent networks

Probabilistic forecasting, i.e., estimating a time series’ future probability distribution given its past, is a key enabler for optimizing business processes. In retail businesses, for example, probabilistic demand forecasts are crucial for having the right inventory available at the right time and in the right place. This paper proposes DeepAR, a methodology for producing accurate probabilistic forecasts, based on training an autoregressive recurrent neural network model on a large number of related time series. We demonstrate how the application of deep learning techniques to forecasting can overcome many of the challenges that are faced by widely-used classical approaches to the problem. By means of extensive empirical evaluations on several real-world forecasting datasets, we show that our methodology produces more accurate forecasts than other state-of-the-art methods, while requiring minimal manual work.