Maximin design on non hypercube domains and kernel interpolation

From MaRDI portal
Publication:693295

DOI10.1007/S11222-011-9273-9zbMATH Open1252.62078arXiv1004.0784OpenAlexW2088677675WikidataQ60461476 ScholiaQ60461476MaRDI QIDQ693295FDOQ693295

Pierre Barbillon, Jean-Michel Marin, Yves Auffray

Publication date: 7 December 2012

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: In the paradigm of computer experiments, the choice of an experimental design is an important issue. When no information is available about the black-box function to be approximated, an exploratory design have to be used. In this context, two dispersion criteria are usually considered: the minimax and the maximin ones. In the case of a hypercube domain, a standard strategy consists of taking the maximin design within the class of Latin hypercube designs. However, in a non hypercube context, it does not make sense to use the Latin hypercube strategy. Moreover, whatever the design is, the black-box function is typically approximated thanks to kernel interpolation. Here, we first provide a theoretical justification to the maximin criterion with respect to kernel interpolations. Then, we propose simulated annealing algorithms to determine maximin designs in any bounded connected domain. We prove the convergence of the different schemes.


Full work available at URL: https://arxiv.org/abs/1004.0784




Recommendations




Cites Work


Cited In (10)

Uses Software





This page was built for publication: Maximin design on non hypercube domains and kernel interpolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693295)