← Search

Qingqiang Sun

6 accepted papers

2026

Task-Aware Retrieval Augmentation for Dynamic Recommendation

AAAI 2026technical

Dynamic recommendation systems aim to provide personalized suggestions by modeling temporal user-item interactions across time-series behavioral data. Recent studies have leveraged pre-trained dynamic graph neural networks (GNNs) to learn user-item representations over temporal snapshot graphs. Howe

Cited by 0SourcePDFScholar
2025

Fourier Clouds: Fast Bias Correction for Imbalanced Semi-Supervised Learning

NeurIPS 2025poster

Pseudo-label-based Semi-Supervised Learning (SSL) often suffers from classifier bias, particularly under class imbalance, as inaccurate pseudo-labels tend to exacerbate existing biases towards majority classes. Existing methods, such as \textit{CDMAD}\cite{cdmad}, utilize simplistic reference inputs…

Cited by 0SourceScholar
2025

Out-of-Distribution Detection with Prototypical Outlier Proxy

AAAI 2025technical

Out-of-distribution (OOD) detection is a crucial task for deploying deep learning models in the wild. One of the major challenges is that well-trained deep models tend to perform over-confidence on unseen test data. Recent research attempts to leverage real or synthetic outliers to mitigate the issu…

2025

PRAGA: Prototype-aware Graph Adaptive Aggregation for Spatial Multi-modal Omics Analysis

AAAI 2025technical

Spatial multi-modal omics technology, highlighted by Nature Methods as an advanced biological technique in 2023, plays a critical role in resolving biological regulatory processes with spatial context. Recently, graph neural networks based on K-nearest neighbor (KNN) graphs have gained prominence in…

2025

Single-View Graph Contrastive Learning with Soft Neighborhood Awareness

AAAI 2025technical

Most graph contrastive learning (GCL) methods heavily rely on cross-view contrast, thus facing several concomitant challenges, such as the complexity of designing effective augmentations, the potential for information loss between views, and increased computational costs. To mitigate reliance on cro…

2025

Towards Continuous Reuse of Graph Models via Holistic Memory Diversification

ICLR 2025poster

This paper addresses the challenge of incremental learning in growing graphs with increasingly complex tasks. The goal is to continuously train a graph model to handle new tasks while retaining proficiency in previous tasks via memory replay. Existing methods usually overlook the importance of memor…

Cited by 0SourcePDFScholar