Related papers: GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model

GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model

URL: http://arxiv.org/abs/2605.05689v1
Date: Thu, 07 May 2026 05:29:57 GMT
Title: GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model
Abstract summary: Conditional generative models have been applied to graph prediction by modeling the target as a conditional distribution given the input graph.<n>We propose GCCM, a graph contrastive consistency model that goes beyond isolated pairwise matching between the same target at different noise levels.<n>We show that GCCM mitigates the shortcut solution and yields consistent performance improvements in graph prediction compared to deterministic predictors.
Score: 10.481950161450948
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Conditional generative models, particularly diffusion-based methods, have recently been applied to graph prediction by modeling the target as a conditional distribution given the input graph, yielding competitive results compared to deterministic predictor. However, existing diffusion-based prediction methods typically require expensive iterative denoising at inference and often suffer from unstable sampling, which motivates recent efforts to reduce inference denoising steps and enable stable sampling via techniques such as consistency training. Despite this progress, we find that existing consistency training methods for graph prediction could potentially fall into a shortcut solution: the model may attempt to satisfy the self-consistency constraint by ignoring the noisy target (i.e., assigning it negligible weight), ultimately collapsing into a purely deterministic predictor. To mitigate such shortcut solution, we propose GCCM, a graph contrastive consistency model that goes beyond isolated pairwise matching between the same target at different noise levels by introducing negative pairs into a contrastive consistency objective. This adds an additional separation requirement, making the shortcut solution no longer trivially sufficient to satisfy the proposed objective. Moreover, we apply feature perturbation to the input node/edge features to break identical conditioning on the input graph, so that the shortcut no longer yields the same predictions across noise levels and becomes less attractive. Extensive experiments on benchmark datasets demonstrate that GCCM mitigates the shortcut solution and yields consistent performance improvements in graph prediction compared to deterministic predictors.

Related papers

Unrestrained Simplex Denoising for Discrete Data. A Non-Markovian Approach Applied to Graph Generation [50.328122325596865]
We introduce simplex denoising, a simple yet effective generative framework that operates on the probability simplex.<n>For a given clean data point, noisy representations at different times are conditionally independent.<n> Empirically, emphunrestrained simplex denoising surpasses strong discrete diffusion and flow-matching baselines.
arXiv Detail & Related papers (2026-03-30T15:26:56Z)
Search-Augmented Masked Diffusion Models for Constrained Generation [47.47350674873298]
Search-Augmented Masked Diffusion (SearchDiff) is a training-free neurosymbolic inference framework that integrates informed search directly into the reverse denoising process.<n>SearchDiff substantially improves constraint satisfaction and property adherence, while consistently outperforming discrete diffusion and autoregressive baselines.
arXiv Detail & Related papers (2026-02-02T19:43:25Z)
Singleton-Optimized Conformal Prediction [20.966568503308213]
Conformal prediction can be used to construct single prediction sets that cover the true outcome with a desired probability.<n>We propose a new non-oriented score that aims to minimize unambiguous.<n>average probability of producing non-conformity sets.
arXiv Detail & Related papers (2025-09-28T22:20:40Z)
Uncertainty-Aware Graph Self-Training with Expectation-Maximization Regularization [2.743479615751918]
We propose a novel emphuncertainty-aware graph self-training approach for semi-supervised node classification.<n>Our method incorporates an uncertainty mechanism during pseudo-label generation and model retraining.<n>Our framework is designed to handle noisy graph structures and feature spaces more effectively.
arXiv Detail & Related papers (2025-03-26T21:52:21Z)
Error-quantified Conformal Inference for Time Series [55.11926160774831]
Uncertainty quantification in time series prediction is challenging due to the temporal dependence and distribution shift on sequential data.<n>We propose itError-quantified Conformal Inference (ECI) by smoothing the quantile loss function.<n>ECI can achieve valid miscoverage control and output tighter prediction sets than other baselines.
arXiv Detail & Related papers (2025-02-02T15:02:36Z)
Asymmetric Graph Error Control with Low Complexity in Causal Bandits [21.812120023339876]
It is assumed that both the causal topology and the distribution of interventions are unknown.<n>New uncertainty bound drives an upper confidence bound-based intervention selection to optimize the reward.<n>Averaged over 100 randomly generated causal bandits, the proposed scheme takes significantly fewer samples to learn the causal structure.
arXiv Detail & Related papers (2024-08-20T23:37:08Z)
Fine-grained Forecasting Models Via Gaussian Process Blurring Effect [6.472434306724611]
Time series forecasting is a challenging task due to the existence of complex and dynamic temporal dependencies. Using more training data is one way to improve the accuracy, but this source is often limited. We are building on successful denoising approaches for image generation by advocating for an end-to-end forecasting and denoising paradigm.
arXiv Detail & Related papers (2023-12-21T20:25:16Z)
Regularized Vector Quantization for Tokenized Image Synthesis [126.96880843754066]
Quantizing images into discrete representations has been a fundamental problem in unified generative modeling. deterministic quantization suffers from severe codebook collapse and misalignment with inference stage while quantization suffers from low codebook utilization and reconstruction objective. This paper presents a regularized vector quantization framework that allows to mitigate perturbed above issues effectively by applying regularization from two perspectives.
arXiv Detail & Related papers (2023-03-11T15:20:54Z)
Improving Adaptive Conformal Prediction Using Self-Supervised Learning [72.2614468437919]
We train an auxiliary model with a self-supervised pretext task on top of an existing predictive model and use the self-supervised error as an additional feature to estimate nonconformity scores. We empirically demonstrate the benefit of the additional information using both synthetic and real data on the efficiency (width), deficit, and excess of conformal prediction intervals.
arXiv Detail & Related papers (2023-02-23T18:57:14Z)
Bayesian Graph Contrastive Learning [55.36652660268726]
We propose a novel perspective of graph contrastive learning methods showing random augmentations leads to encoders. Our proposed method represents each node by a distribution in the latent space in contrast to existing techniques which embed each node to a deterministic vector. We show a considerable improvement in performance compared to existing state-of-the-art methods on several benchmark datasets.
arXiv Detail & Related papers (2021-12-15T01:45:32Z)
Goal-directed Generation of Discrete Structures with Conditional Generative Models [85.51463588099556]
We introduce a novel approach to directly optimize a reinforcement learning objective, maximizing an expected reward. We test our methodology on two tasks: generating molecules with user-defined properties and identifying short python expressions which evaluate to a given target value.
arXiv Detail & Related papers (2020-10-05T20:03:13Z)

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