{"url":"/method/dagnn","slug":"dagnn","name":"DAGNN","full_name":"Directed Acyclic Graph Neural Network","full_name_withheld":false,"description_markdown":"A GNN for dags, which injects their topological order as an inductive bias via asynchronous message passing.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Directed Acyclic Graph Neural Networks","paper":"/paper/directed-acyclic-graph-neural-networks-1","first_author":"Veronika Thost","n_authors":2,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/directed-acyclic-graph-neural-networks-1"},"source":{"url":"https://arxiv.org/abs/2101.07965v3","title":"Directed Acyclic Graph Neural Networks","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 Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":6,"archive_num_papers":6,"papers_newest_first":[{"paper":null,"title":"Beyond Graph Convolutional Network: An Interpretable Regularizer-centered Optimization Framework","date":"2023-01-11","arxiv_id":"2301.04318","n_code_links":0,"syntology":null},{"paper":null,"title":"A Scalable Deep Reinforcement Learning Model for Online Scheduling Coflows of Multi-Stage Jobs for High Performance Computing","date":"2021-12-21","arxiv_id":"2112.11055","n_code_links":0,"syntology":null},{"paper":null,"title":"Stabilized Self-training with Negative Sampling on Few-labeled Graph Data","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/directed-acyclic-graph-neural-networks-1","title":"Directed Acyclic Graph Neural Networks","date":"2021-01-20","arxiv_id":"2101.07965","n_code_links":1,"syntology":null},{"paper":"/paper/dynamic-self-training-framework-for-graph","title":"Effective Stabilized Self-Training on Few-Labeled Graph Data","date":"2019-10-07","arxiv_id":"1910.02684","n_code_links":1,"syntology":{"ran":0,"of":1,"unverified":1,"pointer_only":1}},{"paper":"/paper/learning-scheduling-algorithms-for-data","title":"Learning Scheduling Algorithms for Data Processing Clusters","date":"2018-10-03","arxiv_id":"1810.01963","n_code_links":2,"syntology":{"ran":0,"of":4,"unverified":4,"pointer_only":0}}],"papers_shown":6,"tasks":[{"task":"/task/benchmarking","name":"Benchmarking","papers":2},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":2},{"task":"/task/node-classification","name":"Node Classification","papers":2},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":2},{"task":"/task/scheduling","name":"Scheduling","papers":2},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":1},{"task":"/task/graph-property-prediction","name":"Graph Property Prediction","papers":1},{"task":"/task/inductive-bias","name":"Inductive Bias","papers":1},{"task":"/task/model-selection","name":"Model Selection","papers":1},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":1}],"tasks_shown":10,"n_tasks":10,"usage_by_year":[{"year":"2018","papers":1},{"year":"2019","papers":1},{"year":"2021","papers":3},{"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/dagnn"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}