Guillaume Rabusseau

Google Scholar

Farzaneh Heidari

Doctorat - UdeM

Co-superviseur⋅e :

Jian Tang

Shenyang Huang

Doctorat - McGill

Superviseur⋅e principal⋅e :

Doctorat - UdeM

Maîtrise recherche - McGill

Superviseur⋅e principal⋅e :

Github

Razieh Razieh Shirzadkhani

Collaborateur·rice de recherche

Co-superviseur⋅e :

Github

Michael Rizvi-Martel

Doctorat - UdeM

Co-superviseur⋅e :

Pascal Tikeng Notsawo

Doctorat - UdeM

Co-superviseur⋅e :

Beheshteh Toloueirakhshan

Doctorat - UdeM

Publications

Generative Learning of Continuous Data by Tensor Networks

Alex Meiburg

Jing Chen

Jacob Miller

Raphaelle Tihon

Alejandro Perdomo-ortiz

2023-10-31

ArXiv (prépublication)

doi.org

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

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/.

openreview.net

ROSA: Random Orthogonal Subspace Adaptation

Marawan Gamal

Aristides Milios

Siva Reddy

2023-06-20

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

openreview.net

Optimal Approximate Minimization of One-Letter Weighted Finite Automata

Clara Lacroce

Borja Balle

Prakash Panangaden

2023-05-31

ArXiv (prépublication)

doi.org

arxiv.org

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

Shenyang Huang

Jacob Danovitch

2023-05-15

ArXiv (prépublication)

doi.org

arxiv.org

Recurrent Real-valued Neural Autoregressive Density Estimator for Online Density Estimation and Classification of Streaming Data

Tianyu Li

Bogdan Mazoure

In contrast with the traditional offline learning, where complete data accessibility is assumed, many modern applications involve processing… (voir plus) data in a streaming fashion. This online learning setting raises various challenges, including concept drift, hardware memory constraints, etc. In this paper, we propose the Recurrent Real-valued Neural Autoregressive Density Estimator (RRNADE), a flexible density-based model for online classification and density estimation. RRNADE combines a neural Gaussian mixture density module with a recurrent module. This combination allows RRNADE to exploit possible sequential correlations in the streaming task, which are often ignored in the classical streaming setting where each input is assumed to be independent from the previous ones. We showcase the ability of RRNADE to adapt to concept drifts on synthetic density estimation tasks. We also apply RRNADE to online classification tasks on both real world and synthetic datasets and compare it with multiple density based as well as nondensity based online classification methods. In almost all of these tasks, RRNADE outperforms the other methods. Lastly, we conduct an ablation study demonstrating the complementary benefits of the density and the recurrent modules.

2023-02-01

ICLR.cc/2023/Conference (rejected)

openreview.net

Benchmarking State-Merging Algorithms for Learning Regular Languages.

Adil Soubki

Jeffrey Heinz

François Coste

Faissal Ouardi

2023-01-01

International Conference on Graphics and Interaction (publié)

Explaining Graph Neural Networks Using Interpretable Local Surrogates

Farzaneh Heidari

Perouz Taslakian

We propose an interpretable local surrogate (ILS) method for understanding the predictions of black-box graph models. Explainability methods… (voir plus) are commonly employed to gain insights into black-box models and, given the widespread adoption of GNNs in diverse applications, understanding the underlying reasoning behind their decision-making processes becomes crucial. Our ILS method approximates the behavior of a black-box graph model by fitting a simple surrogate model in the local neighborhood of a given input example. Leveraging the interpretability of the surrogate, ILS is able to identify the most relevant nodes contributing to a specific prediction. To efficiently identify these nodes, we utilize group sparse linear models as local surrogates. Through empirical evaluations on explainability benchmarks, our method consistently outperforms state-of-the-art graph explainability methods. This demonstrates the effectiveness of our approach in providing enhanced interpretability for GNN predictions.

2023-01-01

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

2023-01-01

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.

2023-01-01

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.

2023-01-01

International Conference on Graphics and Interaction (publié)

Lower Bounds for Active Automata Learning.

Loes Kruger

Bharat Garhewal

François Coste

Frits W. Vaandrager

Faissal Ouardi

2023-01-01

ICGI (publié)