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.
Source: Learning Graph Structure With A Finite-State Automaton LayerPaper | Code | Results | Date | Stars |
---|
Task | Papers | Share |
---|---|---|
Code Classification | 1 | 25.00% |
Graph Regression | 1 | 25.00% |
Speech Recognition | 1 | 25.00% |
Variable misuse | 1 | 25.00% |
Component | Type |
|
---|---|---|
🤖 No Components Found | You can add them if they exist; e.g. Mask R-CNN uses RoIAlign |