SearcharxivSearch

arXiv · 1604.03802

Robust designs to model uncertainty with high estimation and prediction efficiency

Abstract

Alphabetic optimality criteria, such as the $D$, $A$, and $I$ criteria, require specifying a model to select optimal designs. They are not model free and the optimal designs selected by them are not robust to model uncertainty. Recently, many extensions of the $D$ and $A$ criteria have been proposed for selecting robust designs with high estimation efficiency. However, approaches for finding robust designs with high prediction efficiency are rarely studied in the literature. In this paper, we propose the $P_α$ criterion and develop its approximation version for two-level designs, called the ${\tilde P_α}$ criterion. They are useful for selecting robust designs with high estimation, high prediction, or balanced estimation and prediction efficiency for projective submodels. Computational studies show that the ${\tilde P}_α$ criterion is a good approximation of the $P_α$ criterion and can reduce great computation time when we search designs over a wide range of models. The connection between the ${\tilde P_α}$ criterion and the generalized minimum aberration (GMA) criterion is studied. Result shows that ${\tilde P_α}$ plays a great role to link the alphabetic optimality criteria and the aberration-based criteria.

Explore related subjects

Keep this discovery

BibTeXRIS

Chang-Yun Lin. 2016-04-13. Robust designs to model uncertainty with high estimation and prediction efficiency. https://arxiv.org/abs/1604.03802

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO