activity
20222025
most citedEvaluating Graph Neural Networks for Link Prediction: Current Pitfalls and New Benchmarking

26 citations · 55 across the 13 of their papers we have counts for

collaborators

13 papers

cs.AI2025

TRAJECT-Bench:A Trajectory-Aware Benchmark for Evaluating Agentic Tool Use

Pengfei He, Zhenwei Dai, Bing He +10

Large language model (LLM)-based agents increasingly rely on tool use to complete real-world tasks. While existing works evaluate the LLMs' tool use capability, they largely focus…

cs.CR2025

Comprehensive Vulnerability Analysis is Necessary for Trustworthy LLM-MAS

Pengfei He, Yue Xing, Juanhui Li +7

TThis paper argues that \textbf{a comprehensive vulnerability analysis is essential for building trustworthy Large Language Model-based Multi-Agent Systems (LLM-MAS)}. These system…

cs.AI2024

Learning with Less: Knowledge Distillation from Large Language Models via Unlabeled Data

Juanhui Li, Sreyashi Nag, Hui Liu +7

In real-world NLP applications, Large Language Models (LLMs) offer promising solutions due to their extensive training on vast datasets. However, the large size and high computatio…

cs.LG2024★ 1 cited

Node-wise Filtering in Graph Neural Networks: A Mixture of Experts Approach

Haoyu Han, Juanhui Li, Wei Huang +5

Graph Neural Networks (GNNs) have proven to be highly effective for node classification tasks across diverse graph structural patterns. Traditionally, GNNs employ a uniform global…

cs.IR2024

Enhancing ID and Text Fusion via Alternative Training in Session-based Recommendation

Juanhui Li, Haoyu Han, Zhikai Chen +4

Session-based recommendation has gained increasing attention in recent years, with its aim to offer tailored suggestions based on users' historical behaviors within sessions. To ad…

cs.LG2024★ 2 cited

Mixture of Link Predictors on Graphs

Li Ma, Haoyu Han, Juanhui Li +4

Link prediction, which aims to forecast unseen connections in graphs, is a fundamental task in graph machine learning. Heuristic methods, leveraging a range of different pairwise m…

cs.LG2023★ 1 cited

Distance-Based Propagation for Efficient Knowledge Graph Reasoning

Harry Shomer, Yao Ma, Juanhui Li +3

Knowledge graph completion (KGC) aims to predict unseen edges in knowledge graphs (KGs), resulting in the discovery of new facts. A new class of methods have been proposed to tackl…

cs.LG2023★ 18 cited

LPFormer: An Adaptive Graph Transformer for Link Prediction

Harry Shomer, Yao Ma, Haitao Mao +3

Link prediction is a common task on graph-structured data that has seen applications in a variety of domains. Classically, hand-crafted heuristics were used for this task. Heuristi…

cs.SI2023★ 4 cited

Revisiting Link Prediction: A Data Perspective

Haitao Mao, Juanhui Li, Harry Shomer +6

Link prediction, a fundamental task on graphs, has proven indispensable in various applications, e.g., friend recommendation, protein analysis, and drug interaction prediction. How…

cs.LG2023★ 26 cited

Evaluating Graph Neural Networks for Link Prediction: Current Pitfalls and New Benchmarking

Juanhui Li, Harry Shomer, Haitao Mao +5

Link prediction attempts to predict whether an unseen edge exists based on only a portion of edges of a graph. A flurry of methods have been introduced in recent years that attempt…

cs.LG2022★ 1 cited

Learning Representations for Hyper-Relational Knowledge Graphs

Harry Shomer, Wei Jin, Juanhui Li +2

Knowledge graphs (KGs) have gained prominence for their ability to learn representations for uni-relational facts. Recently, research has focused on modeling hyper-relational facts…

cs.AI2022★ 2 cited

Are Message Passing Neural Networks Really Helpful for Knowledge Graph Completion?

Juanhui Li, Harry Shomer, Jiayuan Ding +5

Knowledge graphs (KGs) facilitate a wide variety of applications. Despite great efforts in creation and maintenance, even the largest KGs are far from complete. Hence, KG completio…

cs.IR2022

Graph Enhanced BERT for Query Understanding

Juanhui Li, Yao Ma, Wei Zeng +4

Query understanding plays a key role in exploring users' search intents and facilitating users to locate their most desired information. However, it is inherently challenging since…