My name is Max. I am a PhD student supervised by Prof. Thomas Gärtner in the machine learning research unit at TU Wien, Austria. Before that, I studied computer science at the University of Bonn under the supervision of Dr. Tamás Horváth. My main research interest is active and semi-supervised learning. The goal is to achieve novel sample and query complexity bounds for learning tasks on graphs using convexity theory. Additionally, I am working on graph representations that go beyond the Weisfeiler-Leman isomorphism test.
PhD in Computer Science, 2020 — Present
TU Wien, Austria
MSc in Computer Science, 2020
University of Bonn, Germany
BSc in Computer Science, 2017
University of Bonn, Germany
[Jun 2022] I am visiting Marco Bressan and Nicolò Cesa-Bianchi at the University of Milan.
[Mai 2022] We are organising the Mining and Learning with Graphs workshop (MLG) at ECMLPKDD in Grenoble. Submit your work!
[Mai 2022] I am attending the the Hausdorff School on Algorithmic Data Analysis at University of Bonn.
[Apr 2022] I got invited to and attended G-Research’s Spring Insights Week.
[Mar 2022] Our master’s student Fabian Jogl got his paper “Reducing Learning on Cell Complexes to Graphs” accepted to GTRL@ICLR 2022.
[Mar 2022] I got invited to serve as a reviewer for ICML, NeurIPS, and ECMLPKDD.
[Sep 2021] Our paper “Active Learning of Convex Halfspaces on Graphs” got
accepted to NeurIPS 2021!
[Sep 2021] I attended the Ellis Doctoral Symposium EDS 2021.
[Aug 2021] I attended Taipei’s MLSS 2021 and won a best poster honorable mention!
[Jul 2021] In a team with David Penz and Joe Redshaw, we won Siemens’ AI Dependability Assessment challenge with the best practical result!
[Jul 2021] I attended the LogML 2021 summer school.
[Jul 2021] I attended the EEML 2021 summer school.