← Search

Ting Guo

7 accepted papers

2026

CCLRec: Consensus-driven Contrastive Learning for LLM-enhanced Graph Recommendation

ICML 2026poster

Recommendation systems seek to accurately model user preferences from a large set of candidate items. Graph neural networks (GNNs) have emerged as a dominant approach in this domain due to their ability to capture high-order user–item interactions. Recent efforts have aimed to enhance GNN-based repr…

Cited by 0SourceScholar
2026

H$^2$CL: Heterogeneity-Aware Hypergraph Contrastive Learning for Robust Representation

ICML 2026poster

In recent years, hypergraph contrastive learning methods have gained widespread attention due to their excellent performance in processing high-order structural data. However, traditional hypergraph learning method often assume that neighboring nodes are homogeneous, which can lead to the mixing of …

Cited by 0SourceScholar
2026

Q-SAM: Unlocking Sharpness-Aware Minimization for Generalization in Offline Reinforcement Learning

ICML 2026poster

Generalization remains a central challenge in offline reinforcement learning (RL), where policies are trained solely from static datasets and must perform reliably under distribution shift. While most existing offline RL methods focus on reducing training loss using standard optimizers such as Adam,…

Cited by 0SourceScholar
2026

Topological Anomaly Quantification for Semi-supervised Graph Anomaly Detection

ICLR 2026poster

Semi-supervised graph anomaly detection identifies nodes deviating from normal patterns using a limited set of labeled nodes. This paper specifically addresses the challenging scenario where only normal node labels are available. To address the challenge of anomaly scarcity in real-world graphs, gen…

Cited by 0SourceScholar
2025

FANS: A Flatness-Aware Network Structure for Generalization in Offline Reinforcement Learning

NeurIPS 2025poster

Offline reinforcement learning (RL) aims to learn optimal policies from static datasets while enhancing generalization to out-of-distribution (OOD) data. To mitigate overfitting to suboptimal behaviors in offline datasets, existing methods often relax constraints on policy and data or extract inform…

Cited by 0SourceScholar
2024

SpeAr: A Spectral Approach for Zero-Shot Node Classification

NeurIPS 2024poster

Zero-shot node classification is a vital task in the field of graph data processing, aiming to identify nodes of classes unseen during the training process. Prediction bias is one of the primary challenges in zero-shot node classification, referring to the model's propensity to misclassify nodes of…

Cited by 0SourcePDFScholar
2016

Infinite Hidden Semi-Markov Modulated Interaction Point Process

NeurIPS 2016poster

The correlation between events is ubiquitous and important for temporal events modelling. In many cases, the correlation exists between not only events' emitted observations, but also their arrival times. State space models (e.g., hidden Markov model) and stochastic interaction point process models…

Cited by 6SourcePDFScholar