{"url":"/method/gfsa","slug":"gfsa","name":"GFSA","full_name":"Graph Finite-State Automaton","full_name_withheld":false,"description_markdown":"**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.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Learning Graph Structure With A Finite-State Automaton Layer","paper":"/paper/learning-graph-structure-with-a-finite-state","first_author":"Daniel D. Johnson","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/learning-graph-structure-with-a-finite-state"},"source":{"url":"https://arxiv.org/abs/2007.04929v2","title":"Learning Graph Structure With A Finite-State Automaton Layer","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Representation Learning","url":"/methods/category/graph-representation-learning","pwc_aliases":[]}],"n_papers_tagged":2,"archive_num_papers":2,"papers_newest_first":[{"paper":"/paper/graph-convolutions-enrich-the-self-attention","title":"Graph Convolutions Enrich the Self-Attention in Transformers!","date":"2023-12-07","arxiv_id":"2312.04234","n_code_links":1,"syntology":{"ran":19,"of":29,"unverified":10,"pointer_only":0}},{"paper":"/paper/learning-graph-structure-with-a-finite-state","title":"Learning Graph Structure With A Finite-State Automaton Layer","date":"2020-07-09","arxiv_id":"2007.04929","n_code_links":1,"syntology":null}],"papers_shown":2,"tasks":[{"task":"/task/clone-detection","name":"Clone Detection","papers":1},{"task":"/task/code-classification","name":"Code Classification","papers":1},{"task":"/task/defect-detection","name":"Defect Detection","papers":1},{"task":"/task/graph-regression","name":"Graph Regression","papers":1},{"task":"/task/image-classification","name":"Image Classification","papers":1},{"task":"/task/speech-recognition","name":"Speech Recognition","papers":1},{"task":"/task/time-series-1","name":"Time Series","papers":1},{"task":"/task/variable-misuse","name":"Variable misuse","papers":1},{"task":"/task/speech-recognition-1","name":"speech-recognition","papers":1}],"tasks_shown":9,"n_tasks":9,"usage_by_year":[{"year":"2020","papers":1},{"year":"2023","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/gfsa"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}