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
Showing 2026Show all

5 papers · 1 filter

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…