Skip to main navigation Skip to main content Skip to page footer

HGS MathComp - Where Methods Meet Applications

The Heidelberg Graduate School of Mathematical and Computational Methods for the Sciences (HGS MathComp) at Heidelberg University is one of the leading graduate schools in Germany focusing on the complex topic of Scientific Computing. Located in a vibrant research environment, the school offers a structured interdisciplinary education for PhD students. The program supports students in pursuing innovative PhD projects with a strong application-oriented focus, ranging from mathematics, computer science, bio/life-sciences, physics, and chemical engineering sciences to cultural heritage. A strong focus is put on the mathematical and computational foundations: the theoretical underpinnings and computational abstraction and conception.

HGS MathComp Principal Investigators are leading experts in their fields, working on projects that combine mathematical and computational methodology with topical research issues. Individual mentoring for PhD candidates and career development programs ensure that graduates are fully equipped to take up top positions in industry and academia.

08.10.2026
09:00 - 17:00
Key Competences
Time and Project Management
Compact Courses

Speaker: Dr. Jan Stamm • impulsplus
Location: Online
Registration: Please register on the course website
Organizer: Graduate Academy
ECTS: 0.5
This course is part of the course program of the Graduate Academy. Please note that this course will be held in English.

The latest information and a registration link are available on the course website (log in with Uni-ID).

HGS MathComp fellows can get a reimbursement of the course fees. Please submit your proof of payment and certificate of participation to hgs@iwr.uni-heidelberg.de.

This workshop provides you with basic strategies and tools for an effective and efficient time and project-management. You will get specific ideas for improving your own approach towards organizing yourself and your work. The motto of the workshop is: Becoming a better, smarter, more focused time-manager is an evolution not a revolution. You already have a lot of the ideas and skills that you need. This workshop helps you to understand them in a deeper way and to commit yourself to really using them.

Contents in brief:
Successful project management (milestone plans vs. iterative incremental approach), basic strategies and tools for an efficient time and self-management (i.e. Pomodoro Technique, phases of productivity, implementation intentions), setting priorities, pragmatism and productivity).

Methods:
Input and discussion, individual and group work, coaching techniques.
 
12.10.2026 - 13.10.2026
09:30 - 18:00
Theory & Methods
Modern Shape-Constrained and Nonparametric Statistical Learning: Theory, Methods, and Applications
Compact Courses

Speaker: Prof. Richard Samworth • University of Cambridge
Location: Karlsruhe Institute of Technology
Registration: Please register on the event website • Registration open until 13 September 2026
Organizer: STAT & MathSEE/KCDS, KIT • HGS MathComp, Heidelberg University
ECTS: 1
The workshop is primarily intended for doctoral candidates and postdoctoral researchers from the KCDS Graduate School and the Heidelberg Graduate School MathComp, as well as members of the Helmholtz Association and researchers in related fields who have a strong interest in modern mathematical statistics.
Participants will gain insight into current developments in adaptive statistical methodology and their connections to broader challenges in statistical learning and modern data analysis.

The workshop and keynote lecture are organised by the Institute of Statistics (STAT) in cooperation with MathSEE / KCDS and HGS MathComp at Heidelberg University. We thank MathSEE/KCDS, HGS MathComp and HGF HIDA (Course Funding) for their generous support.

Workshop:
Building on familiar classical methods such as linear regression, the workshop will guide participants towards recent ideas in distributional adaptivity and explore their relevance to statistical learning and modern data analysis. Participants with a good understanding of classical statistical methods and an interest in mathematical statistics are warmly encouraged to join.

Keynote "Outrigger Local Polynomial Regression":
Date & Time: 13 October 2026, 16:30
Venue: NTI Lecture Hall, KIT Campus South
The talk will revisit the classical method of local polynomial regression from a modern perspective, showing how it can be adapted to the diverse error distributions encountered in contemporary applications. Along the way, it will introduce the main methodological ideas and explore the mathematical theory underlying the new approach.
 
15.10.2026
13:15
Theory & Methods
Joint Statistical Colloquium: Deep learning with missing data
Colloquium

Speaker: Prof. Richard Samworth • University of Cambridge
Location: Mathematikon • Common Room&Conference Room, Room 5/104, 5th Floor • Im Neuenheimer Feld 205, 69120 Heidelberg
Organizer: AG Mathematical Statsitics • HGS MathComp
ECTS: not yet determined
Dear HGS MathComp fellows / Dear IWR Members,
We are very happy to invite you to a special edition of our Statistical Colloquium on 15 October at 2.15pm in the Mathematikon conference room, featuring Richard Samworth (University of Cambridge).
Before the talk, there will be a Get-Together at 1.15pm in the common room for a lively exchange and to meet the speaker.
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.
Kind regards,
Hans Reimann, Statistics of Stochastic Processes Group, HGS MathComp Fellow Speaker

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.