Catégorie
The Palaisien Seminar

« Le Séminaire Palaisien » | Stephan Alaniz & Hugo Cui

Bandeau image
Séminaire Le Palaisien
Date de tri
Lieu de l'événement
Inria Saclay, Amphi Sophie Germain

Share

lkml
Chapo
The Palaisien Seminar brings together Saclay’s broad research community every first Tuesday of the month to discuss statistics and machine learning.
Contenu
Corps de texte

Each seminar session is divided into two scientific presentations, each lasting 40 minutes: 30 minutes for the presentation and 10 minutes for questions. Stephan Alaniz and Hugo Cui will lead the November 2026 session!

Registration is free but required, subject to availability. A buffet will be served following the seminar.

Nom de l'accordéon
Stephan Alaniz Explanation by Default, Fallible in Practice: Hallucinations and Bias in Multimodal Foundation Models
Texte dans l'accordéon

Multimodal Foundation Models have emerged across an increasing number of vision-language applications. Because they generate fluent text alongside visual representations, these systems offer natural explanations by default. At the same time, this coherence can obscure important model limitations. In this talk, I explore the opportunities of generative explanations, then focus on two failure modes: hallucinations and social biases. Finally, I outline prospective directions toward more robust explanations.

Nom de l'accordéon
Hugo Cui l Active learning in high dimensions: budget tradeoffs and optimal policies
Texte dans l'accordéon

In several domains (such as medical diagnostics, rare languages or scientific simulations) the cost of data annotation is high, and thus only a limited number of samples can be labeled and used for training. In such applications, it is instrumental to find, among a pool or a stream of unlabeled data, the most informative samples to label. We focus on linear classification, under Gaussian design, in the high-dimensional regime where the data dimension and the number of unlabeled samples grow proportionally. In the pool-based case, for small-margin selection policies, we derive a sharp asymptotic characterization of the test error. We uncover a fundamental tradeoff in how the labeling budget should be allocated across the different selection steps. In the online setting, we determine analytically and numerically the selection policies that minimize the cumulative cost of labeling and mistakes, or maximize the final accuracy. We then comment on the case of two-layer networks. Based on joint works with Yue M Lu, Francesca Mignacco and Francesco Mori.