activity
20172026
most citedNeuMiss networks: differentiable programming for supervised learning with missing values

25 citations · 39 across the 9 of their papers we have counts for

collaborators

11 papers

stat.ML2026

SurvICL: a Foundation Model for in-context Survival Analysis

Julie Alberge, Linus Bleistein, Judith Abécassis +3

Tabular foundation models (TFMs) now outperform gradient-boosted trees in classification and regression. Yet in survival analysis, which predicts when an event occurs from censored…

cs.LG2026

TILE: Bridging LLMs and Table Foundation Models for Tabular Learning with Strings

Félix Lefebvre, David Holzmüller, Gioia Blayer +3

Real-world tables are often heterogeneous, combining numerical features with free-form string columns. Table foundation models (TFMs) excel on numerical tables but require strings…

cs.LG2026

Tailoring Strictly Proper Scoring Rules for Downstream Tasks: An Application to Causal Inference

Roman Plaud, Alexandre Perez-Lebel, Antoine Saillenfest +4

Probabilistic models are typically trained using task-agnostic objectives like log-loss, which can lead to significant errors in downstream estimation. This disconnect is especiall…

cs.LG2026

STRABLE: Benchmarking Tabular Machine Learning with Strings

Gioia Blayer, Myung Jun Kim, Félix Lefebvre +8

Benchmarking tabular learning has revealed the benefit of dedicated architectures, pushing the state of the art. But real-world tables often contain string entries, beyond numbers,…

cs.LG2026★ 2 cited

TabICLv2: A better, faster, scalable, and open tabular foundation model

Jingang Qu, David Holzmüller, Gaël Varoquaux +1

Tabular foundation models, such as TabPFNv2 and TabICL, have recently dethroned gradient-boosted trees at the top of predictive benchmarks, demonstrating the value of in-context le…

cs.LG2025

Decision from Suboptimal Classifiers: Excess Risk Pre- and Post-Calibration

Alexandre Perez-Lebel, Gael Varoquaux, Sanmi Koyejo +2

Probabilistic classifiers are central for making informed decisions under uncertainty. Based on the maximum expected utility principle, optimal decision rules can be derived using…

cs.LG2025★ 9 cited

TabICL: A Tabular Foundation Model for In-Context Learning on Large Data

Jingang Qu, David Holzmüller, Gaël Varoquaux +1

The long-standing dominance of gradient-boosted decision trees on tabular data is currently challenged by tabular foundation models using In-Context Learning (ICL): setting the tra…

cs.AI2024★ 3 cited

Imputation for prediction: beware of diminishing returns

Marine Le Morvan, Gaël Varoquaux

Missing values are prevalent across various fields, posing challenges for training and deploying predictive models. In this context, imputation is a common practice, driven by the…

cs.LG2022

Benchmarking missing-values approaches for predictive models on health databases

Alexandre Perez-Lebel, Gaël Varoquaux, Marine Le Morvan +2

BACKGROUND: As databases grow larger, it becomes harder to fully control their collection, and they frequently come with missing values: incomplete observations. These large databa…

cs.LG2020★ 25 cited

NeuMiss networks: differentiable programming for supervised learning with missing values

Marine Le Morvan, Julie Josse, Thomas Moreau +2

The presence of missing values makes supervised learning much more challenging. Indeed, previous work has shown that even when the response is a linear function of the complete dat…

stat.ML2017

Supervised Quantile Normalisation

Marine Le Morvan, Jean-Philippe Vert

Quantile normalisation is a popular normalisation method for data subject to unwanted variations such as images, speech, or genomic data. It applies a monotonic transformation to t…