mlsanityData to 14 Oct 2026

EPIC: Graph Augmentation with Edit Path Interpolation via Learnable Cost

arXiv 2306.01310 ↗First posted 2 Jun 2023cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Data augmentation plays a critical role in improving model performance across various domains, but it becomes challenging with graph data due to their complex and irregular structure. To address this issue, we propose EPIC (Edit Path Interpolation via learnable Cost), a novel interpolation-based method for augmenting graph datasets. To interpolate between two graphs lying in an irregular domain, EPIC leverages the concept of graph edit distance, constructing an edit path that represents the transformation process between two graphs via edit operations. Moreover, our method introduces a context-sensitive cost model that accounts for the importance of specific edit operations formulated through a learning framework. This allows for a more nuanced transformation process, where the edit distance is not merely count-based but reflects meaningful graph attributes. With randomly sampled graphs from the edit path, we enrich the training set to enhance the generalization capability of classification models. Experimental evaluations across several benchmark datasets demonstrate that our approach outperforms existing augmentation techniques in many tasks.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 28 of its 57 references that are in the map. First posted on arXiv 2 Jun 2023.

Builds on

28 of 57 references.

References · 28

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  3. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  4. 2018How Powerful are Graph Neural Networks?cited by 4,393
  5. 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,849
  6. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  7. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  8. 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,051
  9. 2019AugMix: A Simple Data Processing Method to Improve Robustness and Uncertaintycited by 901
  10. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 728
  11. 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 680
  12. 2019On Mixup Training: Improved Calibration and Predictive Uncertainty for Deep Neural Networkscited by 305
16 more
  1. 2020Graph Random Neural Network for Semi-Supervised Learning on Graphscited by 213
  2. 2019Graph Matching Networks for Learning the Similarity of Graph Structured Objectscited by 205
  3. 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 146
  4. 2020An Empirical Survey of Data Augmentation for Time Series Classification with Neural Networkscited by 128
  5. 2022Graph Rationalization with Environment-based Augmentationscited by 70
  6. 2020Un-Mix: Rethinking Image Mixtures for Unsupervised Visual Representation Learningcited by 62
  7. 2020Robust Optimization as Data Augmentation for Large-scale Graphscited by 58
  8. 2019Mixup Inference: Better Exploiting Mixup to Defend Adversarial Attackscited by 54
  9. 2013Stochastic blockmodel approximation of a graphon: Theory and consistent estimationcited by 39
  10. 2020GraphCrop: Subgraph Cropping for Graph Classificationcited by 31
  11. 2021Graph Transplant: Node Saliency-Guided Graph Mixup with Local Structure Preservationcited by 30
  12. 2020Combinatorial Learning of Graph Edit Distance via Dynamic Embeddingcited by 25
  13. 2020Data Augmentation for Graph Classificationcited by 22
  14. 2022Model-Agnostic Augmentation for Accurate Graph Classificationcited by 21
  15. 2020Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphscited by 7
  16. 2020Learning Graph Edit Distance by Graph Neural Networkscited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.