GFSA

2000년 도입 · 논문 2편에서 사용

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

소개 논문: Learning Graph Structure With A Finite-State Automaton Layer