Christopher Morris > Teaching WS 26/27 > Seminar (Master):

Machine learning on graphs, especially using graph neural networks (GNNs), has seen a surge in interest because graph data is widely available across a broad spectrum of disciplines, from life to social and engineering sciences. Despite their practical success, our theoretical understanding of the properties of GNNs remains incomplete. In this seminar, we will discuss current progress on the theoretical foundations of machine learning on graphs. This semester we focus on GNNs to execute and learn algorithms.

Requirements for Passing

To pass the seminar, you need to fulfill the following:
  1. Give a 30-minute talk about your assigned paper.
  2. Write a 12- to 15-page (excluding title page) detailed report about your assigned paper.
  3. Peer-review your fellow students' reports.
  4. Attend all meetings and actively participate; see below for dates.

Talks

At the end of the semester, each student will give a 30-minute-long talk about their assigned paper. You should provide an overview of your choosen/assigned paper and highlight the most important concepts and ideas. Ideally, your presentation should give the audience (i.e., your fellow students) a good understanding of your assigned paper.

Reports

The report gives a detailed overview of the choosen/assigned paper. The required report length is 12 to 15 pages, using the provided LaTeX template. This means that after you are assigned a paper, you write your report and submit it for "peer review" by your fellow students. You will receive constructive feedback to improve the paper; afterward, you will receive additional feedback from the seminar organizers. You can then submit an updated, final version, which will be graded. Note that this means that you will also have to write some short reviews on the reports by your fellow students.

Organization

  1. More details are given during the mandatory kick-off meeting.
  2. Papers will be assigned after the kick-off meeting.
  3. The long talks will be presented in a day-long block seminar.
  4. All meetings (kick-off, peer-review, and final talks) will take place in Room 228, Theaterstraße 35 - 39.

Dates

Date
14.10.2026, 11:00   Kick-off meeting (in person).
11.11.2026, 24:00 Submission of report drafts (draft of structure).
02.12.2026, 24:00 Submission of reports for peer review.
11.12.2026, 24:00 Submission of peer reviews.
16.12.2026, 12:00 Discussion of peer reviews (in person).
08.01.2027, 24:00 Submission of reports.
19.01.2027, 24:00 Feedback by the organizers.
03.02.2027, 12:00 Peer review of presentation slides (in person).
15.02.2027, 10:00 Talks (in person).
19.02.2027, 24:00 Submission of final reports.

Papers

You can choose papers from the following list.
  1. NN-Steiner: A Mixed Neural-Algorithmic Approach for the Rectilinear Steiner Minimum Tree Problem
  2. Positional Attention: Expressivity and Learnability of Algorithmic Computation
  3. Learning to Approximate Uniform Facility Location via Graph Neural Networks
  4. When Do Transformers Learn Heuristics for Graph Connectivity
  5. Transformers, parallel computation, and logarithmic depth
  6. Depth-Width tradeoffs in Algorithmic Reasoning of Graph Tasks with Transformers
  7. Geometric Algorithms for Neural Combinatorial Optimization with Constraints