mlsanityData to 14 Oct 2026

Graph Data Augmentation via Contrastive Generator Inversion (textttDCBA)

arXiv 2610.05653 ↗First posted 5 Oct 2026cs.LG cs.SIcited by 0

Not on the map. Why?

Abstract (arXiv)

Graphs provide a natural representation of many complex systems, ranging from social platforms to ecosystems. However, the development of graph-based machine learning methods is often constrained by the limited availability of large and diverse graph datasets. In this paper, we introduce textttDCBA, a model-based approach to graph data augmentation that infers the configuration of a synthetic graph generator from an observed network. We instantiate the proposed framework using the textttABCD generator, which produces scale-free networks with community structure. Our model learns a joint representation of graphs and generator parametrisations using a multi-positive contrastive objective with soft negative weighting. The learned representation enables the prediction of an textttABCD configuration whose stochastic realisations preserve the macrostructural properties encoded by the generator. Experiments show that textttDCBA recovers generator parameters more accurately and robustly than an algorithmic inverse-modelling baseline. Its downstream utility is further demonstrated in community detection, where inferred configurations used to fine-tune textttPRoCD improve AMI on average by 161% on synthetic and 273% on real-world networks.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 36 references that are in the map. First posted on arXiv 5 Oct 2026.

Builds on

19 of 36 references.

References · 19

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2018How Powerful are Graph Neural Networks?cited by 4,393
  3. 2020Supervised Contrastive Learningcited by 2,829
  4. 2020Rethinking Attention with Performerscited by 1,601
  5. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  6. 2016Geometric deep learning: going beyond Euclidean datacited by 1,048
  7. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
  8. 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 385
  9. 2019Graph Matching Networks for Learning the Similarity of Graph Structured Objectscited by 205
  10. 2020Data Augmentation for Graph Neural Networkscited by 203
  11. 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 146
  12. 2022Graph Data Augmentation for Graph Machine Learning: A Surveycited by 62
7 more
  1. 2020Artificial Benchmark for Community Detection (ABCD): Fast Random Graph Model with Community Structurecited by 19
  2. 2023Artificial Benchmark for Community Detection with Outliers (ABCD+o)cited by 7
  3. 2013Model of complex networks based on citation dynamicscited by 6
  4. 2022A Framework for Large Scale Synthetic Graph Dataset Generationcited by 6
  5. 2024Pre-train and Refine: Towards Higher Efficiency in K-Agnostic Community Detection without Quality Degradationcited by 5
  6. 2024The anonymization problem in social networkscited by 1
  7. 2026Twinning Complex Networked Systems: Data-Driven Calibration of the mABCD Synthetic Graph Generatorcited by 1

Built on by

Not cited yet.