Papers by Juanhui Li
Distance-Based Propagation for Efficient Knowledge Graph Reasoning (2023.emnlp-main)
Copied to clipboard
| Challenge: | Knowledge graph completion (KGC) aims to predict unseen edges in knowledge graphs (KGs) . a few recent attempts to address this problem sacrifice the performance to gain efficiency. |
| Approach: | They propose a method that aggregates path information to solve this problem by aggregating paths in a fixed window for each source-target pair. |
| Outcome: | The proposed method can cut down on the number of propagated messages by 90% while achieving competitive performance on multiple KG datasets. |
Are Message Passing Neural Networks Really Helpful for Knowledge Graph Completion? (2023.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graphs are far from complete with large portions of triplets missing. |
| Approach: | They propose to use Graph Neural Networks to learn powerful embeddings to improve model performance. |
| Outcome: | The proposed models achieve comparable performance to MLP models, suggesting that MP may not be as crucial as previously thought. |
Learning with Less: Knowledge Distillation from Large Language Models via Unlabeled Data (2025.findings-naacl)
Copied to clipboard
Juanhui Li, Sreyashi Nag, Hui Liu, Xianfeng Tang, Sheikh Muhammad Sarwar, Limeng Cui, Hansu Gu, Suhang Wang, Qi He, Jiliang Tang
| Challenge: | Large Language Models (LLMs) have demonstrated superior language understanding abilities in many real-world NLP applications. |
| Approach: | They propose a learning-based sample selection method that incorporates signals from both teacher and student to enhance model performance. |
| Outcome: | The proposed method improves model performance across datasets with higher data efficiency. |