Betti numbers of attention graphs is all you really need

Laida Kushnareva, Dmitri Piontkovski, Irina Piontkovskaya
7/5/2022
cs.CL

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

Abstract

We apply methods of topological analysis to the attention graphs, calculated on the attention heads of the BERT model ( arXiv:1810.04805v2 ). Our research shows that the classifier built upon basic persistent topological features (namely, Betti numbers) of the trained neural network can achieve classification results on par with the conventional classification method. We show the relevance of such topological text representation on three text classification benchmarks. For the best of our knowledge, it is the first attempt to analyze the topology of an attention-based neural network, widely used for Natural Language Processing.

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{kushnareva2022betti,
  title  = {Betti numbers of attention graphs is all you really need},
  author = {Laida Kushnareva and Dmitri Piontkovski and Irina Piontkovskaya},
  year   = {2022},
  eprint = {2207.01903},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.01903v1}
}

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/2207.01903.svg)](https://codeofpaper.com/paper/2207.01903)

Discussion