Portrait of Guy Wolf

Guy Wolf

Core Academic Member
Canada CIFAR AI Chair
Full Professor, Université de Montréal, Department of Mathematics and Statistics
Concordia University
CHUM - Montreal University Hospital Center
Research Topics
Data Mining
Deep Learning
Dynamical Systems
Graph Neural Networks
Information Retrieval
Learning on Graphs
Machine Learning Theory
Medical Machine Learning
Molecular Modeling
Multimodal Learning
Representation Learning
Spectral Learning

Biography

Guy Wolf is a Full Professor in the Department of Mathematics and Statistics (DMS) at the Université de Montréal (UdeM), a Canada CIFAR AI Chair & Core Academic Member at Mila (the Quebec AI institute), an Associate Researcher with CRCHUM (the Montreal university hospital research center), and a participating PI in the Helmholtz International Lab for Causal Cell Dynamics.

In 2024 he has been awarded a Humboldt Experienced Research Fellowship, as part of which he was a visiting professor at Heidelberg University (2024) and Helmholtz Munich (2024-2026) in Germany. Prior to joining UdeM and Mila, he was a Gibbs Assistant Professor (2015-2018) in the Applied Math Program and an Associate Research Scientist in the Department of Genetics (2018) at Yale University (CT, USA). Previously, he was a Postdoctoral Researcher (2013-2015) in the Department of Computer Science at École Normale Supérieure in Paris (France). He holds a Ph.D. in Computer Science from Tel Aviv University (Israel), and has five years of prior experience in IT software design & development for data analysis in military settings.

His current research focuses on guided representation learning for data exploration, including methods that leverage manifold learning and geometric deep learning for dimensionality reduction, visualization, denoising, data augmentation, and coarse graining. While relevant for a wide range of applications, he is particularly interested in the intersection of AI & health, including tools supporting exploratory analysis of biomedical data, e.g., in single-cell multiomics, drug discovery, and neuroscience.

Current Students

PhD - Université de Montréal
Collaborating researcher - University of Tübingen
Master's Research - Université de Montréal
Co-supervisor :
Master's Research - Concordia University
Principal supervisor :
Collaborating Alumni - Université de Montréal
PhD - Concordia University
Principal supervisor :
PhD - Université de Montréal
Independent visiting researcher - Helmholtz Munich
PhD - Université de Montréal
Co-supervisor :
Master's Research - Concordia University
Principal supervisor :
PhD - Université de Montréal
PhD - Université de Montréal
Co-supervisor :
Postdoctorate - Concordia University
Principal supervisor :
PhD - Université de Montréal
PhD - Concordia University
Principal supervisor :
Collaborating researcher - BYU
Master's Research - Université de Montréal
PhD - Université de Montréal
Principal supervisor :
PhD - Université de Montréal
Master's Research - Université de Montréal
Master's Research - Université de Montréal
Collaborating Alumni - Université de Montréal
Co-supervisor :
Collaborating researcher - McGill University (assistant professor)

Publications

