Diese Seite ist nur auf Englisch verfügbar.

Statistical Colloquium Deep Learning With Missing Data

  • Termin in der Vergangenheit
  • Thursday, 15 October 2026, 15:15
  • Mathematikon • Common Room & Conference Room, 5th Floor • Im Neuenheimer Feld 205, 69120 Heidelberg
    • Prof. Richard Samworth • University of Cambridge (UK)

We are very happy to invite you to a special edition of our Statistical Colloquium on October 15 at 14:00 in the Mathematikon conference room, featuring Richard Samworth from University of Cambridge.

Before the talk, there will be a Get-Together at 13:15 in the common room for a lively exchange and to meet the speaker.

13:15 Get-Together (Common Room) 
14:15 Talk (Conference Room)

The talk is an addition to the HGS MathComp Joint Workshop at KIT earlier this week. Accordingly, we want to emphasise that everyone is welcome, and that this is a collaborative event between HGS MathComp, the IWR and the AG Mathematical Statistics.

Portrait of Richard Samworth in front of a mathematical background with interconnected dots and lines.

Abstract

In the context of multivariate nonparametric regression with missing covariates, we propose Pattern Embedded Neural Networks (PENNs), which can be applied in conjunction with any existing imputation technique. In addition to a neural network trained on the imputed data, PENNs pass the vectors of observation indicators through a second neural network to provide a compact representation. The outputs are then combined in a third neural network to produce final predictions. Our main theoretical result exploits an assumption that the observation patterns can be partitioned into cells on which the Bayes regression function behaves similarly, and belongs to a compositional Hölder class. It provides a finite-sample excess risk bound that holds for an arbitrary missingness mechanism, and in combination with a complementary minimax lower bound, demonstrates that our PENN estimator attains in typical cases the minimax rate of convergence as if the cells of the partition were known in advance, up to a poly-logarithmic factor in the sample size. Numerical experiments on simulated, semi-synthetic and real data confirm that the PENN estimator consistently improves, often dramatically, on standard neural networks without pattern embedding. Code to reproduce our experiments, as well as a tutorial on how to apply our method, is publicly available.