ProtoGuide: Prototype-Driven Guidance for Class-Conditional Graph Generation

• URL: http://arxiv.org/abs/2609.15239v1
• Date: Mon, 14 Sep 2026 08:57:08 GMT
• Title: ProtoGuide: Prototype-Driven Guidance for Class-Conditional Graph Generation
• Abstract summary: ProtoGuide steers a frozen model with a gradient, but discrete graph diffusion samples discrete edge states, so gradients cannot propagate through the sampled graph.<n>On five classes of real-world networks and two different backbones, ProtoGuide raises macro classification accuracy from 50.7% to 73.5% and from 73.6% to 83.8%, and outperforms DiGress's built-in conditional training under our configuration.
• Score: 10.378378296066305
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Discrete diffusion models are a prominent family for graph generation, but standard class-conditional mechanisms embed the class signal in the denoiser during training, tying the conditioning mechanism to the trained model. Classifier guidance avoids this coupling in continuous domains by steering a frozen model with a classifier's gradient, but discrete graph diffusion samples discrete edge states, so gradients cannot propagate through the sampled graph. We introduce ProtoGuide, a post-hoc, backbone-agnostic framework that recovers an analogous mechanism. At each reverse step the denoiser's per-edge output is relaxed into a differentiable soft adjacency, embedded by a frozen Siamese graph neural network, and scored against a target-class prototype and its nearest competitor; the resulting per-edge gradient, damped by a cosine schedule, is injected back into the denoiser output. All components stay frozen, so guidance is retargeted by supplying a different prototype. On five classes of real-world networks and two architecturally different backbones, EDGE and DiGress, ProtoGuide raises macro classification accuracy from 50.7% to 73.5% and from 73.6% to 83.8%, and outperforms DiGress's built-in conditional training under our configuration. Gains are largest where the unguided models are weakest, and are not uniform across classes. Per-graph coverage remains high in most settings, while distributional effects are class-dependent. A Best-of-N selection baseline matches this accuracy given enough oversampling, but at a substantial cost in graph diversity. An independently initialized classifier, a directionality test, and a few-shot analysis support target-directed steering and robustness to very small support sets.

Related papers

• Dual-Primal Graph VAEs for Noisy Label Aggregation [0.0]
  Inferring the ground-truth from noisy crowdsourced labels is an important theoretical and practical problem.<n>We propose a graph VAE architecture in which the decoder and encoder use GAT-based message passing on the adjacency graph of a crowdsourced dataset.<n>We show our model achieves state of the art performance on crowdsourcing benchmarks.
  arXiv  Detail & Related papers  (2026-08-11T22:24:16Z)
• Operational Feature Fingerprints of Graph Datasets via a White-Box Signal-Subspace Probe [0.3058685580689604]
  We propose WG-SRC, a white-box signal-subspace probe for prediction and graph dataset diagnosis.<n>It replaces learned message passing with a fixed, named graph-signal dictionary containing raw features.<n>As a white-box graph-learning instrument, WG-SRC uses predictive performance to validate its diagnostics.
  arXiv  Detail & Related papers  (2026-04-24T16:00:53Z)
• Graph Your Own Prompt [44.358377952850994]
  Graph Consistency Regularization (GCR) is a framework that injects relational graph structures, derived from model predictions, into the learning process.<n>GCR promotes cleaner feature structure, stronger intra-class cohesion, and improved generalization, offering a new perspective on learning from prediction structure.
  arXiv  Detail & Related papers  (2025-09-27T15:45:07Z)
• Gradient-Free Classifier Guidance for Diffusion Model Sampling [4.450496470631169]
  Gradient-free Guidance (GFCG) method consistently improves class prediction accuracy. For ImageNet 512$times$512, we achieve a record $FD_textDINOv2$ 23.09, while simultaneously attaining a higher classification Precision (94.3%) compared to ATG (90.2%)
  arXiv  Detail & Related papers  (2024-11-23T00:22:21Z)
• Graph Mining under Data scarcity [6.229055041065048]
  We propose an Uncertainty Estimator framework that can be applied on top of any generic Graph Neural Networks (GNNs) We train these models under the classic episodic learning paradigm in the $n$-way, $k$-shot fashion, in an end-to-end setting. Our method outperforms the baselines, which demonstrates the efficacy of the Uncertainty Estimator for Few-shot node classification on graphs with a GNN.
  arXiv  Detail & Related papers  (2024-06-07T10:50:03Z)
• Exploring Beyond Logits: Hierarchical Dynamic Labeling Based on Embeddings for Semi-Supervised Classification [49.09505771145326]
  We propose a Hierarchical Dynamic Labeling (HDL) algorithm that does not depend on model predictions and utilizes image embeddings to generate sample labels. Our approach has the potential to change the paradigm of pseudo-label generation in semi-supervised learning.
  arXiv  Detail & Related papers  (2024-04-26T06:00:27Z)
• Learning to Approximate Adaptive Kernel Convolution on Graphs [4.434835769977399]
  We propose a diffusion learning framework, where the range of feature aggregation is controlled by the scale of a diffusion kernel. Our model is tested on various standard for node-wise classification for the state-of-the-art datasets performance. It is also validated on a real-world brain network data for graph classifications to demonstrate its practicality for Alzheimer classification.
  arXiv  Detail & Related papers  (2024-01-22T10:57:11Z)
• Transductive Linear Probing: A Novel Framework for Few-Shot Node Classification [56.17097897754628]
  We show that transductive linear probing with self-supervised graph contrastive pretraining can outperform the state-of-the-art fully supervised meta-learning based methods under the same protocol. We hope this work can shed new light on few-shot node classification problems and foster future research on learning from scarcely labeled instances on graphs.
  arXiv  Detail & Related papers  (2022-12-11T21:10:34Z)
• Similarity-aware Positive Instance Sampling for Graph Contrastive Pre-training [82.68805025636165]
  We propose to select positive graph instances directly from existing graphs in the training set. Our selection is based on certain domain-specific pair-wise similarity measurements. Besides, we develop an adaptive node-level pre-training method to dynamically mask nodes to distribute them evenly in the graph.
  arXiv  Detail & Related papers  (2022-06-23T20:12:51Z)
• Geometer: Graph Few-Shot Class-Incremental Learning via Prototype Representation [50.772432242082914]
  Existing graph neural network based methods mainly focus on classifying unlabeled nodes within fixed classes with abundant labeling. In this paper, we focus on this challenging but practical graph few-shot class-incremental learning (GFSCIL) problem and propose a novel method called Geometer. Instead of replacing and retraining the fully connected neural network classifer, Geometer predicts the label of a node by finding the nearest class prototype.
  arXiv  Detail & Related papers  (2022-05-27T13:02:07Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)
• Heuristic Semi-Supervised Learning for Graph Generation Inspired by Electoral College [80.67842220664231]
  We propose a novel pre-processing technique, namely ELectoral COllege (ELCO), which automatically expands new nodes and edges to refine the label similarity within a dense subgraph. In all setups tested, our method boosts the average score of base models by a large margin of 4.7 points, as well as consistently outperforms the state-of-the-art.
  arXiv  Detail & Related papers  (2020-06-10T14:48:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.