Boot camp on graph foundations models

Boot camp on graph foundations models

🎙 Mikhail Galkin 👥 75K 📅 August 21, 2025 ⏱ 76 min 👁 1K 📄 expert opinion 🧭 2026-08-06
Available in: English (current) Français

Keywords

graph foundation modelslink predictionnode classificationinductive learninglabeling tricks

Summary

Mikhail Galkin from Google Research presents an overview of graph foundation models, focusing on the challenges of generalization across different graphs and tasks. He begins by contrasting traditional end-to-end training with the goal of a single model that can handle diverse datasets and tasks. Key challenges include heterogeneous features, varying graph structures, and different task types. He discusses the importance of inductive learning and labeling tricks, citing Neural Bellman-Ford (NBFNet) as a key method for link prediction. He introduces the idea of building a graph of relations to handle new edge types at inference time. The talk also touches on the broader relevance of graph learning and the need for foundational setups to keep the field competitive. He mentions two position papers, including one at ICML 2025, advocating for a shift in graph learning research. The talk concludes with a glimpse into new work, though details are limited.

148 words

Critical Evaluation

The talk provides a valuable overview of the emerging field of graph foundation models, a topic of growing importance in AI research. Galkin, a researcher at Google Research, brings credibility and practical insights from industry applications. The content is technically rigorous, referencing specific methods like Neural Bellman-Ford and labeling tricks, and situates them within the broader context of graph learning. The argumentation is coherent: he identifies key challenges (heterogeneous features, generalization across tasks and structures) and proposes potential solutions, such as building a graph of relations to enable zero-shot inference on new edge types. The talk is well-structured, with clear sections and a logical flow. However, it is a high-level overview rather than a deep dive; some concepts are introduced but not fully elaborated, and the new work mentioned is only briefly described. The sources cited are primarily the speaker’s own papers and the position papers, which are appropriate but not diverse. The talk is aimed at an audience familiar with graph learning, but it does not assume deep expertise, making it accessible to a broader technical audience. The title accurately reflects the content. Overall, the talk is informative and thought-provoking, but it leaves some questions unanswered and would benefit from more concrete examples or case studies. The lack of a formal Q&A or discussion limits the depth of exploration. Nevertheless, it serves as a good introduction to the topic and highlights important research directions.

235 words

Title / Content Match

The title accurately reflects the content, which is a tutorial-like overview of graph foundation models, their challenges, and recent advances.

Quality & Reliability

8/10

The talk is given by a researcher from Google Research, presenting established and ongoing work in graph foundation models. The content is technically sound, references specific papers and methods, and includes a position paper published at ICML. However, it is a talk, not a peer-reviewed publication, and some claims are forward-looking.

Key Moments

Cited Sources

Concurring Sources

Dissenting Sources

Contribution & Novelties

The talk provides a synthesis of recent advances in graph foundation models, emphasizing the shift from task-specific training to generalizable models. It highlights the importance of inductive learning and labeling tricks, and introduces the concept of a graph of relations to handle new edge types. The talk also advocates for a foundational setup in graph learning research, as outlined in the ICML 2025 position paper.

Pour aller plus loin :

105 words

Radar Profile

The radar profile shows high scores in information quantity, quality, and technical level, indicating a dense and informative talk. The reliability score is also high, reflecting the speaker's expertise and the use of established methods. The overall balance suggests a well-rounded presentation with strong technical depth.

Reliability 8/10

💬 No comments were provided for analysis.