Approximation of IMSE-optimal Designs via Quadrature Rules and Spectral Decomposition

@article{Gauthier2016ApproximationOI,
  title={Approximation of IMSE-optimal Designs via Quadrature Rules and Spectral Decomposition},
  author={Bertrand Gauthier and Luc Pronzato},
  journal={Communications in Statistics - Simulation and Computation},
  year={2016},
  volume={45},
  pages={1600 - 1612}
}
  • B. Gauthier, L. Pronzato
  • Published 23 April 2016
  • Mathematics, Computer Science
  • Communications in Statistics - Simulation and Computation
We address the problem of computing integrated mean-squared error (IMSE) optimal designs for interpolation of random fields with known mean and covariance. We assume that the mean squared error is integrated through a discrete measure and restrict the design space to its support. We show that the IMSE and its approximation by spectral truncation can be easily evaluated, which makes their global minimization affordable. Numerical experiments are carried out that illustrate the effectiveness of… Expand
Spectral Approximation of the IMSE Criterion for Optimal Designs in Kernel-Based Interpolation Models
TLDR
Numerical experiments are carried out and it is indicated that retaining a small number of eigenpairs is often sufficient to obtain good approximations of IMSE optimal quadrature-designs when optimizing the truncated criterion and that optimal quadRature- designs generally give efficient approximation of the true optimal designs for the quadratures approximation of the IMSE. Expand
Convex relaxation for IMSE optimal design in random-field models
TLDR
Convex optimisation, based on a quadrature approximation of the IMSE criterion and a discretisation of the design space, yields an optimal design in the form of a probability measure with finite support. Expand
Optimal Design for Prediction in Random Field Models via Covariance Kernel Expansions
We consider experimental design for the prediction of a realization of a second-order random field Z with known covariance function, or kernel, K. When the mean of Z is known, the integrated meanExpand
Optimal Design for Prediction in Random Field Models via Covariance Kernel Expansions
We consider experimental design for the prediction of a realization of a second-order random field Z with known covariance function, or kernel, K. When the mean of Z is known, the integrated meanExpand
The Nu Class of Low-Degree-Truncated Rational Multifunctions. Ia. MINOS for IMSPE Evaluation and Optimal-IMSPE-Design Search
We provide compact algebraic expressions that replace the lengthy symbolic-algebra-generated integrals I6 and I8 in Part I of this series of papers [1]. The MRSE entries of Part I, Table 4.3 are thusExpand
The Nu Class of Low-Degree-Truncated Rational Multifunctions. Ib. Integrals of Matern-correlation functions for all odd-half-integer class parameters
This paper is an extension of Parts I and Ia of a series about Nu-class multifunctions. We provide hand-generated algebraic expressions for integrals of single Matern-covariance functions, as well asExpand
Efficient prediction designs for random fields
TLDR
Two algorithms are proposed, one relying on stochastic optimization to explicitly identify the Pareto front, whereas the second uses the surrogate criteria as local heuristic to choose the points at which the (costly) true EK variance is effectively computed. Expand
Sequential design strategies for mean response surface metamodeling via stochastic kriging with adaptive exploration and exploitation
  • Xi Chen, Qiang Zhou
  • Computer Science
  • Eur. J. Oper. Res.
  • 2017
TLDR
It is shown that SK with the proposed strategies applied holds great promise for achieving high predictive accuracy by striking a good balance between exploration and exploitation. Expand

References

SHOWING 1-10 OF 14 REFERENCES
Spectral Approximation of the IMSE Criterion for Optimal Designs in Kernel-Based Interpolation Models
TLDR
Numerical experiments are carried out and it is indicated that retaining a small number of eigenpairs is often sufficient to obtain good approximations of IMSE optimal quadrature-designs when optimizing the truncated criterion and that optimal quadRature- designs generally give efficient approximation of the true optimal designs for the quadratures approximation of the IMSE. Expand
Spatial sampling design and covariance-robust minimax prediction based on convex design ideas
This paper presents new ideas on sampling design and minimax prediction in a geostatistical model setting. Both presented methodologies are based on regression design ideas. For this reason theExpand
Row Modifications of a Sparse Cholesky Factorization
TLDR
It is shown how the modification in the Cholesky factorization associated with this rank-2 modification of C can be computed efficiently using a sparse rank-1 technique developed in [T. A. Davis, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 606--627]. Expand
An Efficient Algorithm for Constructing Optimal Design of Computer Experiments
TLDR
A new algorithm for constructing optimal experimental designs is developed and is found to be much more efficient in terms of the computation time, the number of exchanges needed for generating new designs, and the achieved optimality criteria. Expand
Gaussian Processes for Machine Learning
TLDR
The treatment is comprehensive and self-contained, targeted at researchers and students in machine learning and applied statistics, and deals with the supervised learning problem for both regression and classification. Expand
Optimization by Simulated Annealing
TLDR
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems. Expand
Random number generation and Quasi-Monte Carlo methods
  • H. Niederreiter
  • Mathematics, Computer Science
  • CBMS-NSF regional conference series in applied mathematics
  • 1992
TLDR
This chapter discusses Monte Carlo methods and Quasi-Monte Carlo methods for optimization, which are used for numerical integration, and their applications in random numbers and pseudorandom numbers. Expand
Design and analysis of computer experiments
TLDR
The included papers present an interesting mixture of recent developments in the field as they cover fundamental research on the design of experiments, models and analysis methods as well as more applied research connected to real-life applications. Expand
Design and Modeling for Computer Experiments
TLDR
This book discusses models for computer experiments, design techniques, and some concepts in Experimental Design Computer Experiments. Expand
Combinatorial optimization by stochastic evolution
  • Y. Saab, V. Rao
  • Mathematics, Computer Science
  • IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
  • 1991
TLDR
Stochastic evolution can be specifically tailored to solve the network bisection, traveling salesman, and standard cell placement problems and Experimental results show that SE can produce better quality solutions than sophisticated simulated annealing (SA)-based heuristics in a much shorter computation time. Expand
...
1
2
...