Data-driven kernel representations for sampling with an unknown block dependence structure under correlation constraints

Résumé : The multidimensional Gaussian kernel-density estimation (G-KDE) is a powerful tool to identify the distribution of random vectors when the maximal information is a set of independent realizations. For these methods, a key issue is the choice of the kernel and the optimization of the bandwidth matrix. To optimize these kernel representations, two adaptations of the classical G-KDE are presented. First, it is proposed to add constraints on the mean and the covariance matrix in the G-KDE formalism. Secondly, it is suggested to separate in different groups the components of the random vector of interest that could reasonably be considered as independent. This block by block decomposition is carried out by looking for the maximum of a cross-validation likelihood quantity that is associated with the block formation. This leads to a tensorized version of the classical G-KDE. Finally, it is shown on a series of examples how these two adaptations can improve the nonparametric representations of the densities of random vectors, especially when the number of available realizations is relatively low compared to their dimensions.
Document type :
Journal articles
Liste complète des métadonnées

https://hal-upec-upem.archives-ouvertes.fr/hal-01634877
Contributor : Christian Soize <>
Submitted on : Tuesday, November 14, 2017 - 2:49:57 PM
Last modification on : Monday, October 15, 2018 - 3:54:03 PM
Document(s) archivé(s) le : Thursday, February 15, 2018 - 1:31:54 PM

File

publi-2017-JCSDA-perrin-soize-...
Files produced by the author(s)

Identifiers

Collections

Citation

Guillaume Perrin, Christian Soize, N. Ouhbi. Data-driven kernel representations for sampling with an unknown block dependence structure under correlation constraints. Computational Statistics & Data Analysis, 2018, 119, pp.139-154. ⟨10.1016/j.csda.2017.10.005⟩. ⟨hal-01634877⟩

Share

Metrics

Record views

241

Files downloads

112