Instead of the usual setup, we have organised a big virtual poster session where we saw lots of interesting posters about graph-related ideas, projects and papers. People could move around the space, drop into conversations, listen to pitches, and discuss — much more informal and exploratory!
This was open to everyone: whether they've been working on something for a while or wanted feedback on early-stage ideas.
We had the following posters:
Panthadeep Bhattacharjee, Sandeep Vidyapu:
BiMass: Towards Batch-incremental Clustering using Mass-based dissimilarity
Dmitry Eremeev Oleg Platonov Gleb Bazhenov Artem Babenko Liudmila Prokhorenkova:
GraphPFN: A Prior-Data Fitted Graph Foundation Model
Julia Gastinger, Thilo Dieing, Christian Meilicke, Heiner Stuckenschmidt:
A Temporal Knowledge Graph for Music Festival Lineup Forecasting
Lea Karbevska:
PACT: Paths, Activity and Contacts for temporal heterogeneous link prediction
Shrimon Mukherjee, Kishalay Das, Partha Basuchowdhuri, Pawan Goyal, Niloy Ganguly:
Latent Diffusion Pretraining for Crystal Property Prediction
Christian Meilicke, Rainer Gemulla, Julie Naegelen, Heiner Stuckenschmidt:
A Simple Baseline for Knowledge Base Completion
Paolo Pellizzoni, Till Hendrik Schulz, Karsten Borgwardt:
Graph Neural Networks Can (Often) Count Substructures
Oleg Platonov, Gleb Bazhenov, Dmitry Eremeev, Liudmila Prokhorenkova:
A Fair Evaluation of Graph Foundation Models for Node Property Prediction
Hamed Shirzad, Danica J. Sutherland:
Global Communication or Graph-Specific Memory?
This time, we will have a three-part presentation and discussion. Based on the paper below, we will look into
Oversmoothing
Homophily vs. Heterophily
Oversquashing
Each part will be a short presentation followed by an open discussion.
LLMs as GNNs (to understand how they generalize)
recording available on Youtube
Problems such as efficient (length) generalization are highly relevant for building agentic systems, yet they have puzzled LLM researchers for several years. However, they can sometimes be obvious through the lens of graph representation learning. This is because LLMs are, by their design, vulnerable to generalization issues from a variety of geometric perspectives.
A typical GNN researcher will already likely have a solid understanding of most of these perspectives! In this talk, we will use this knowledge, and attempt to scale the mountain of LLM generalization ⛰️
Discussion Session on the Future of Graph Learning Research
We want to use the February session to discuss what kind of research we want to do in graph learning in the next years and where we can make the most impact. Similar questions have already been discussed at length on big stages at various conferences. However, we think it is time to have this discussion with all graph learning enthusiasts, in particular (incoming) PhD students and postdocs who are actively shaping the field and whose research comprises the majority of what will be the field of graph learning in the next years. Whether you are excited, skeptical, curious, or frustrated about graph learning, we want to hear what you have to say!
Snir Hordan, Tal Amir, Nadav Dym
Jianan Zhao, Hesham Mostafa, Mikhail Galkin, Michael Bronstein, Zhaocheng Zhu, Jian Tang