Institut de Mathématiques de Toulouse

Les événements de la journée


2 événements


  • MathOcéan

    Lundi 11 juin 14:00-16:00 - Anne-Laure Dalibard - Sorbonne Université

    Couches limites près des côtes ouest dans les bassins océaniques

    Lieu : Salle MIP, bâtiment 1R3, Université Paul Sabatier

    [En savoir plus]


  • Séminaire de Statistique

    Lundi 11 juin 16:00-17:00 - Olivier Roustant - Mines Saint Etienne

    Group kernels for Gaussian processes with categorical inputs

    Résumé : Gaussian processes (GP) are widely used to approximate time-consuming computer codes. A reason for their success is their ability in providing probabilistic models which interpolate the data in various frameworks. This is mostly done by choosing an appropriate covariance function, or kernel.
    We focus on problems involving categorical inputs, with a potentially large number L of levels (typically several tens), partitioned in G << L groups of various sizes. We investigate parsimonious kernels defined by block covariance matrices T with constant covariances between pairs of blocks and within blocks. First, we prove that the validity of such kernels is equivalent to the positive definiteness of a smaller matrix of size G, obtained by averaging each block. Second, the hierarchical group/level structure, equivalent to a nested Bayesian linear model, provides a parameterization of valid block matrices T ; In particular, the whole range of admissible negative correlations is covered. We also exhibit a wider class of kernels, obtained by relaxing the within-block structure, for which the same analysis can be done.
    The model is applied to a problem in nuclear waste analysis, where one of the categorical inputs is atomic number, which has more than 90 levels. We end by giving some connections with other hierarchical / multi-resolution GPs and next steps for future research.
    Keywords : Gaussian process, Categorical data, Hierarchical model, Multi-resolution, Computer experiment.

    Lieu : Salle 106, Bat 1R1

    [En savoir plus]