GFSA
Graph Finite-State Automaton
**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.
Learning Graph Structure With A Finite-State Automaton Layer
https://paperswithcode.com/paper/learning-graph-structure-with-a-finite-state
Learning Graph Structure With A Finite-State Automaton Layer