Generating Directed Graphs with Dual Attention and Asymmetric Encoding
Alba Carballo-Castro, Manuel Madeira, Yiming Qin, Dorina Thanou, Pascal Frossard

TL;DR
This paper introduces Directo, a novel generative model for directed graphs that employs dual attention and asymmetric encoding, addressing the challenges of modeling edge directionality and lacking benchmarks in the field.
Contribution
We propose Directo, the first directed graph generative model based on discrete flow matching, with specialized positional encodings and dual attention mechanisms.
Findings
Performs well across synthetic and real-world datasets
Competitively models directed acyclic graphs
Establishes a new benchmark suite for evaluation
Abstract
Directed graphs naturally model systems with asymmetric, ordered relationships, essential to applications in biology, transportation, social networks, and visual understanding. Generating such graphs enables tasks such as simulation, data augmentation and novel instance discovery; however, directed graph generation remains underexplored. We identify two key factors limiting progress in this direction: first, modeling edge directionality introduces a substantially larger dependency space, making the underlying distribution harder to learn; second, the absence of standardized benchmarks hinders rigorous evaluation. Addressing the former requires more expressive models that are sensitive to directional topologies. We propose Directo, the first generative model for directed graphs built upon the discrete flow matching framework. Our approach combines: (i) principled positional encodings…
Peer Reviews
Decision·ICLR 2026 Poster
- Novel and Important Problem: The paper addresses a significantly underexplored area in graph generation. The focus on directed graphs is well-motivated, with clear applications in biology, transportation networks, and scene understanding. - Comprehensive Technical Approach: The dual attention mechanism is presented as a solution to capture bidirectional dependencies inherent in directed graphs. The integration with discrete flow matching provides a principled generative framework with theoreti
- Unclear Claims on Expressiveness: While the authors claim their method is "expressive" and "robust," these claims lack formal theoretical justification or empirical evidence. The notion of expressiveness in the context of directed graph generation needs clearer definition and supporting arguments. - Scalability Concerns vs. Efficiency Claims: The paper mentions "efficient generation" but simultaneously acknowledges scalability limitations. This contradiction needs clarification. Table 20 show
* The model proposed in this work succeeds in generating graphs with specific constraints (acyclic, or edges only across certain types) even if those constrains are not explicitly stated (e.g., through some regularization parameter) during the training process. * The architecture is quite generic in that it can be used to generate directed graphs of virtually any type as edges are encoding through categorical variables, while it can also accomodate node and graph features.
* The model itself, at least as presented, is not self-contained. Section 2 which provides a background on diffusion models and past work seems disconnected to Section 3 that describes the attention mechanism employed. For example, it is not specified how edges are modeled through categorical variables (e.g, is it representing one of the 4 possible classes -- edges in both directions, in one of the two (x2), or absent?), how the rate matrix is parameterized though the proposed architecture, whi
- The area of directed graph generation seems important but relatively unexplored given the many works for undirected graph generation. - The writing is clear, grammatical, and well-organized. - The paper introduces not only a new method, but also a benchmark for the area of directed graph generation. A code repository is included for reproducibility. - Ablations are included to justify major new components of the model arch.
- The proposed arch is complex, and while there are ablation studies for some important components, this is not true of all components, e.g., use of FiLM. - As the authors note, the proposed method can fail to maintain validity when scaling up (e.g., failing to maintain strict acyclicity beyond 200 nodes). - Ideally the broad setting of the paper in terms of the scale of generated graphs would be clarified earlier in the paper. Graph generation papers and algorithms roughly cluster on two catego
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Machine Learning in Healthcare
