{"id":7686,"date":"2026-10-02T10:57:42","date_gmt":"2026-10-02T08:57:42","guid":{"rendered":"https:\/\/samovar.telecom-sudparis.eu\/?p=7686"},"modified":"2026-10-02T10:57:42","modified_gmt":"2026-10-02T08:57:42","slug":"avis-de-soutenance-de-monsieur-francois-bertholom","status":"publish","type":"post","link":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/2026\/10\/02\/avis-de-soutenance-de-monsieur-francois-bertholom\/","title":{"rendered":"AVIS DE SOUTENANCE de Monsieur Fran\u00e7ois BERTHOLOM"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">L&rsquo;Ecole doctorale : Math\u00e9matiques Hadamard<br><br>et le Laboratoire de recherche SAMOVAR &#8211; Services r\u00e9partis, Architectures, Mod\u00e9lisation, Validation, Administration des R\u00e9seaux<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">pr\u00e9sentent<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">l\u2019AVIS DE SOUTENANCE de Monsieur Fran\u00e7ois BERTHOLOM<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\">Autoris\u00e9 \u00e0 pr\u00e9senter ses travaux en vue de l\u2019obtention du Doctorat de l&rsquo;Institut Polytechnique de Paris, pr\u00e9par\u00e9 \u00e0 l&rsquo;Institut Polytechnique de Paris T\u00e9l\u00e9com SudParis en :<\/p>\n\n\n\n<h1 class=\"wp-block-heading\">\u00ab Th\u00e9orie et Algorithmes d\u2019Inf\u00e9rence Approch\u00e9e avec des Familles Exponentielles \u00bb<\/h1>\n\n\n\n<p class=\"wp-block-paragraph\">le MARDI 13 OCTOBRE 2026 \u00e0 14h00<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">\u00e0<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Amphith\u00e9\u00e2tre 2<br>19 Place Marguerite Perey, 91120 Palaiseau<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Membres du jury :<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>M. Randal&nbsp;DOUC<\/strong>, Professeur, Institut Polytechnique de Paris T\u00e9l\u00e9com SudParis, FRANCE &#8211; Directeur de th\u00e8se<br><strong>M. Victor&nbsp;ELVIRA<\/strong>, Professor, School of Mathematics, University of Edinburgh, ROYAUME-UNI &#8211; Rapporteur<br><strong>M. Julyan&nbsp;ARBEL<\/strong>, Charg\u00e9 de recherche, INRIA Grenoble, FRANCE &#8211; Rapporteur<br><strong>Mme C\u00e9line&nbsp;L\u00e9VY-LEDUC<\/strong>, Professeure des universit\u00e9s, Universit\u00e9 Paris Cit\u00e9 (UFR de math\u00e9matiques), FRANCE &#8211; Examinateur<br><strong>M. Nicolas&nbsp;CHOPIN<\/strong>, Professeur, ENSAE, FRANCE &#8211; Examinateur<\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Invit\u00e9 :&nbsp;<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>M. Fran\u00e7ois ROUEFF<\/strong>, Professeur, Institut Polytechnique de Paris T\u00e9l\u00e9com Paris, FRANCE &#8211; Co-directeur de th\u00e8se<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">\u00ab Th\u00e9orie et Algorithmes d\u2019Inf\u00e9rence Approch\u00e9e avec des Familles Exponentielles \u00bb<\/h2>\n\n\n\n<h2 class=\"wp-block-heading\">pr\u00e9sent\u00e9 par Monsieur Fran\u00e7ois BERTHOLOM<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>R\u00e9sum\u00e9 :<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\">De nombreuses questions en statistique, en apprentissage automatique et en sciences physiques se ram\u00e8nent au calcul d&rsquo;esp\u00e9rances pour lesquelles il n&rsquo;existe pas de forme close. Ce d\u00e9fi se pose en particulier dans deux grandes classes de probl\u00e8mes : l&rsquo;inf\u00e9rence bay\u00e9sienne, o\u00f9 la distribution cible est connue \u00e0 une constante de normalisation pr\u00e8s, et la mod\u00e9lisation g\u00e9n\u00e9rative, o\u00f9 elle n&rsquo;est accessible qu&rsquo;au travers d&rsquo;\u00e9chantillons. Cette th\u00e8se d\u00e9veloppe th\u00e9orie et algorithmes pour trois strat\u00e9gies compl\u00e9mentaires permettant de relever ce d\u00e9fi : l&rsquo;inf\u00e9rence variationnelle, la mod\u00e9lisation g\u00e9n\u00e9rative, et les m\u00e9thodes de Monte Carlo par cha\u00eenes de Markov. La premi\u00e8re partie pose le cadre des probl\u00e8mes et introduit des outils importants qui serviront tout au long du manuscrit. En particulier, nous explorons certaines propri\u00e9t\u00e9s fondamentales des familles exponentielles. La deuxi\u00e8me partie \u00e9tudie des m\u00e9thodes de minimisation d&rsquo;alpha-divergences dans le cas o\u00f9 la famille variationnelle est un mod\u00e8le exponentiel. L&rsquo;algorithme central est une proc\u00e9dure it\u00e9rative dont le but est de faire correspondre les moments de la distribution variationnelle et d&rsquo;une cible particuli\u00e8re. Nous \u00e9tablissons une analyse d\u00e9taill\u00e9e de la convergence de l&rsquo;AM dans un cadre d\u00e9terministe, et nous proposons ensuite deux extensions au cadre stochastique. Dans le contexte de l&rsquo;approximation stochastique, nous introduisons une variante utilisant des estimateurs sans biais. Nous d\u00e9veloppons \u00e9galement un cadre d&rsquo;Approximation par Moyenne Empirique, qui fixe des \u00e9chantillons au d\u00e9but de la proc\u00e9dure d&rsquo;optimisation. La troisi\u00e8me partie aborde la mod\u00e9lisation g\u00e9n\u00e9rative sous l&rsquo;angle de l&rsquo;inf\u00e9rence variationnelle. Nous rappelons d&rsquo;abord l&rsquo;\u00e9quivalence formelle entre les auto-encodeurs variationnels hi\u00e9rarchiques (HVAEs) et les mod\u00e8les de diffusion, en mobilisant divers arguments de la litt\u00e9rature existante. Nous apportons une validation empirique originale des r\u00e9sultats th\u00e9oriques sur plusieurs jeux de donn\u00e9es. Nous introduisons ensuite M-Star, une m\u00e9thode de diffusion permettant d&rsquo;utiliser des distributions de familles exponentielles dans le processus de bruitage. Les m\u00e9thodes pr\u00e9c\u00e9demment propos\u00e9es pour d\u00e9passer la limite des mod\u00e8les se basant sur des bruits gaussiens n\u00e9cessitaient de nouveaux calculs pour chaque type de distribution, ou pr\u00e9sentaient des instabilit\u00e9s num\u00e9riques. Nous proposons d&rsquo;apprendre une projection markovienne d&rsquo;un processus de bruitage non-markovien, con\u00e7u pour un bruit non-gaussien. Par sa g\u00e9n\u00e9ralit\u00e9, la m\u00e9thode est applicable \u00e0 des g\u00e9om\u00e9tries contraintes et \u00e0 des donn\u00e9es directionnelles, des situations dans lesquelles il ne serait pas viable d&rsquo;utiliser des distributions gaussiennes. Une riche \u00e9tude exp\u00e9rimentale confirme la validit\u00e9 de la m\u00e9thode propos\u00e9e. La quatri\u00e8me partie compare des m\u00e9thodes de Monte-Carlo par cha\u00eene de Markov utilisant des propositions ind\u00e9pendantes. Nous \u00e9tudions trois noyaux \u00e0 essais multiples, le Multiple-Try Metropolis with Independent Balancing (MIB), le Multiple-Try Metropolis with Independent Sampling (MIS) et l&rsquo;Iterated Sampling Importance Resampling (ISIR), et \u00e9tablissons une hi\u00e9rarchie th\u00e9orique stricte entre eux au sens de l&rsquo;ordre de Peskun. Nous montrons en particulier que MIS domine \u00e0 la fois MIB et ISIR. Nous obtenons des vitesses de convergence exactes pour chacun de ces noyaux lorsque les poids d&rsquo;importance sont born\u00e9s, et montrons qu&rsquo;ils ne peuvent jamais \u00eatre g\u00e9om\u00e9triquement ergodiques lorsque ces poids sont non born\u00e9s. Or, cette situation correspond au r\u00e9gime pratique le plus courant. Cette limitation motive l&rsquo;\u00e9tude de l&rsquo;Independent Importance Markov Chain (IIMC), qui repose sur une structure de renouvellement dans un espace d&rsquo;\u00e9tats augment\u00e9. Pour ce noyau, nous prouvons qu&rsquo;une simple condition de moment exponentiel suffit \u00e0 garantir l&rsquo;ergodicit\u00e9 g\u00e9om\u00e9trique, tandis que l&rsquo;ergodicit\u00e9 polynomiale repose sur une condition de moment polynomial pour les poids d&rsquo;importance.<br><strong>Abstract :<\/strong><\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Many problems in statistics, machine learning, and the physical sciences reduce to computing expectations under intractable probability distributions. This thesis develops theory and algorithms for three complementary strategies to tackle this challenge: variational inference, generative modeling, and Markov Chain Monte-Carlo. The first part frames the problems and introduces important tools that will be used throughout the manuscript, in particular we focus on some properties of exponential families. The second part studies alpha-divergence minimization methods over exponential family variational distributions. The central algorithm is an iterative moment-matching scheme. We establish a detailed convergence analysis of the MA in a deterministic setting, and we propose two extensions to the stochastic setting. In the context of Stochastic Approximation, we introduce an unbiased stochastic variant. We also develop a Sample Average Approximation framework. The third part turns to generative modeling through the lens of variational inference. We first recall the formal equivalence between Hierarchical Variational Auto-Encoders (HVAEs) and diffusion models, invoking various arguments found in the existing literature to show that diffusion models arise as the infinite-depth limit of properly parameterized HVAEs. We provide novel empirical validation across several benchmark datasets. We then introduce M-Star, a diffusion framework that allows the noising process to use general exponential family distributions. The key idea is to learn a Markovian projection of a non-Markovian forward process designed for non-Gaussian noise, which makes the framework applicable to constrained geometries and directional data without requiring bespoke derivations for each target distribution. Extensive experiments confirm the validity of this new method. The fourth part compares Monte-Carlo methods based on independent proposals. We study three multiple-try kernels, the Multiple-Try Metropolis with Independent Balancing (MIB), the Multiple-Try Metropolis with Independent Sampling (MIS), and Iterated Sampling Importance Resampling (ISIR); and establish theoretical strict hierarchy among them via the Peskun ordering. Specifically, we show that MIS dominates both MIB and ISIR. We derive exact convergence rates for all three kernels when importance weights are bounded, and show that they fail to be geometrically ergodic when weights are unbounded. This limitation motivates the study of the Independent Importance Markov Chain, for which we prove geometric ergodicity under an exponential moment condition, and polynomial ergodicity under a polynomial moment condition. The results of this thesis are supported by publications at NeurIPS 2024, AISTATS 2026, ICLR 2026, and ICML 2026, as well as an unpublished paper currently under review.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>L&rsquo;Ecole doctorale : Math\u00e9matiques Hadamard et le Laboratoire de recherche SAMOVAR &#8211; Services r\u00e9partis, Architectures, Mod\u00e9lisation, Validation, Administration des R\u00e9seaux pr\u00e9sentent l\u2019AVIS DE SOUTENANCE de Monsieur Fran\u00e7ois BERTHOLOM Autoris\u00e9 \u00e0 pr\u00e9senter ses travaux en vue de l\u2019obtention du Doctorat de l&rsquo;Institut Polytechnique de Paris, pr\u00e9par\u00e9 \u00e0 l&rsquo;Institut Polytechnique de Paris T\u00e9l\u00e9com SudParis en : \u00ab [&hellip;]<\/p>\n","protected":false},"author":4,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"ocean_front_end_style_editor":"no","ocean_post_layout":"","ocean_both_sidebars_style":"","ocean_both_sidebars_content_width":0,"ocean_both_sidebars_sidebars_width":0,"ocean_sidebar":"","ocean_second_sidebar":"","ocean_disable_margins":"enable","ocean_add_body_class":"","ocean_shortcode_before_top_bar":"","ocean_shortcode_after_top_bar":"","ocean_shortcode_before_header":"","ocean_shortcode_after_header":"","ocean_has_shortcode":"","ocean_shortcode_after_title":"","ocean_shortcode_before_footer_widgets":"","ocean_shortcode_after_footer_widgets":"","ocean_shortcode_before_footer_bottom":"","ocean_shortcode_after_footer_bottom":"","ocean_display_top_bar":"default","ocean_display_header":"default","ocean_header_style":"","ocean_center_header_left_menu":"","ocean_custom_header_template":"","ocean_custom_logo":0,"ocean_custom_retina_logo":0,"ocean_custom_logo_max_width":0,"ocean_custom_logo_tablet_max_width":0,"ocean_custom_logo_mobile_max_width":0,"ocean_custom_logo_max_height":0,"ocean_custom_logo_tablet_max_height":0,"ocean_custom_logo_mobile_max_height":0,"ocean_header_custom_menu":"","ocean_menu_typo_font_family":"","ocean_menu_typo_font_subset":"","ocean_menu_typo_font_size":0,"ocean_menu_typo_font_size_tablet":0,"ocean_menu_typo_font_size_mobile":0,"ocean_menu_typo_font_size_unit":"px","ocean_menu_typo_font_weight":"","ocean_menu_typo_font_weight_tablet":"","ocean_menu_typo_font_weight_mobile":"","ocean_menu_typo_transform":"","ocean_menu_typo_transform_tablet":"","ocean_menu_typo_transform_mobile":"","ocean_menu_typo_line_height":0,"ocean_menu_typo_line_height_tablet":0,"ocean_menu_typo_line_height_mobile":0,"ocean_menu_typo_line_height_unit":"","ocean_menu_typo_spacing":0,"ocean_menu_typo_spacing_tablet":0,"ocean_menu_typo_spacing_mobile":0,"ocean_menu_typo_spacing_unit":"","ocean_menu_link_color":"","ocean_menu_link_color_hover":"","ocean_menu_link_color_active":"","ocean_menu_link_background":"","ocean_menu_link_hover_background":"","ocean_menu_link_active_background":"","ocean_menu_social_links_bg":"","ocean_menu_social_hover_links_bg":"","ocean_menu_social_links_color":"","ocean_menu_social_hover_links_color":"","ocean_disable_title":"default","ocean_disable_heading":"default","ocean_post_title":"","ocean_post_subheading":"","ocean_post_title_style":"","ocean_post_title_background_color":"","ocean_post_title_background":0,"ocean_post_title_bg_image_position":"","ocean_post_title_bg_image_attachment":"","ocean_post_title_bg_image_repeat":"","ocean_post_title_bg_image_size":"","ocean_post_title_height":0,"ocean_post_title_bg_overlay":0.5,"ocean_post_title_bg_overlay_color":"","ocean_disable_breadcrumbs":"default","ocean_breadcrumbs_color":"","ocean_breadcrumbs_separator_color":"","ocean_breadcrumbs_links_color":"","ocean_breadcrumbs_links_hover_color":"","ocean_display_footer_widgets":"default","ocean_display_footer_bottom":"default","ocean_custom_footer_template":"","ocean_post_oembed":"","ocean_post_self_hosted_media":"","ocean_post_video_embed":"","ocean_link_format":"","ocean_link_format_target":"self","ocean_quote_format":"","ocean_quote_format_link":"post","ocean_gallery_link_images":"on","ocean_gallery_id":[],"footnotes":""},"categories":[286,615],"tags":[],"class_list":["post-7686","post","type-post","status-publish","format-standard","hentry","category-fractualites-ennews-fr","category-seminaire-sop","entry"],"_links":{"self":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/posts\/7686","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/users\/4"}],"replies":[{"embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/comments?post=7686"}],"version-history":[{"count":1,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/posts\/7686\/revisions"}],"predecessor-version":[{"id":7687,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/posts\/7686\/revisions\/7687"}],"wp:attachment":[{"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/media?parent=7686"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/categories?post=7686"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/samovar.telecom-sudparis.eu\/index.php\/wp-json\/wp\/v2\/tags?post=7686"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}