← Search

Xuan Guo

5 accepted papers

2026

Towards OOD Generalization in Dynamic Graphs via Causal Invariant Learning

AAAI 2026technical

Although dynamic graph neural networks (DyGNNs) have demonstrated promising capabilities, most existing methods ignore out-of-distribution (OOD) shifts that commonly exist in dynamic graphs. Dynamic graph OOD generalization is non-trivial due to the following challenges: 1) Identifying invariant and

Cited by 2Source ↗PDF ↗Scholar ↗
2025

A Survey on Temporal Interaction Graph Representation Learning: Progress, Challenges, and Opportunities

IJCAI 2025

Temporal interaction graphs (TIGs), defined by sequences of timestamped interaction events, have become ubiquitous in real-world applications due to their capability to model complex dynamic system behaviors. As a result, temporal interaction graph representation learning (TIGRL) has garnered signif

2025

HGMP: Heterogeneous Graph Multi-Task Prompt Learning

IJCAI 2025

The pre-training and fine-tuning methods have gained widespread attention in the field of heterogeneous graph neural networks due to their ability to leverage large amounts of unlabeled data during the pre-training phase, allowing the model to learn rich structural features. However, these methods f

Cited by 0Source ↗PDF ↗Scholar ↗
2024

Retrieval Augmented Spelling Correction for E-Commerce Applications

EMNLP 2024industry

The rapid introduction of new brand names into everyday language poses a unique challenge for e-commerce spelling correction services, which must distinguish genuine misspellings from novel brand names that use unconventional spelling. We seek to address this challenge via Retrieval Augmented Genera…

Cited by 0Source ↗PDF ↗Scholar ↗
2021

Learning Stochastic Equivalence based on Discrete Ricci Curvature

IJCAI 2021poster

Role-based network embedding methods aim to preserve node-centric connectivity patterns, which are expressions of node roles, into low-dimensional vectors. However, almost all the existing methods are designed for capturing a relaxation of automorphic equivalence or regular equivalence. They may be…