SYNAPSE-G: Bridging Large Language Models and Graph Learning for Rare Event Classification

Sasan Tavakkol, Lin Chen, Max Springer, Abigail Schantz, Blaž Bratanič +2 more
8/13/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Scarcity of labeled data, especially for rare events, hinders training effective machine learning models. This paper proposes SYNAPSE-G (Synthetic Augmentation for Positive Sampling via Expansion on Graphs), a novel pipeline leveraging Large Language Models (LLMs) to generate synthetic training data for rare event classification, addressing the cold-start problem. This synthetic data serve as seeds for semi-supervised label propagation on a similarity graph constructed between the seeds and a large unlabeled dataset. This identifies candidate positive examples, subsequently labeled by an oracle (human or LLM). The expanded dataset then trains/fine-tunes a classifier. We theoretically analyze how the quality (validity and diversity) of the synthetic data impacts the precision and recall of our method. Experiments on the imbalanced SST2 and MHS datasets demonstrate SYNAPSE-G's effectiveness in finding positive labels, outperforming baselines including nearest neighbor search.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{tavakkol2025synapseg,
  title  = {SYNAPSE-G: Bridging Large Language Models and Graph Learning for Rare Event Classification},
  author = {Sasan Tavakkol and Lin Chen and Max Springer and Abigail Schantz and Blaž Bratanič and Vincent Cohen-Addad and MohammadHossein Bateni},
  year   = {2025},
  eprint = {2508.09544},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.09544v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.09544.svg)](https://codeofpaper.com/paper/2508.09544)

Discussion