Guillaume Rabusseau

Biographie

Depuis septembre 2018, je suis professeur adjoint à Mila – Institut québécois d’intelligence artificielle et au Département d'informatique et de recherche opérationnelle (DIRO) de l'Université de Montréal (UdeM). Je suis titulaire d’une chaire de recherche en IA Canada-CIFAR depuis mars 2019. Avant de me joindre à l’UdeM, j’ai été chercheur postdoctoral au laboratoire de raisonnement et d'apprentissage de l'Université McGill, où j'ai travaillé avec Prakash Panangaden, Joelle Pineau et Doina Precup.

J'ai obtenu mon doctorat en 2016 à l’Université d’Aix-Marseille (AMU), où j'ai travaillé dans l'équipe Qarma (apprentissage automatique et multimédia), sous la supervision de François Denis et Hachem Kadri. Auparavant, j'ai obtenu une maîtrise en informatique fondamentale de l'AMU et une licence en informatique de la même université en formation à distance.

Je m'intéresse aux méthodes de tenseurs pour l'apprentissage automatique et à la conception d'algorithmes d'apprentissage pour les données structurées par l’utilisation de l'algèbre linéaire et multilinéaire (par exemple, les méthodes spectrales).

Étudiants actuels

Kareem Ahmed

Postdoctorat - McGill

Co-superviseur⋅e :

Siva Reddy

kareem.yousrii@gmail.com

Jun Dai

Postdoctorat - UdeM

jun.dai@mila.quebec

alireza.dizaji@mila.quebec

Alireza Dizaji

Collaborateur·rice alumni - UdeM

marawan.gamal@mila.quebec

Marawan Gamal

Doctorat - UdeM

Doctorat - UdeM

Co-superviseur⋅e :

Jian Tang

farzaneh.heidari@mila.quebec

Collaborateur·rice de recherche - McGill

Superviseur⋅e principal⋅e :

Doctorat - UdeM

Sitao Luan

Postdoctorat - McGill

Co-superviseur⋅e :

Larry Ma

Stagiaire de recherche - Polytechnique

maning.hust@gmail.com

Ewan Murphy

Collaborateur·rice de recherche - INRIA

ewan.murphy@mila.quebec

charlotte.noxon@mila.quebec

Charlotte Noxon

Maîtrise recherche - UdeM

michael.rizvi-martel@mila.quebec

Michael Rizvi-Martel

Doctorat - UdeM

Co-superviseur⋅e :

Adam M. Oberman

Anantha Krishnan Sunilkumar

Doctorat - UdeM

anantha.krishnan.sunilkumar@mila.quebec

pascal.tikeng@mila.quebec

Pascal Tikeng Notsawo

Doctorat - UdeM

Co-superviseur⋅e :

Guillaume Dumas

Collaborateur·rice de recherche - UdeM

Co-superviseur⋅e :

Reihaneh Rabbany

aaron.tjandra@mila.quebec

Beheshteh Toloueirakhshan

Doctorat - UdeM

rakhshab@mila.quebec

jingjing.zheng@mila.quebec

Jingjing Zheng

Stagiaire de recherche - UdeM

Publications

Laplacian Change Point Detection for Single and Multi-view Dynamic Graphs

Samy Coulombe

Dynamic graphs are rich data structures that are used to model complex relationships between entities over time. In particular, anomaly dete… (voir plus)ction in temporal graphs is crucial for many real world applications such as intrusion identification in network systems, detection of ecosystem disturbances and detection of epidemic outbreaks. In this paper, we focus on change point detection in dynamic graphs and address three main challenges associated with this problem: i). how to compare graph snapshots across time, ii). how to capture temporal dependencies, and iii). how to combine different views of a temporal graph. To solve the above challenges, we first propose Laplacian Anomaly Detection (LAD) which uses the spectrum of graph Laplacian as the low dimensional embedding of the graph structure at each snapshot. LAD explicitly models short term and long term dependencies by applying two sliding windows. Next, we propose MultiLAD, a simple and effective generalization of LAD to multi-view graphs. MultiLAD provides the first change point detection method for multi-view dynamic graphs. It aggregates the singular values of the normalized graph Laplacian from different views through the scalar power mean operation. Through extensive synthetic experiments, we show that i). LAD and MultiLAD are accurate and outperforms state-of-the-art baselines and their multi-view extensions by a large margin, ii). MultiLAD's advantage over contenders significantly increases when additional views are available, and iii). MultiLAD is highly robust to noise from individual views. In five real world dynamic graphs, we demonstrate that LAD and MultiLAD identify significant events as top anomalies such as the implementation of government COVID-19 interventions which impacted the population mobility in multi-view traffic networks.

2023-11-05

ACM Transactions on Knowledge Discovery from Data (publié)

arxiv.org

Generative Learning of Continuous Data by Tensor Networks

Alex Meiburg

Jian Hua Chen

Jacob Miller

Raphaelle Tihon

Alejandro Perdomo-ortiz

2023-10-30

ArXiv (prépublication)

arxiv.org

Temporal Graph Benchmark for Machine Learning on Temporal Graphs

Shenyang Huang

Farimah Poursafaei

Jacob Danovitch

Matthias Fey

