Aller au contenu. | Aller à la navigation

Outils personnels

Navigation

UMR 5672

logo de l'ENS de Lyon
logo du CNRS
Vous êtes ici : Accueil / Séminaires / Machine Learning and Signal Processing / Heat diffusion distance processes for graphs and their application to distribution shift detection

Heat diffusion distance processes for graphs and their application to distribution shift detection

Etienne Lasalle (PhD Student, Laboratoire de Mathématiques - Université Paris-Saclay - Orsay)
Quand ? Le 07/06/2022,
de 13:00 à 14:00
Participants Etienne Lasalle
Ajouter un événement au calendrier vCal
iCal

Title : Heat diffusion distance processes for graphs and their application to distribution shift detection

Asbtract :   When working with weighted graphs, one can interpret weights as the thermal conductivity of edges. Given initial conditions, the way heat diffuses can be used to compare graphs. Choosing relevant and informative diffusion times is often essential and challenging. To circumvent this issue, we choose to take into account the whole diffusion process. We define real-valued processes indexed by [0, T] for some T > 0, representing the comparisons for all diffusion times. Using tools from topological data analysis, we are able to compare graphs with unknown node correspondence or even graphs with different sizes. In this talk, I will introduce these processes and present their statistical properties. From these results, we will see how we can construct consistent two-sample tests. Then I will present some applications to the detection of distribution shifts in the context of neural networks by using activation graphs.

More information : https://elasalle.github.io

Exposé en salle M7 101 (ENS de Lyon, site Monod, 1er étage côté Recherche au M7)
 

Si vous voulez vous pourrez suivre la présentation en visio ici: 

Lien de la réunion:
https://inria.webex.com/inria/j.php?MTID=mdefb27b64338f0883136c1dc3b160ca9