Zonglin Li
Author directory2026
AgentCompass: A Unified Evaluation Infrastructure for Agent Capabilities
Dongsheng Zhu | Shufan Jiang | Wenhui Tian | Zixin Shang | Peiheng Zhou | Tianhao Liang | Mo Li | Qingqiu Li | Shudong Liu | Zonglin Li | Liwei Wu | Zichen Ding | Bowen Yang | Zehao Li | Zhenyu Wu | Jun XU | Zun Wang | Songyang Zhang | Dingbo Yuan | Ma Zerun | Kai Chen
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing: System Demonstrations
Dongsheng Zhu | Shufan Jiang | Wenhui Tian | Zixin Shang | Peiheng Zhou | Tianhao Liang | Mo Li | Qingqiu Li | Shudong Liu | Zonglin Li | Liwei Wu | Zichen Ding | Bowen Yang | Zehao Li | Zhenyu Wu | Jun XU | Zun Wang | Songyang Zhang | Dingbo Yuan | Ma Zerun | Kai Chen
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing: System Demonstrations
As Large Language Models (LLMs) evolve into autonomous agents, the need for unified evaluation platform becomes critical. However, current evaluation pipelines remain highly fragmented and tightly coupled, hindering reproducibility and causing redundant engineering. To address this, we introduce AgentCompass, an open-source, lightweight, and extensible platform for evaluating LLM-based agents. AgentCompass organizes the evaluation process around three independent components, namely Benchmark, Harness, and Environment, thereby enabling flexible configurations without requiring the reimplementation of complex execution logic. Furthermore, it features a fault-tolerant asynchronous runtime and comprehensive trajectory analysis tools to transparently diagnose nuanced failure modes like reward-hacking. Natively supporting over 20 benchmarks across five capability dimensions, AgentCompass provides the community with a scalable and reproducible infrastructure for advancing agent research.
2025
Tree-KG: An Expandable Knowledge Graph Construction Framework for Knowledge-intensive Domains
Songjie Niu | Kaisen Yang | Rui Zhao | Yichao Liu | Zonglin Li | Hongning Wang | Wenguang Chen
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Songjie Niu | Kaisen Yang | Rui Zhao | Yichao Liu | Zonglin Li | Hongning Wang | Wenguang Chen
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
In knowledge-intensive domains like scientific research, effective decisions rely on organizing and retrieving intricate data. Knowledge graphs (KGs) help by structuring entities, relations, and contextual dependencies, but building KGs in such domains is challenging due to inherent complexity, manual effort, and rapid evolution. Inspired by how humans organize knowledge hierarchically, we propose Tree-KG, an expandable framework that combines structured domain texts with advanced semantic techniques. First, Tree-KG builds a tree-like graph from textbook structures using large language models (LLMs) and domain-specific entities, creating an explicit KG. Then, through iterative expansion with flexible, predefined operators, it uncovers hidden KG while preserving semantic coherence. Experiments demonstrate that Tree-KG consistently surpasses competing methods, achieving the highest F1 scores (12–16% above the second-best), with notable performance (F1 0.81) on the Text-Annotated dataset, highlighting its effectiveness in extracting high-quality information from source texts. Additionally, Tree-KG provides superior structural alignment, domain-specific extraction, and cost-efficiency, delivering robust results with reduced token usage and adaptable, resource-conscious deployment.