RaDAR: Relation-aware Diffusion-Asymmetric Graph Contrastive Learning for Recommendation

• URL: http://arxiv.org/abs/2603.16800v1
• Date: Tue, 17 Mar 2026 17:05:23 GMT
• Title: RaDAR: Relation-aware Diffusion-Asymmetric Graph Contrastive Learning for Recommendation
• Abstract summary: RaDAR is a novel framework that combines a graph generative model to capture global structure and a relation-aware denoising model to refine noisy edges.<n>RaDAR consistently outperforms state-of-the-art methods, particularly under noisy and sparse conditions.
• Score: 12.682517297917828
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Collaborative filtering (CF) recommendation has been significantly advanced by integrating Graph Neural Networks (GNNs) and Graph Contrastive Learning (GCL). However, (i) random edge perturbations often distort critical structural signals and degrade semantic consistency across augmented views, and (ii) data sparsity hampers the propagation of collaborative signals, limiting generalization. To tackle these challenges, we propose RaDAR (Relation-aware Diffusion-Asymmetric Graph Contrastive Learning Framework for Recommendation Systems), a novel framework that combines two complementary view generation mechanisms: a graph generative model to capture global structure and a relation-aware denoising model to refine noisy edges. RaDAR introduces three key innovations: (1) asymmetric contrastive learning with global negative sampling to maintain semantic alignment while suppressing noise; (2) diffusion-guided augmentation, which employs progressive noise injection and denoising for enhanced robustness; and (3) relation-aware edge refinement, dynamically adjusting edge weights based on latent node semantics. Extensive experiments on three public benchmarks demonstrate that RaDAR consistently outperforms state-of-the-art methods, particularly under noisy and sparse conditions.

Related papers

• NOVA-GS: Noise-Aware View-Consistent Gaussian Splatting for Low-Light Novel View Synthesis [8.990930037094982]
  NOVA-GS is a noise-aware framework for low-light 3D Gaussian Splatting.<n>It subsumes enhancement, denoising, and geometry optimization within a single process.<n>Experiments on diverse real-world low-light datasets demonstrate improved geometric fidelity, color consistency, and robustness without requiring paired supervision or well-lit references.
  arXiv  Detail & Related papers  (2026-09-11T10:26:36Z)
• One Graph, Multiple Gains: Single High-Quality Item-Item Graph for Multimodal Recommendation [12.896323268160744]
  IIMRec is a framework that constructs a single high-quality item-item graph during preprocessing.<n>The graph is built by fusing semantic and co-occurrence signals, then refined via Neighborhood Consistency Edge Reweighting.<n>IIMRec consistently outperforms state-of-the-art baselines while running faster and consuming less GPU memory.
  arXiv  Detail & Related papers  (2026-07-27T16:09:28Z)
• Dynamic Spectral Denoising with Global-Context Attention for Multi-Behavior Recommendation [58.33732779555114]
  We argue that the key bottleneck is a representation-level failure caused by two coupled heterogeneities.<n>We propose Dynamic Spectral Denoising with Global-Context Attention for Multi-Behavior Recommendation (SpectraMB)<n>SpectraMB achieves the best results in most evaluation settings and exhibits improved robustness under noisy interactions.
  arXiv  Detail & Related papers  (2026-06-01T15:58:13Z)
• Denoising-GS: Gaussian Splatting with Spatial-aware Denoising [59.331050242447255]
  3D Gaussian Splatting (3DGS) has achieved remarkable success in high-fidelity Novel View Synthesis (NVS)<n>We introduce a new perspective by formulating the optimization of 3DGS as a primitive denoising process.<n>We propose Denoising-GS, a coherent denoising framework for primitives by taking both the positions and spatial structure into consideration.<n> Experiments conducted on three benchmark datasets demonstrate that Denoising-GS consistently enhances NVS fidelity while maintaining representation compactness.
  arXiv  Detail & Related papers  (2026-05-14T14:24:21Z)
• DCGL: Dual-Channel Graph Learning with Large Language Models for Knowledge-Aware Recommendation [15.461703772035415]
  We propose the Dual-Channel Graph Learning (DCGL) framework, featuring three key innovations.<n>DCGL consistently outperforms state-of-the-art methods, yielding substantial improvements in sparse scenarios.
  arXiv  Detail & Related papers  (2026-05-08T06:23:07Z)
