← Search

Xunkai Li

15 accepted papers

2026

DANCE: Dynamic, Available, Neighbor-gated Condensation for Federated Text-Attributed Graphs

ICML 2026poster

Federated graph learning (FGL) enables collaborative training on graph data across multiple clients. With the rise of large language models (LLMs), textual attributes in FGL graphs are gaining attention. Text-attributed graph federated learning (TAG-FGL) improves FGL by explicitly leveraging LLMs to…

Cited by 0SourceScholar
2026

HIAL: Towards Semantics-Aware Hypergraph Active Learning via Dual-Perspective Information Maximization

ICML 2026poster

Hypergraph Neural Networks (HNNs) model high-order interactions effectively but rely on costly node annotations, motivating Hypergraph Active Learning (HAL). However, many HAL pipelines adapt graph-based querying through clique expansion, which introduces structural bias and can cause \emph{ranking …

Cited by 0SourceScholar
2026

OpenMAG: A Comprehensive Benchmark for Multimodal-Attributed Graph

ICML 2026poster

Multimodal-Attributed Graph (MAG) learning has achieved remarkable success in modeling complex real-world systems by integrating graph topology with rich attributes from multiple modalities. With the rapid proliferation of novel MAG models capable of handling intricate cross-modal semantics and stru…

Cited by 0SourceScholar
2026

PAGE: A Unified Approach for Federated Graph Unlearning

AAAI 2026technical

Federated graph learning (FGL) is a distributive framework for graph representation learning that prioritizes privacy preservation. The right to be forgotten embodies the ethical principle of prioritizing user autonomy over data usage. In the context of FGL, upholding this right requires the method

Cited by 0SourcePDFScholar
2026

Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms

ICML 2026poster

Graph coarsening reduces the size of a graph while preserving certain properties. Most existing methods preserve either spectral or spatial characteristics. Recent research has shown that preserving topological features helps maintain the predictive performance of graph neural networks (GNNs) traine…

Cited by 0SourceScholar
2026

Toward Effective Multimodal Graph Foundation Model: A Divide-and-Conquer Based Approach

ICML 2026poster

Graph Foundation Models (GFMs) have achieved remarkable success in generalizing across diverse domains. However, they mainly focus on Text-Attributed Graphs (TAGs), leaving Multimodal-Attributed Graphs (MAGs) largely untapped. Developing Multimodal Graph Foundation Models (MGFMs) allows for leveragi…

Cited by 0SourceScholar
2026

Towards Docking-oriented De Novo Ligand Design via Gradient Inversion

ICML 2026poster

De novo ligand design is a fundamental task that seeks to generate protein or molecule candidates that can effectively dock with protein receptors and achieve strong binding affinity entirely from scratch. It holds paramount significance for a wide spectrum of biomedical applications. However, most …

Cited by 0SourceScholar
2026

When LLMs Encounter Open-world Graph Learning: A Fresh View on Unlabeled Data Uncertainty

ICML 2026poster

Recently, large language models (LLMs) have driven a systematic shift in the graph ML com- munity through the adoption of text-attributed graphs (TAGs). Although a variety of frameworks have been developed, most fail to properly ad- dress the challenge of data uncertainty in open- world environments…

Cited by 0SourceScholar
2025

GraphMaster: Automated Graph Synthesis via LLM Agents in Data-Limited Environments

NeurIPS 2025spotlight

The era of foundation models has revolutionized AI research, yet Graph Foundation Models (GFMs) remain constrained by the scarcity of large-scale graph corpora. Traditional graph data synthesis techniques primarily focus on simplistic structural operations, lacking the capacity to generate semantica…

Cited by 0SourceScholar
2025

OpenGU: A Comprehensive Benchmark for Graph Unlearning

NeurIPS 2025poster

Graph Machine Learning is essential for understanding and analyzing relational data. However, privacy-sensitive applications demand the ability to efficiently remove sensitive information from trained graph neural networks (GNNs), avoiding the unnecessary time and space overhead caused by retraining…

Cited by 0SourcecodeScholar
2025

Toward Data-centric Directed Graph Learning: An Entropy-driven Approach

ICML 2025poster

Although directed graphs (digraphs) offer strong modeling capabilities for complex topological systems, existing DiGraph Neural Networks (DiGNNs) struggle to fully capture the concealed rich structural information. This data-level limitation results in model-level sub-optimal predictive performa…

Cited by 0SourcePDFScholar
2025

Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement

NeurIPS 2025poster

Recent advances in graph machine learning have shifted to data-centric paradigms, driven by two emerging research fields: (1) Federated graph learning (FGL) facilitates multi-client collaboration but struggles with data and task heterogeneity, resulting in limited practicality; (2) Graph fo…

Cited by 0SourceScholar
2024

FedTAD: Topology-aware Data-free Knowledge Distillation for Subgraph Federated Learning

IJCAI 2024poster

Subgraph federated learning (subgraph-FL) is a new distributed paradigm that facilitates the collaborative training of graph neural networks (GNNs) by multi-client subgraphs. Unfortunately, a significant challenge of subgraph-FL arises from subgraph heterogeneity, which stems from node and topology…

Cited by 14SourcePDFScholar
2024

Towards Effective and General Graph Unlearning via Mutual Evolution

AAAI 2024technical

With the rapid advancement of AI applications, the growing needs for data privacy and model robustness have highlighted the importance of machine unlearning, especially in thriving graph-based scenarios. However, most existing graph unlearning strategies primarily rely on well-designed architectures…