Position: Message-passing and spectral GNNs are two sides of the same coin
Antonis Vasileiou
Juan Cervino
Pascal Frossard
Charilaos I. Kanatsoulis
Michael T. Schaub
Pierre Vandergheynst
Zhiyang Wang
Ron Levie
Graph neural networks (GNNs) are commonly divided into message-passing neural networks (MPNNs) and spectral graph neural networks, reflectin… (see more)g two largely separate research traditions in machine learning and signal processing. This paper argues that this divide is mostly artificial, hindering progress in the field. We propose a viewpoint in which both MPNNs and spectral GNNs are understood as different parametrizations of permutation-equivariant operators acting on graph signals. From this perspective, many popular architectures are equivalent in expressive power, while genuine gaps arise only in specific regimes. We further argue that MPNNs and spectral GNNs offer complementary strengths. That is, MPNNs provide a natural language for discrete structure and expressivity analysis using tools from logic and graph isomorphism research, while the spectral perspective provides principled tools for understanding smoothing, bottlenecks, stability, and community structure. Overall, we posit that progress in graph learning will be accelerated by clearly understanding the key similarities and differences between these two types of GNNs, and by working towards unifying these perspectives within a common theoretical and conceptual framework rather than treating them as competing paradigms.
Forest-Guided Semantic Transport for Label-Supervised Manifold Alignment
Kevin R. Moon
Jake S. Rhodes
GraIP: A Benchmarking Framework For Neural Graph Inverse Problems
Andrei Manolache
Arman Mielke
Chendi Qian
Antoine Siraudin
Mathias Niepert
A wide range of graph learning tasks, such as structure discovery, temporal graph analysis, and combinatorial optimization, focus on inferri… (see more)ng graph structures from data, rather than making predictions on given graphs. However, the respective methods to solve such problems are often developed in an isolated, task-specific manner and thus lack a unifying theoretical foundation. Here, we provide a stepping stone towards the formation of such a foundation and further development by introducing the Neural Graph Inverse Problem (GraIP) conceptual framework, which formalizes and reframes a broad class of graph learning tasks as inverse problems. Unlike discriminative approaches that directly predict target variables from given graph inputs, the GraIP paradigm addresses inverse problems, i.e., it relies on observational data and aims to recover the underlying graph structure by reversing the forward process, such as message passing or network dynamics, that produced the observed outputs. We demonstrate the versatility of GraIP across various graph learning tasks, including rewiring, causal discovery, and neural relational inference. We also propose benchmark datasets and metrics for each GraIP domain considered, and characterize and empirically evaluate existing baseline methods used to solve them. Overall, our unifying perspective bridges seemingly disparate applications and provides a principled approach to structural learning in constrained and combinatorial settings while encouraging cross-pollination of existing methods across graph inverse problems.
Scalable Tree Ensemble Proximities in Python
Kevin R. Moon
Jake S. Rhodes
From Memorization to Parameter Interference: How Overtraining Experts Harms Model Merging
Modern deep learning is increasingly characterized by the use of open-weight foundation models that can be fine-tuned on specialized dataset… (see more)s. This has led to a proliferation of expert models and adapters, often shared via platforms like HuggingFace and AdapterHub. Model merging has recently emerged as an effective way to leverage these existing resources, enabling the composition of capabilities from different model checkpoints. A natural pipeline has thus formed to harness the benefits of transfer learning and amortize sunk training costs: models are pre-trained on general data, fine-tuned on specific tasks, and then multiple checkpoints are merged to obtain a more capable model. A prevailing assumption is that improvements at one stage of this pipeline propagate downstream, leading to gains at subsequent steps. In this work, we challenge that assumption by examining how expert fine-tuning affects model merging. We show that long fine-tuning of experts that optimizes for their individual performance leads to degraded merging performance across vision and language modalities, multiple model scales, and both fully fine-tuned and LoRA-adapted models. We trace this degradation to the memorization of a small set of difficult examples that dominate late fine-tuning steps. This causes negative parameter interference and encodes knowledge that is forgotten during merging. Finally, we demonstrate that task-dependent aggressive early stopping strategies can significantly improve model merging performance.
Geometry-Aware Edge Pooling for Graph Neural Networks
Graph Neural Networks (GNNs) have shown significant success for graph-based tasks. Motivated by the prevalence of large datasets in real-wor… (see more)ld applications, pooling layers are crucial components of GNNs. By reducing the size of input graphs, pooling enables faster training and potentially better generalisation. However, existing pooling operations often optimise for the learning task at the expense of discarding fundamental graph structures, thus reducing interpretability. This leads to unreliable performance across dataset types, downstream tasks and pooling ratios. Addressing these concerns, we propose novel graph pooling layers for structure-aware pooling via edge collapses. Our methods leverage diffusion geometry and iteratively reduce a graph's size while preserving both its metric structure and its structural diversity. We guide pooling using magnitude, an isometry-invariant diversity measure, which permits us to control the fidelity of the pooling process. Further, we use the spread of a metric space as a faster and more stable alternative ensuring computational efficiency. Empirical results demonstrate that our methods (i) achieve top performance compared to alternative pooling layers across a range of diverse graph classification tasks, (ii) preserve key spectral properties of the input graphs, and (iii) retain high accuracy across varying pooling ratios.
Freeze, Diffuse, Decode: Geometry-Aware Adaptation of Pretrained Transformer Embeddings for Antimicrobial Peptide Design
Pankhil Gawade
Adam Izdebski
Kevin R. Moon
Jake S. Rhodes
Ewa Szczurek
Graph topological property recovery with heat and wave dynamics-based features on graphs
Dhananjay Bhaskar
Yanlei Zhang
Charles Xu
Xingzhi Sun
Oluwadamilola Fasina
Maximilian Nickel
Michael Perlmutter
Random Forest Autoencoders for Guided Representation Learning
Kevin R. Moon
Jake S. Rhodes
Extensive research has produced robust methods for unsupervised data visualization. Yet supervised visualization…
Neural FIM: Bridging Statistical Manifolds and Generative Modeling through Fisher Geometry
Yanlei Zhang
Edward De Brouwer
Danqi Liao
Oluwadamilola Fasina
Ricky T. Q. Chen
Maximilian Nickel
Ian Adelstein
While data diffusion-based embeddings are widely used in unsupervised learning to reveal the intrinsic geometry of data, they are fundamenta… (see more)lly constrained by their discrete nature and inability to generalize beyond training points. This limitation ob
Leveraging Parameter Space Symmetries for Reasoning Skill Transfer in LLMs
Sangwoo Cho
Supriyo Chakraborty
Shi-Xiong Zhang
Sambit Sahu
Genta Indra Winata
Measure Before You Look: Grounding Embeddings Through Manifold Metrics