Viet-Anh on Software Logo

What is: Graph Finite-State Automaton?

SourceLearning Graph Structure With A Finite-State Automaton Layer
Year2000
Data SourceCC BY-SA - https://paperswithcode.com

Graph Finite-State Automaton, or GFSA, is a differentiable layer for learning graph structure that adds a new edge type (expressed as a weighted adjacency matrix) to a base graph. This layer can be trained end-to-end to add derived relationships (edges) to arbitrary graph-structured data based on performance on a downstream task.