• ERGO: Excess-Risk-Guided Optimization for High-Fidelity Monocular 3D Gaussian Splatting [63.138778159026934]
  We propose an adaptive optimization framework guided by excess risk decomposition, termed ERGO.<n> ERGO dynamically estimates the view-specific excess risk and adaptively adjust loss weights during optimization.<n>Experiments on the Google Scanned Objects dataset and the OmniObject3D dataset demonstrate the superiority of ERGO over existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-02-10T20:44:43Z)
• Why not Collaborative Filtering in Dual View? Bridging Sparse and Dense Models [17.01882282913444]
  Collaborative filtering remains the cornerstone of modern recommender systems.<n>We propose SaD (Sparse and Dense), a unified framework that integrates the semantic expressiveness of dense embeddings with the structural reliability of sparse interaction patterns.<n>We show that aligning these dual views yields a strictly superior global SNR.
  arXiv  Detail & Related papers  (2026-01-14T08:47:07Z)
• Spectral Neuro-Symbolic Reasoning II: Semantic Node Merging, Entailment Filtering, and Knowledge Graph Alignment [0.0]
  This report extends the Spectral Neuro-Symbolic Reasoning (Spectral NSR) framework by introducing three semantically grounded enhancements.<n>The novelty lies in performing semantic and symbolic refinement entirely upstream of the spectral inference stage.<n>The result is a more robust, interpretable, and scalable reasoning system suitable for deployment in open-domain and real-world settings.
  arXiv  Detail & Related papers  (2025-11-02T21:57:15Z)
• Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation [1.0128808054306186]
  Matrix completion is a widely adopted framework in recommender systems.<n>We propose a novel method called Matrix Completion using Contrastive Learning (MCCL)<n>Our approach not only improves the numerical accuracy of the predicted scores--but also produces superior rankings with improvements of up to 36% in ranking metrics.
  arXiv  Detail & Related papers  (2025-06-12T12:47:35Z)
• Diffusion-augmented Graph Contrastive Learning for Collaborative Filter [5.6604917723826365]
  Graph-based collaborative filtering has been established as a prominent approach in recommendation systems.<n>Recent advances in Graph Contrastive Learning have demonstrated promising potential to alleviate data sparsity issues.<n>We propose Diffusion-augmented Contrastive Learning (DGCL) for enhanced collaborative filtering.
  arXiv  Detail & Related papers  (2025-03-20T16:15:20Z)
• A Lesson in Splats: Teacher-Guided Diffusion for 3D Gaussian Splats Generation with 2D Supervision [65.33043028101471]
  We present a novel framework for training 3D image-conditioned diffusion models using only 2D supervision.<n>Most existing 3D generative models rely on full 3D supervision, which is impractical due to the scarcity of large-scale 3D datasets.
  arXiv  Detail & Related papers  (2024-12-01T00:29:57Z)
• Combating Bilateral Edge Noise for Robust Link Prediction [56.43882298843564]
  We propose an information-theory-guided principle, Robust Graph Information Bottleneck (RGIB), to extract reliable supervision signals and avoid representation collapse. Two instantiations, RGIB-SSL and RGIB-REP, are explored to leverage the merits of different methodologies. Experiments on six datasets and three GNNs with diverse noisy scenarios verify the effectiveness of our RGIB instantiations.
  arXiv  Detail & Related papers  (2023-11-02T12:47:49Z)
• Self-Contrastive Graph Diffusion Network [1.14219428942199]
  We propose a novel framework called the Self-Contrastive Graph Diffusion Network (SCGDN) Our framework consists of two main components: the Attentional Module (AttM) and the Diffusion Module (DiFM) Unlike existing methodologies, SCGDN is an augmentation-free approach that avoids "sampling bias" and semantic drift.
  arXiv  Detail & Related papers  (2023-07-27T04:00:23Z)
• Improving Contrastive Learning with Model Augmentation [123.05700988581806]
  The sequential recommendation aims at predicting the next items in user behaviors, which can be solved by characterizing item relationships in sequences. Due to the data sparsity and noise issues in sequences, a new self-supervised learning (SSL) paradigm is proposed to improve the performance.
  arXiv  Detail & Related papers  (2022-03-25T06:12:58Z)
• Interpretable Deep Graph Generation with Node-Edge Co-Disentanglement [55.2456981313287]
  We propose a new disentanglement enhancement framework for deep generative models for attributed graphs. A novel variational objective is proposed to disentangle the above three types of latent factors, with novel architecture for node and edge deconvolutions. Within each type, individual-factor-wise disentanglement is further enhanced, which is shown to be a generalization of the existing framework for images.
  arXiv  Detail & Related papers  (2020-06-09T16:33:49Z)

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.