Augment to Interpret: Unsupervised and Inherently Interpretable Graph Embeddings

Gregory Scafarto, Madalina Ciortan, Simon Tihon, Quentin Ferre
9/28/2023
cs.LGcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Unsupervised learning allows us to leverage unlabelled data, which has become abundantly available, and to create embeddings that are usable on a variety of downstream tasks. However, the typical lack of interpretability of unsupervised representation learning has become a limiting factor with regard to recent transparent-AI regulations. In this paper, we study graph representation learning and we show that data augmentation that preserves semantics can be learned and used to produce interpretations. Our framework, which we named INGENIOUS, creates inherently interpretable embeddings and eliminates the need for costly additional post-hoc analysis. We also introduce additional metrics addressing the lack of formalism and metrics in the understudied area of unsupervised-representation learning interpretability. Our results are supported by an experimental study applied to both graph-level and node-level tasks and show that interpretable embeddings provide state-of-the-art performance on subsequent downstream tasks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{scafarto2023augment,
  title  = {Augment to Interpret: Unsupervised and Inherently Interpretable Graph Embeddings},
  author = {Gregory Scafarto and Madalina Ciortan and Simon Tihon and Quentin Ferre},
  year   = {2023},
  eprint = {2309.16564},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2309.16564v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2309.16564.svg)](https://codeofpaper.com/paper/2309.16564)

Discussion