Directed Graph Grammars for Sequence-based Learning
Not on the map. Why?
Abstract (arXiv)
Directed acyclic graphs (DAGs) are a class of graphs commonly used in practice, with examples that include electronic circuits, Bayesian networks, and neural architectures. While many effective encoders exist for DAGs, it remains challenging to decode them in a principled manner, because the nodes of a DAG can have many different topological orders. In this work, we propose a grammar-based approach to constructing a principled, compact and equivalent sequential representation of a DAG. Specifically, we view a graph as derivations over an unambiguous grammar, where the DAG corresponds to a unique sequence of production rules. Equivalently, the procedure to construct such a description can be viewed as a lossless compression of the data. Such a representation has many uses, including building a generative model for graph generation, learning a latent space for property prediction, and leveraging the sequence representational continuity for Bayesian Optimization over structured data. Code is available at https://github.com/shiningsunnyday/induction.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 30 of its 76 references that are in the map. First posted on arXiv 29 May 2025.
Builds on
30 of 76 references.
References · 30
- 2017Attention Is All You Needcited by 59,932
- 2023GPT-4 Technical Reportcited by 18,132
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2018Efficient Neural Architecture Search via Parameter Sharingcited by 831
- 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 762
- 2018DAGs with NO TEARS: Continuous Optimization for Structure Learningcited by 745
- 2018Junction Tree Variational Autoencoder for Molecular Graph Generationcited by 647
18 more
- 2015Generating Sentences from a Continuous Spacecited by 607
- 2018GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Modelscited by 406
- 2018MolGAN: An implicit generative model for small molecular graphscited by 392
- 2018GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoderscited by 375
- 2018Graph Convolutional Policy Network for Goal-Directed Molecular Graph Generationcited by 363
- 2019DAG-GNN: DAG Structure Learning with Graph Neural Networkscited by 329
- 2017Grammar Variational Autoencodercited by 283
- 2018Learning Deep Generative Models of Graphscited by 227
- 2018Constrained Graph Variational Autoencoders for Molecule Designcited by 182
- 2018Neural Architecture Optimizationcited by 164
- 2019D-VAE: A Variational Autoencoder for Directed Acyclic Graphscited by 98
- 2018Constrained Generation of Semantically Valid Graphs via Regularizing Variational Autoencoderscited by 74
- 2021Directed Acyclic Graph Neural Networkscited by 70
- 2023CktGNN: Circuit Graph Neural Network for Electronic Design Automationcited by 55
- 2022Data-Efficient Graph Grammar Learning for Molecular Generationcited by 26
- 2024Representing Molecules as Random Walks Over Interpretable Grammarscited by 7
- 2017Grammar-Based Graph Compressioncited by 2
- 2020Directed Graph Hashingcited by 2
Built on by
Not cited yet.