0
Colloques du Collège de France - Collège de France Télécharger l’app
Retour au podcast

Colloque - Clémentine Prieur : Diffeomorphism-Based Feature Learning Using Poincaré Inequalities

39 min 10 s

Colloques du Collège de France - Collège de France Colloque - Clémentine Prieur : Diffeomorphism-Based Feature Learning Using Poincaré Inequalities Prêt à écouter
0:00 39 min 10 s

Description de l’épisode

Yvon MadayChaire Informatique et sciences numériquesCollège de FranceAnnée 2025-2026Colloque : Aspects mathématiques et appliqués des méthodes de réduction de complexité - Clémentine Prieur : Diffeomorphism-Based Feature Learning Using Poincaré InequalitiesClémentine PrieurProfesseure, université Grenoble Alpes, LJK, équipe/projet Inria AIRSEARésuméJoint work with Romain Verdière (Inria Grenoble) and Olivier Zahm (Inria Grenoble).During this talk, I will present a gradient-enhanced algorithm for high-dimensional function approximation which achieves outperforming accuracy on small data sets.This algorithm, introduced in [1], proceeds in two steps: first, we reduce the input dimension by learning the relevant input features from gradient evaluations and, second, we regress the function output against the pre-learnt features. Specifically, we learn the feature map by minimizing an error bound obtained using Poincaré inequality applied either in input space or in feature space.This results in two different strategies which we compare both theoretically and numerically, and which we position in relation to existing methods from the literature. In particular, we prove that if we seek the nonlinear feature map as the first components of a C1-diffeomorphism, then our strategy is theoretically guaranteed. Our strategy to learn the C1-diffeomorphism is based on coupling flows, a particular class of invertible neural networks defined as the composition of block-triangular maps.Finally I will present several numerical experiments to demonstrate that the algorithm we propose outperforms the state-of-the-art competitors in terms of accuracy with little data sets.