Papers by Binbin Liu
Adaptive Hyper-parameter Learning for Deep Semantic Retrieval (2023.emnlp-industry)
Copied to clipboard
| Challenge: | Existing methods for deep semantic retrieval are highly sensitive to hyper-parameters . a novel adaptive metric learning method is proposed to overcome this limitation . |
| Approach: | They propose a method that adaptively obtains hyper-parameters without fixed or extra-trainable hyper-parmeters . they adopt a symmetric metric learning method to mitigate model collapse issues . |
| Outcome: | The proposed method outperforms existing methods on a real-world dataset and brings economic benefits. |
Learning to Plan for Retrieval-Augmented Large Language Models from Knowledge Graphs (2024.findings-emnlp)
Copied to clipboard
Junjie Wang, Mingyang Chen, Binbin Hu, Dan Yang, Ziqi Liu, Yue Shen, Peng Wei, Zhiqiang Zhang, Jinjie Gu, Jun Zhou, Jeff Pan, Wen Zhang, Huajun Chen
| Challenge: | Recent studies have attempted to enhance the performance of large language models (LLMs) in complex question-answering (QA) tasks by combining step-wise planning with external retrieval. |
| Approach: | They propose a framework for enhancing LLMs’ planning capabilities by using planning data derived from knowledge graphs (KGs). |
| Outcome: | The proposed framework improves LLMs’ planning capabilities by using knowledge graphs (KGs) the proposed framework is compared with existing frameworks on multiple datasets and shows that it is effective for large language models. |
GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs (2026.findings-acl)
Copied to clipboard
Meixiu Long, Duolin Sun, Dan Yang, Yihan Jiao, Lei Liu, Jiahai Wang, Binbin Hu, Yue Shen, Jie Feng, Zhehao Tan, Junjie Wang, Lianzhen Zhong, Jian Wang, Peng Wei, Jinjie Gu
| Challenge: | Existing rankers excel in lexical-matching scenarios, while they struggle with complex queries requiring deep reasoning. |
| Approach: | They propose a new paradigm that balances flexibility and context awareness to unlock the full potential of groupwise reranking. |
| Outcome: | The proposed approach achieves a state-of-the-art 65.2 NDCG@10 on BRIGHT and surpasses baselines by 2.1 points on R2MED while delivering a 6.4 inference speedup. |
NeuReduce: Reducing Mixed Boolean-Arithmetic Expressions by Recurrent Neural Network (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Mixed Boolean-Arithmetic (MBA) expressions are difficult to simplify because of interleaving bitwise and arithmical operations. |
| Approach: | They propose a method to learn and reduce MBA expressions using a string to string method . they propose to use a dataset to train the method to reduce MBA rules . |
| Outcome: | The proposed method outperforms all other tools in terms of accuracy, solving time, and performance overhead. |
Breaking the Hourglass Phenomenon of Residual Quantization: Enhancing the Upper Bound of Generative Retrieval (2024.emnlp-industry)
Copied to clipboard
Zhirui Kuai, Zuxu Chen, Huimu Wang, Mingming Li, Dadong Miao, Wang Binbin, Xusong Chen, Li Kuang, Yuxing Han, Jiaxing Wang, Guoyu Tang, Lin Liu, Songlin Wang, Jingwei Zhuo
| Challenge: | Generative retrieval (GR) is a transformative paradigm in search and recommender systems . however, data sparsity and long-tailed distribution hinder the full utilization of GR . |
| Approach: | They propose a method to reduce the "Hourglass" phenomenon in RQ-SID where codebook tokens become overly concentrated. |
| Outcome: | The proposed methods improve retrieval efficiency and generalization capabilities. |
Unlocking General Long Chain-of-Thought Reasoning Capabilities of Large Language Models via Representation Engineering (2025.acl-long)
Copied to clipboard
| Challenge: | Existing work finds that long CoT reasoning can be efficiently elicited by tuning on only a few examples and can easily transfer to other tasks. |
| Approach: | They propose a representation engineering method to unleash the general long CoT reasoning capabilities of LLMs. |
| Outcome: | The proposed method is effective in in-domain and cross-domain scenarios. |
GraphMR: Graph Neural Network for Mathematical Reasoning (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have shown the effectiveness of sequence-to-sequence (Seq2Seque) on mathematics solving. |
| Approach: | They propose a graph-to-sequence neural network which can learn hierarchical information of graphs inputs to solve mathematical problems and speculate answers. |
| Outcome: | The proposed neural network outperforms other neural networks in hidden information learning and mathematics resolving. |
Towards Tracing Knowledge in Language Models Back to the Training Data (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Prior work on training data attribution (TDA) may offer effective tools for identifying such examples, known as "proponents". |
| Approach: | They propose a benchmark to identify which training examples taught an LM to generate a particular factual assertion. |
| Outcome: | The proposed methods have lower proponent-retrieval precision than baselines that do not have access to the LM. |