← Search

Gérard Biau

8 accepted papers

2026

Fast kernel methods: Sobolev, physics-informed, and additive models

ICML 2026poster

Kernel methods are powerful tools in statistical learning, but their cubic complexity in the sample size $n$ limits their use on large-scale datasets. In this work, we introduce a scalable framework for kernel regression with complexity $O(n \log n)$, fully leveraging GPU acceleration. The approach …

Cited by 0SourceScholar
2026

Optimal Stopping in Latent Diffusion Models

ICML 2026poster

We identify and analyze a surprising phenomenon of $\textit{Latent}$ Diffusion Models (LDMs) where the final steps of the diffusion can $\textit{degrade}$ sample quality. In contrast to conventional arguments that justify early stopping for numerical stability, this phenomenon is intrinsic to the di…

Cited by 0SourceScholar
2025

Attention layers provably solve single-location regression

ICLR 2025poster

Attention-based models, such as Transformer, excel across various tasks but lack a comprehensive theoretical understanding, especially regarding token-wise sparsity and internal linear representations. To address this gap, we introduce the single-location regression task, where only one token in a s…

2024

Implicit regularization of deep residual networks towards neural ODEs

ICLR 2024spotlight

Residual neural networks are state-of-the-art deep learning models. Their continuous-depth analog, neural ordinary differential equations (ODEs), are also widely used. Despite their success, the link between the discrete and continuous models still lacks a solid mathematical foundation. In this arti…

2022

SHAFF: Fast and consistent SHApley eFfect estimates via random Forests

AISTATS 2022poster

Interpretability of learning algorithms is crucial for applications involving critical decisions, and variable importance is one of the main interpretation tools. Shapley effects are now widely used to interpret both tree ensembles and neural networks, as they can efficiently handle dependence and i…

2021

Framing RNN as a kernel method: A neural ODE approach

NeurIPS 2021oral

Building on the interpretation of a recurrent neural network (RNN) as a continuous-time neural differential equation, we show, under appropriate conditions, that the solution of a RNN can be viewed as a linear function of a specific feature set of the input sequence, known as the signature. This con…

2021

Interpretable Random Forests via Rule Extraction

AISTATS 2021poster

We introduce SIRUS (Stable and Interpretable RUle Set) for regression, a stable rule learning algorithm, which takes the form of a short and simple list of rules. State-of-the-art learning algorithms are often referred to as “black boxes” because of the high number of operations involved in their pr…

Cited by 95SourcePDFScholar
2021

Wasserstein Random Forests and Applications in Heterogeneous Treatment Effects

AISTATS 2021poster

We present new insights into causal inference in the context of Heterogeneous Treatment Effects by proposing natural variants of Random Forests to estimate the key conditional distributions. To achieve this, we recast Breiman’s original splitting criterion in terms of Wasserstein distances between e…