[ICLR 2025 Spotlight] LayerDAG: A Layerwise Autoregressive Diffusion Model of Directed Acyclic Graphs
☆26Jan 26, 2025Updated last year
Alternatives and similar repositories for LayerDAG
Users that are interested in LayerDAG are comparing it to the libraries listed below
Sorting:
- [Preprint] Graph State Space Convolution (GSSC)☆14Jun 11, 2024Updated last year
- [ICML 2024] Code for Pairwise Alignment Improves Graph Domain Adaptation (Pair-Align)☆14Jun 15, 2024Updated last year
- Code for GeSS: Benchmarking Geometric Deep Learning under Scientific Applications with Distribution Shifts☆16Dec 28, 2024Updated last year
- Official code for SPE☆17Sep 15, 2024Updated last year
- The repository for 'Unsupervised Learning for Combinatorial Optimization with Principled Proxy Design'☆16Oct 9, 2022Updated 3 years ago
- [VLDB'23] SUREL+ is a novel set-based computation framework for scalable subgraph-based graph representation learning.☆17Apr 10, 2025Updated 11 months ago
- [ICML 2023] Structural Re-weighting Improves Graph Domain Adaptation (StruRW)☆22Jun 20, 2023Updated 2 years ago
- [ICML 2025] Generalization Principles for Inference over Text-Attributed Graphs with Large Language☆21Jul 15, 2025Updated 8 months ago
- [VLDB'22] SUREL is a novel walk-based computation framework for efficient subgraph-based graph representation learning.☆20Apr 10, 2025Updated 11 months ago
- [ICML 2024 Oral] LSH-Based Efficient Point Transformer (HEPT)☆24Jan 24, 2025Updated last year
- The official implementation of DIG-MILP☆14Oct 27, 2023Updated 2 years ago
- An implementation of the Autoregressive Diffusion Model for Graph Generation from [Kong et al. 2023]☆44Updated this week
- [ICLR 2023] Learnable Randomness Injection (LRI) for interpretable Geometric Deep Learning.☆25Jul 18, 2023Updated 2 years ago
- [ICML'25] "Rethinking Addressing in Language Models via Contextualized Equivariant Positional Encoding" by Jiajun Zhu, Peihao Wang, Ruisi…☆14Jun 6, 2025Updated 9 months ago
- ☆10Aug 13, 2021Updated 4 years ago
- Official implementation for 'Sparse denoising diffusion for large graph generation'☆74Aug 18, 2025Updated 7 months ago
- Learning Tree structures and Tree metrics☆24Aug 8, 2024Updated last year
- LOSTIN: Logic Optimization via Spatio-Temporal Information with Hybrid Graph Models☆26May 29, 2022Updated 3 years ago
- [AAAI'23] FinalMLP: An Enhanced Two-Stream MLP Model for CTR Prediction https://arxiv.org/abs/2304.00902☆11Apr 9, 2023Updated 2 years ago
- ☆121Sep 13, 2023Updated 2 years ago
- ☆32Jul 10, 2023Updated 2 years ago
- Reconsidering the Performance of GAE in Link Prediction☆16Jan 12, 2026Updated 2 months ago
- EDGE: Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modeling☆67Jun 3, 2025Updated 9 months ago
- ☆14Mar 4, 2022Updated 4 years ago
- Annotating Slack Directly on Your Verilog: Fine-Grained RTL Timing Evaluation for Early Optimization☆43May 29, 2025Updated 9 months ago
- Optimization results for superconducting electronic (SCE) circuits☆18Dec 5, 2023Updated 2 years ago
- Multidimensional Uncertainty-Aware Evidential Neural Networks ( AAAI2021)☆16Aug 19, 2021Updated 4 years ago
- Repository for the implementation of our work on hypergraph generation as part of the ANR project "SODA".☆13Oct 27, 2025Updated 4 months ago
- Code of GAMLP for Open Graph Benchmark. KDD‘22☆63Jun 25, 2022Updated 3 years ago
- Chronos: Zero-Shot Identification of Libraries from Vulnerability Reports (ICSE 2023, Technical Track)☆11Jul 23, 2023Updated 2 years ago
- [AAAI 2026 Oral] Automatic Multi-agent Communication Topology Design☆34Jan 30, 2026Updated last month
- KITTI数据集国内分享☆17Sep 13, 2020Updated 5 years ago
- Certified (approximate) machine unlearning for simplified graph convolutional networks (SGCs) with theoretical guarantees (ICLR 2023)☆20Feb 17, 2023Updated 3 years ago
- ☆45May 18, 2024Updated last year
- Code for "Beyond Individual Input for Deep Anomaly Detection on Tabular Data"☆15Nov 17, 2025Updated 4 months ago
- [CIKM'24] Self-Supervision Improves Diffusion Models for Tabular Data Imputation☆16Sep 20, 2024Updated last year
- DYnamic MOtif-NoDes (DYMOND) is a dynamic network generative model based on temporal motifs and node behavior.☆15Mar 16, 2023Updated 3 years ago
- Boosted E-Graph Extraction with Adaptive Heuristics and Exact Solving☆29Jan 7, 2026Updated 2 months ago
- [ICLR 2025] Simple is Effective: The Roles of Graphs and Large Language Models in Knowledge-Graph-Based Retrieval-Augmented Generation☆160Jan 27, 2025Updated last year