Papers by Jianbo Li
Collaborative Chain-of-Agents for Parametric-Retrieved Knowledge Synergy (2026.acl-long)
Copied to clipboard
| Challenge: | Existing RAG methods focus on external retrieval, while ignoring the rich content of the model. |
| Approach: | They propose a framework that enhances explicit synergy over parametric and retrieved knowledge by integrating external retrieval components into the input context of the LLMs. |
| Outcome: | The proposed framework enhances explicit synergy over parametric and retrieved knowledge. |
CRAB: Cross-environment Agent Benchmark for Multimodal Language Model Agents (2025.findings-acl)
Copied to clipboard
Tianqi Xu, Linyao Chen, Dai-Jie Wu, Yanjun Chen, Zecheng Zhang, Xiang Yao, Zhiqiang Xie, Yongchao Chen, Shilong Liu, Bochen Qian, Anjie Yang, Zhaoxuan Jin, Jianbo Deng, Philip Torr, Bernard Ghanem, Guohao Li
| Challenge: | Existing benchmarks for MLM agents in interactive environments are limited by their focus on a single environment, lack of detailed and generalized evaluation methods, and the complexity of constructing tasks and evaluators. |
| Approach: | They propose a cross-environment agent benchmark framework that integrates graph-based evaluation and task generation methods. |
| Outcome: | The proposed framework supports multiple devices and can be easily extended to any environment with a Python interface. |
GainRAG: Preference Alignment in Retrieval-Augmented Generation through Gain Signal Synthesis (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to retrieve information from large language models (LLMs) but they fail to address the preference gap between retrievers and LLMs. |
| Approach: | They propose a retrieval module that dynamically injects retrieved information into the input context of large language models (LLMs) This approach aligns the retriever’s and LLM’s preferences by defining a new metric, “gain”, which measure how well an input passage contributes to correct outputs. |
| Outcome: | The proposed approach has shown significant success in various NLP tasks, but there is a preference gap between retrievers and LLMs. |
LICHEE: Improving Language Model Pre-training with Multi-grained Tokenization (2021.findings-acl)
Copied to clipboard
| Challenge: | Pre-trained language models are trained based on single-grained tokenization, making it hard to learn the precise meaning of coarse-grain words and phrases. |
| Approach: | They propose a language model pretraining method that incorporates multi-grained information of input text into pre-trained language models. |
| Outcome: | The proposed method improves performance on CLUE and SuperGLUE in Chinese and English with little extra inference cost. |
SPACE-2: Tree-Structured Semi-Supervised Contrastive Pre-training for Task-Oriented Dialog Understanding (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for dialog understanding only consider self-augmented dialogs as positive samples and treat all other dialogs like negative ones. |
| Approach: | They propose a tree-structured pre-trained conversation model which learns dialog representations from limited labeled dialogs and large-scale unlabeled dialog corpora via semi-supervised contrastive pre-training. |
| Outcome: | The proposed model can achieve state-of-the-art results on the DialoGLUE benchmark. |
LLaMA-Berry: Pairwise Optimization for Olympiad-level Mathematical Reasoning via O1-like Monte Carlo Tree Search (2025.naacl-long)
Copied to clipboard
Di Zhang, Jianbo Wu, Jingdi Lei, Tong Che, Jiatong Li, Tong Xie, Xiaoshui Huang, Shufei Zhang, Marco Pavone, Yuqiang Li, Wanli Ouyang, Dongzhan Zhou
| Challenge: | LLaMA-Berry is an advanced mathematical reasoning framework to enhance the problem-solving ability of large language models (LLMs). |
| Approach: | They propose a Monte Carlo Tree Search and Self-Refine framework to optimize reasoning paths and a pairwise reward model to evaluate different paths globally. |
| Outcome: | The proposed framework overcomes inefficiencies and limitations of step-wise and greedy search algorithms, enabling more efficient exploration of solution spaces. |