Learn More
We study the class of Azéma–Yor processes defined from a general semi-martingale with a continuous running supremum process. We show that they arise as unique strong solutions of the Bachelier stochastic differential equation which we prove is equivalent to the Drawdown equation. Solutions of the latter have the drawdown property: they always stay above a(More)
The optimization of expensive-to-evaluate functions generally relies on metamodel-based exploration strategies. Many deterministic global optimization algorithms used in the field of computer experiments are based on Kriging (Gaussian process regression). Starting with a spatial predictor including a measure of uncertainty, they proceed by iteratively(More)
Kriging-based exploration strategies often rely on a single Ordinary Kriging model which parametric covariance kernel is selected a priori or on the basis of an initial data set. Since choosing an unadapted kernel can radically harm the results, we wish to reduce the risk of model misspecification. Here we consider the simultaneous use of multiple kernels(More)
and RKHS of zero mean functions for model-based sensitivity analysis. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive(More)
We consider the problem of designing adapted kernels for approximating functions invariant under a known finite group action. We introduce the class of argumentwise invariant kernels, and show that they characterize centered square-integrable random fields with invariant paths, as well as Reproducing Kernel Hilbert Spaces of invariant functions. Two(More)
Our goal in the present work is to give an insight on some important questions to be asked when choosing a Kriging model for the analysis of numerical experiments. We are especially concerned about the cases where the size of the design of experiments is small relatively to the algebraic dimension of the inputs. We first fix the notations and recall some(More)
Load balancing constitutes a crucial task to realize for the performance of parallel applications. However it adds an overhead which, instead, can degrade the performance of the applications. Therefore, it is essential to decide when it is worthwhile to run the load balancing. This paper rst presents a probabilistic analysis of the time complexity of an(More)