Weihua Hu

Emanuele Rossi

Jure Leskovec

Michael M. Bronstein

Reihaneh Rabbany

We present the Temporal Graph Benchmark (TGB), a collection of challenging and diverse benchmark datasets for realistic, reproducible, and r… (voir plus)obust evaluation of machine learning models on temporal graphs. TGB datasets are of large scale, spanning years in duration, incorporate both node and edge-level prediction tasks and cover a diverse set of domains including social, trade, transaction, and transportation networks. For both tasks, we design evaluation protocols based on realistic use-cases. We extensively benchmark each dataset and find that the performance of common models can vary drastically across datasets. In addition, on dynamic node property prediction tasks, we show that simple methods often achieve superior performance compared to existing temporal graph models. We believe that these findings open up opportunities for future research on temporal graphs. Finally, TGB provides an automated machine learning pipeline for reproducible and accessible temporal graph research, including data loading, experiment setup and performance evaluation. TGB will be maintained and updated on a regular basis and welcomes community feedback. TGB datasets, data loaders, example codes, evaluation setup, and leaderboards are publicly available at https://tgb.complexdatalab.com/.

2023-09-24

NeurIPS.cc/2023/Track/Datasets_and_Benchmarks (poster)

openreview.net

Towards Foundational Models for Molecular Learning on Large-Scale Multi-Task Datasets (Ultra Large Dataset)

Dominique Beaini

Shenyang Huang

Joao Alex Cunha

Zhiyi Li

Gabriela Moisescu-Pareja

Oleksandr Dymov

Samuel Maddrell-Mander

Callum McLean

Ali Parviz

Luis T. Díaz Müller

Jama Hussein Mohamud

Michael Craig

Cristian Gabellini

Jian Tang … (voir 8 de plus)

Christopher G. Morris

Mirco Ravanelli

Guy Wolf

Prudencio Tossou

Hadrien Mary

Błażej Banaszewski

Chad Martin

Dominic Masters

2023-09-21

Zenodo (inconnu)

Preface

François Coste

Faissal Ouardi

2023-07-04

Proceedings of 16th edition of the International Conference on Grammatical Inference (publié)

proceedings.mlr.press

ROSA: Random Orthogonal Subspace Adaptation

2023-06-19

ICML.cc/2023/Workshop/ES-FoMO (poster)

openreview.net

Fast and Attributed Change Detection on Dynamic Graphs with Density of States

2023-05-14

arXiv (prépublication)

arxiv.org

Benchmarking State-Merging Algorithms for Learning Regular Languages.

Adil Soubki

Jeffrey Heinz

François Coste

Faissal Ouardi

2022-12-31

International Conference on Graphics and Interaction (publié)

Explaining Graph Neural Networks Using Interpretable Local Surrogates

Farzaneh Heidari

Perouz Taslakian

2022-12-31

TAG-ML (publié)

proceedings.mlr.press

Formal and Empirical Studies of Counting Behaviour in ReLU RNNs.

Nadine El-Naggar

Andrew Ryzhikov

Laure Daviaud

Pranava Madhyastha

Tillman Weyde

François Coste

Faissal Ouardi

2022-12-31

International Conference on Graphics and Interaction (publié)

Identification of Substitutable Context-Free Languages over Infinite Alphabets from Positive Data

Yutaro Numaya

Diptarama Hendrian

Ryo Yoshinaka

Ayumi Shinohara

François Coste

Faissal Ouardi

This paper is concerned with the identification in the limit from positive data of sub-stitutable context-free languages cfl s) over infinit… (voir plus)e alphabets. Clark and Eyraud (2007) showed that substitutable cfl s over finite alphabets are learnable in this learning paradigm. We show that substitutable cfl s generated by grammars whose production rules may have predicates that represent sets of potentially infinitely many terminal symbols in a compact manner are learnable if the terminal symbol sets represented by those predicates are learnable, under a certain condition. This can be seen as a result parallel to Argyros and D’Antoni’s work (2018) that amplifies the query learnability of predicate classes to that of symbolic automata classes. Our result is the first that shows such amplification is possible for identifying some cfl s in the limit from positive data.

2022-12-31

ICGI (publié)

Learning Syntactic Monoids from Samples by extending known Algorithms for learning State Machines

Simon Dieck

Sicco Verwer

François Coste

Faissal Ouardi

For the inference of regular languages, most current methods learn a version of deterministic finite automata. Syntactic monoids are an alte… (voir plus)rnative representation of regular languages, which have some advantages over automata. For example, traces can be parsed starting from any index and the star-freeness of the language they represent can be checked in polynomial time. But, to date, there existed no passive learning algorithm for syntactic monoids. In this paper, we prove that known state-merging algorithms for learning deterministic finite automata can be instrumented to learn syntactic monoids instead, by using as the input a special structure proposed in this paper: the interfix-graph. Further, we introduce a method to encode frequencies on the interfix-graph, such that models can also be learned from only positive traces. We implemented this structure and performed experiments with both traditional data and data containing only positive traces. As such this work answers basic theoretical and experimental questions regarding a novel passive learning algorithm for syntactic monoids.

2022-12-31

International Conference on Graphics and Interaction (publié)