Edouard Pineau

8 papers 67 citations h-index 3 2018–2022

A Simple Baseline Algorithm for Graph Classification

Graph classification has recently received a lot of attention from various fields of machine learning e.g. kernel methods, sequential modeling or graph embedding. All these approaches offer...

40 citations 2018-10 arXiv (Cornell University)

Using Laplacian Spectrum as Graph Feature Representation

Graphs possess exotic features like variable size and absence of natural ordering of the nodes that make them difficult to analyze and compare. To circumvent this problem and learn on graphs,...

7 citations 2019-12 arXiv.org

Time Series Source Separation with Slow Flows

In this paper, we show that slow feature analysis (SFA), a common time series decomposition method, naturally fits into the flow-based models (FBM) framework, a type of invertible neural latent...

2 citations 2020-07 arXiv.org

InfoCatVAE: Representation Learning with Categorical Variational Autoencoders

This paper describes InfoCatVAE, an extension of the variational autoencoder that enables unsupervised disentangled representation learning. InfoCatVAE uses multimodal distributions for the prior...

15 citations 2018-06 arXiv.org

Variational Recurrent Neural Networks for Graph Classification

We address the problem of graph classification based only on structural information. Inspired by natural language processing techniques (NLP), our model sequentially embeds information to estimate...

3 citations 2019-02 arXiv (Cornell University)

Universal hidden monotonic trend estimation with contrastive learning

In this paper, we describe a universal method for extracting the underlying monotonic trend factor from time series data. We propose an approach related to the Mann-Kendall test, a standard...

2022-10