Papers by Fan Luo
DSP: Discriminative Soft Prompts for Zero-Shot Entity and Relation Extraction (2023.findings-acl)
Copied to clipboard
| Challenge: | Prompt-based methods have shown their efficacy in transferring general knowledge within pre-trained language models (PLMs) however, when applied to zero-shot entity and relation extraction, they struggle with the limited coverage of verbalizers to labels and the slow inference speed. |
| Approach: | They propose a method which reformulates zero-shot tasks into token discrimination tasks without having to construct verbalizers. |
| Outcome: | The proposed method outperforms baselines on two zero-shot entity recognition datasets with higher inference speed and achieves 7.5% improvement over previous state-of-the-art models on Wiki-ZSL and FewRel. |
Adaptive Policy with Wait-k Model for Simultaneous Translation (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to simultaneous machine translation require a robust read/write policy . a standalone multi-path wait-k model performs competitively with adaptive policies . |
| Approach: | They propose a more flexible approach by decoupling the adaptive policy model from the translation model. |
| Outcome: | The proposed approach outperforms baseline approaches in translation tasks. |
SHARP: Unlocking Interactive Hallucination via Stance Transfer in Role-Playing LLMs (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing studies on social interactions neglect hallucination while struggling with poor generalizability and implicit character fidelity judgments. |
| Approach: | They propose a generalizable and explicit paradigm for uncovering interactive patterns of Large Language Models across diverse worldviews by defining interactive hallucination through stance transfer and SHARP, a benchmark built by extracting relations from commonsense knowledge graphs. |
| Outcome: | The proposed paradigm is generalizable and explicit and demonstrates its effectiveness and stability. |
DEMO: A Statistical Perspective for Efficient Image-Text Matching (2024.naacl-long)
Copied to clipboard
| Challenge: | Image-text matching is a problem that seeks to connect vision and language through semantic understanding. |
| Approach: | They propose a deep unsupervised hashing-based approach for image-text matching . they characterize each image using multiple augmented views, which are considered as samples . |
| Outcome: | The proposed approach achieves superior performance on image-text matching datasets compared with state-of-the-art methods. |
KETCHUP: K-Step Return Estimation for Sequential Knowledge Distillation (2026.findings-eacl)
Copied to clipboard
| Challenge: | Empirical evaluation shows that our approach yields superior performance in both standard task metrics and large language model (LLM)-based evaluation. |
| Approach: | They propose a K-step return estimation method for reinforcement learning (RL)-based knowledge distillation in text generation tasks using the Bellman Optimality Equation. |
| Outcome: | The proposed method performs better on standard task metrics and large language model evaluations on three text generation tasks. |
Better Simultaneous Translation with Monotonic Knowledge Distillation (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods to train offline MT models require generating target tokens before source sentence is fully consumed. |
| Approach: | They propose a method that leverages traditional translation models as teachers to generate monotonic yet accurate reference translations for sequence-level knowledge distillation. |
| Outcome: | The proposed approach improves on strong baselines and on a monotonic version of the WMT15 De-En test set. |
DecBERT: Enhancing the Language Understanding of BERT with Causal Attention Masks (2022.findings-naacl)
Copied to clipboard
| Challenge: | Experimental results show that Transformer Encoder model can't automatically capture word order, so explicit position embeddings are required to be fed into the target model. |
| Approach: | They propose a Transformer-based language model DecBERT that uses a causal attention mask to capture word order. |
| Outcome: | The proposed model improves on the GLUE language understanding benchmark and accelerates the pre-training process. |
Compressing then Matching: An Efficient Pre-training Paradigm for Multimodal Embedding (2026.acl-long)
Copied to clipboard
Da Li, Yuxiao Luo, Keping Bi, Jiafeng Guo, Wei Yuan, Biao Yang, Yan Wang, Fan Yang, Tingting Gao, Guorui Zhou
| Challenge: | Recent approaches demonstrate that MLLMs can be adapted into competitive embedding models via large-scale contrastive learning. |
| Approach: | They propose a compressed pre-training phase which serves as a warm-up stage for contrastive learning. |
| Outcome: | The proposed model achieves state-of-the-art among MLLMs of comparable size on the MMEB, realizing optimization in both efficiency and effectiveness. |
MARIO: MAth Reasoning with code Interpreter Output - A Reproducible Pipeline (2024.findings-acl)
Copied to clipboard
| Challenge: | Large language models lack mathematical reasoning, a hurdle on the path to true artificial general intelligence. |
| Approach: | They propose a protocol for fine-tuning large language models with a Python code interpreter to enhance the text analysis of the LLMs. |
| Outcome: | The proposed protocol improves the performance of a 7B-parameter LLM on the GSM8K and MATH datasets while allowing for an outlier-free value model-based inference method. |
Towards IP Intelligence: Benchmarking Large Language Models on Intellectual Property Knowledge and Practice (2026.findings-acl)
Copied to clipboard
Qiyao Wang, Guhong Chen, Hongbo Wang, Huaren Liu, Minghui Zhu, Zhifei Qin, Li Linwei, Yilin Yue, Shiqiang Wang, Jiayan Li, Wu Yihang, Ziqiang Liu, Longze Chen, Run Luo, Liyang Fan, Jiaming Li, Lei Zhang, Kan Xu, Hamid Alinejad-Rokny, Chengming Li, Shiwen Ni, Yuan Lin, Min Yang
| Challenge: | Existing datasets and benchmarks focus only on patents or cover limited aspects of the IP field, lacking alignment with real-world scenarios. |
| Approach: | They propose a bilingual IP task taxonomy and a large-scale bilingual benchmark to evaluate LLMs in real-world IP practice. |
| Outcome: | The proposed model achieves only 75.8% accuracy, indicating room for improvement . open-source IP and law-oriented models lag behind closed-source general-purpose models . |
BattleAgent: Multi-modal Dynamic Emulation on Historical Battles to Complement Historical Analysis (2024.emnlp-demo)
Copied to clipboard
Shuhang Lin, Wenyue Hua, Lingyao Li, Che-Jui Chang, Lizhou Fan, Jianchao Ji, Hang Hua, Mingyu Jin, Jiebo Luo, Yongfeng Zhang
| Challenge: | Recent advances in large language models have demonstrated impressive reasoning capabilities, indicating their potential to serve as the foundation for agents. |
| Approach: | They propose a detailed emulation system that combines large vision-language model and multi-agent system to emulate dynamic interactions between multiple agents over a period of time. |
| Outcome: | The proposed system combines large vision-language model and multi-agent system to emulate dynamic interactions between agents and their environments over a period of time. |
Eidos, INDRA, & Delphi: From Free Text to Executable Causal Models (N19-4)
Copied to clipboard
Rebecca Sharp, Adarsh Pyarelal, Benjamin Gyori, Keith Alcock, Egoitz Laparra, Marco A. Valenzuela-Escárcega, Ajay Nagesh, Vikas Yadav, John Bachman, Zheng Tang, Heather Lent, Fan Luo, Mithun Paul, Steven Bethard, Kobus Barnard, Clayton Morrison, Mihai Surdeanu
| Challenge: | a paper proposes a method for building probabilistic models of complex phenomena such as food insecurity . currently, these models are hand-built for each new situation and require months to construct . |
| Approach: | They propose an approach that builds executable probabilistic models from raw, free text. |
| Outcome: | The proposed approach builds executable probabilistic models from raw, free text. |
Improve Speech Translation Through Text Rewrite (2025.coling-industry)
Copied to clipboard
| Challenge: | Recent advances in speech translation (ST) research have focused on the unique characteristics of spontaneous speech, including accents and presentation quality. |
| Approach: | They propose to transform transcribed speech into a cleaner style more in line with the expectations of translation models built from written text. |
| Outcome: | Experiments on public and in-house translation models show that the proposed model can be effectively distilled into a standalone translation model. |
A Generative Framework for Personalized Sticker Retrieval (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing relevance-based generative retrieval methods lack personalization, leading to a mismatch between diverse user expectations and the retrieved results. |
| Approach: | They propose a representation learning model that learns discriminative user representations to encode user-specific sticker preferences. |
| Outcome: | The proposed framework outperforms state-of-the-art methods in generating relevant stickers for queries. |
AutoSchemaKG: Autonomous Knowledge Graph Construction through Dynamic Schema Induction from Web-Scale Corpora (2026.acl-long)
Copied to clipboard
Jiaxin Bai, Wei Fan, Qi Hu, Qing Zong, Chunyang Li, Hong Ting Tsang, Hongyu Luo, Yauwai Yim, Haoyu Huang, Xiao Zhou, Feng Qin, Tianshi Zheng, Xi Peng, Xin Yao, Huiwen Yang, Leijie Wu, JI Yi, Gong Zhang, Renhai Chen, Yangqiu Song
| Challenge: | Existing knowledge graph construction frameworks require predefined schemas, limiting their scalability and domain coverage. |
| Approach: | They propose a framework for fully autonomous knowledge graph construction that eliminates the need for predefined schemas. |
| Outcome: | The proposed framework outperforms state-of-the-art models on multi-hop QA tasks and enhances LLM factuality. |
Masked Language Models Know Which are Popular: A Simple Ranking Strategy for Commonsense Question Answering (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Empirical results show that pre-trained language models can improve the typical answer generation of GLMs. |
| Approach: | They propose a ranking strategy that exploits WordNet to train a ranker that picks out the most popular answers for commonsense questions. |
| Outcome: | The proposed ranking strategy is tested on a commonsense question answering (QA) dataset and on negative samples from WordNet. |
SummaCoz: A Dataset for Improving the Interpretability of Factual Consistency Detection for Summarization (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Summarization is an important application of Large Language Models. |
| Approach: | They integrate human-annotated and model-generated natural language explanations to elucidate how a summary deviates and becomes inconsistent with its source article. |
| Outcome: | The proposed model provides rationales for its judgments and improves its accuracy significantly. |
Scaling Laws for Code: A More Data-Hungry Regime (2026.acl-long)
Copied to clipboard
Xianzhen Luo, Wenzhen Zheng, Qingfu Zhu, Rongyi Zhang, Houyi Li, Siming Huang, YuanTao Fan, Wanxiang Che
| Challenge: | Code Large Language Models (LLMs) are revolutionizing software engineering, but scaling laws are primarily analyzed on Natural Language (NL). |
| Approach: | They fit Chinchilla law and Farsser law to test scaling laws for code . they find code is more data-hungry and requires higher data-to-parameter ratio . |
| Outcome: | The proposed scaling laws show that the more expressive Farsser law offers greater accuracy and scales with model size. |
CFBench: A Comprehensive Constraints-Following Benchmark for LLMs (2025.acl-long)
Copied to clipboard
Tao Zhang, ChengLIn Zhu, Yanjun Shen, Wenjing Luo, Yan Zhang, Hao Liang, Tao Zhang, Fan Yang, Mingan Lin, Yujing Qiao, Weipeng Chen, Bin Cui, Wentao Zhang, Zenan Zhou
| Challenge: | Existing evaluations of Large Language Models (LLMs) focus on fragmented constraints or narrow scenarios, but they overlook the comprehensiveness and authenticity of constraints from the user’s perspective. |
| Approach: | They propose a Chinese Comprehensive Constraints Following Benchmark for LLMs that compiles constraints from real-world instructions and constructs a systematic framework for constraint types. |
| Outcome: | The proposed framework integrates multi-dimensional assessment criteria with requirement prioritization, covering various perspectives of constraints, instructions, and requirement fulfillment. |
A Simple Concatenation can Effectively Improve Speech Translation (2023.acl-short)
Copied to clipboard
| Challenge: | Experimental results show that in our unified cross-modal ST model, models can effectively utilize the auxiliary information from speech and text. |
| Approach: | They propose a unified cross-modal ST method which concatenates speech and text as the input and builds a teacher that can utilize both cross-modities simultaneously. |
| Outcome: | The proposed method can effectively utilize the auxiliary information from speech and text, and achieve compelling results on MuST-C datasets. |
On the Intractability to Synthesize Factual Inconsistencies in Summarization (2024.findings-eacl)
Copied to clipboard
| Challenge: | Existing methods for detecting factual inconsistencies in abstractive summarization are lacking in factual consistency detection. |
| Approach: | They propose to use real model-generated summaries with human annotations to detect factual inconsistencies. |
| Outcome: | The proposed model outperforms the SOTA on CoGenSumm, FactCC, Frank, and SummEval datasets. |
Well Begun is Half Done: Low-resource Preference Alignment by Weak-to-Strong Decoding (2025.findings-acl)
Copied to clipboard
| Challenge: | Low-resource methods for LLM alignment have been popular, but still face challenges in obtaining high-quality and aligned content. |
| Approach: | They propose a framework to enhance alignment ability of base models by the guidance of a small aligned model. |
| Outcome: | The proposed framework outperforms baseline methods while avoiding degradation on downstream tasks. |
Competency-Aware Neural Machine Translation: Can Machine Translation Know its Own Translation Quality? (2022.emnlp-main)
Copied to clipboard
| Challenge: | Neural machine translation models are often criticized for failures that happen without competency awareness. |
| Approach: | They propose a method that extends conventional NMT with a self-estimator to translate a source sentence and estimate its competency. |
| Outcome: | The proposed method performs on translation tasks intact and on quality estimation tasks better than existing methods. |
OpenCoder: The Open Cookbook for Top-Tier Code Large Language Models (2025.acl-long)
Copied to clipboard
Siming Huang, Tianhao Cheng, Jason Klein Liu, Weidi Xu, Jiaran Hao, Liuyihan Song, Yang Xu, Jian Yang, Jiaheng Liu, Chenchen Zhang, Linzheng Chai, Ruifeng Yuan, Xianzhen Luo, Qiufeng Wang, YuanTao Fan, Qingfu Zhu, Zhaoxiang Zhang, Yang Gao, Jie Fu, Qian Liu, Houyi Li, Ge Zhang, Yuan Qi, Xu Yinghui, Wei Chu, Zili Wang
| Challenge: | Code LLMs lack reproducible data pipelines and training protocols for reproducible advancements in code intelligence. |
| Approach: | They propose a top-tier code LLM that releases model weights and inference code . reproducible data pipelines, rigorous experimental ablation results and training protocols are included . |
| Outcome: | The proposed model achieves comparable performance to leading models and serves as an "open cookbook" reproducible training data, rigorous experimental ablation results, and detailed training protocols are also included in the model. |
DELAN: Dual-Level Alignment for Vision-and-Language Navigation by Cross-Modal Contrastive Learning (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing studies focus on cross-modal attention at the fusion stage, but modality features generated by disparate uni-encoders reside in their own spaces, leading to a decline in the quality of cross-modulation and decision-making. |
| Approach: | They propose a framework to align navigation-related modalities before fusion by cross-modal contrastive learning. |
| Outcome: | The proposed framework integrates with the majority of existing models, resulting in improved navigation performance on various VLN benchmarks, including R2R, R4R, and CVDN. |
FaithBench: A Diverse Hallucination Benchmark for Summarization by Modern LLMs (2025.naacl-short)
Copied to clipboard
Forrest Sheng Bao, Miaoran Li, Renyi Qu, Ge Luo, Erana Wan, Yujia Tang, Weisi Fan, Manveer Singh Tamber, Suleman Kazi, Vivek Sourabh, Mike Qi, Ruixuan Tu, Chenyu Xu, Matthew Gonzales, Ofer Mendelevitch, Amin Ahmad
| Challenge: | Existing evaluations of hallucinations in large language models suffer from a lack of diversity and recency in the LLM and LLM families considered. |
| Approach: | They propose a summarization hallucination benchmark that challenges models to disagree on hallucines . they use models to generate answers or summaries from textual input . |
| Outcome: | The proposed model combines the best of 10 modern LLMs with ground truth annotations. |
HoWToBench: Holistic Evaluation for LLM’s Capability in Human-level Writing using Tree of Writing (2026.acl-long)
Copied to clipboard
Andrew Zhuoer Feng, Cunxiang Wang, Yu Luo, Lin Fan, Irene Zhou, Zikang Wang, Xiaotao Gu, Jie Tang, Hongning Wang, Minlie Huang
| Challenge: | Evaluating the writing capabilities of large language models remains a significant challenge due to the multidimensional nature of writing skills and the limitations of existing metrics. |
| Approach: | They propose to model the aggregation weights of sub-features in a tree-structured workflow and propose a Chinese writing benchmark that mitigates biases. |
| Outcome: | The proposed tree-of-writing (ToW) measures the writing capabilities of large language models (LLMs) in Chinese and shows that it mitigates biases and achieves a *0.93* Pearson correlation with human judgments. |
Easy and Efficient Transformer: Scalable Inference Solution For Large NLP Model (2022.naacl-industry)
Copied to clipboard
Gongzheng Li, Yadong Xi, Jingzhen Ding, Duan Wang, Ziyang Luo, Rongsheng Zhang, Bai Liu, Changjie Fan, Xiaoxi Mao, Zeng Zhao
| Challenge: | Recent studies show that transformer-based models are effective over many tasks, but they are expensive to deploy in the industrial application. |
| Approach: | They propose a transformer-based inference solution that optimizes kernels for long inputs and large hidden sizes and a flexible CUDA memory manager to reduce the memory footprint when deploying a large model. |
| Outcome: | The proposed solution achieves an average speedup of 1.40-4.20x on the transformer decoder layer with an A100 GPU. |
Datasets and Recipes for Video Temporal Grounding via Reinforcement Learning (2025.emnlp-industry)
Copied to clipboard
Ruizhe Chen, Tianze Luo, Zhiting Fan, Heqing Zou, Zhaopeng Feng, Guiyang Xie, Hansheng Zhang, Zhuochen Wang, Zuozhu Liu, Zhang Huaijian
| Challenge: | Existing methods for video temporal grounding suffer from limited temporal awareness and poor generalization. |
| Approach: | They propose a two-stage training framework that integrates supervised fine-tuning with reinforcement learning to improve both the accuracy and robustness of VTG models. |
| Outcome: | The proposed training framework outperforms existing models on multiple benchmarks on open-domain and challenging scenarios. |
SessionIntentBench: A Multi-task Inter-session Intention-shift Modeling Benchmark for E-commerce Customer Behavior Understanding (2026.findings-acl)
Copied to clipboard
Yuqi Yang, Weiqi Wang, Baixuan Xu, Wei Fan, Qing Zong, Chunkit Chan, Zheye Deng, Xin Liu, Yifan Gao, Changlong Yu, Chen Luo, Yang Li, Zheng Li, Qingyu Yin, Bing Yin, Yangqiu Song
| Challenge: | Existing models fail to capture and model customer intention effectively because of insufficient information exploitation and only apparent information like descriptions and titles are used. |
| Approach: | They propose to exploit existing session data to capture and model intention in E-commerce product purchase sessions using a multimodal benchmark. |
| Outcome: | The proposed framework can bridge the gap between intention understanding in simplified research cases like co-buy intention and more complex yet practical scenarios like session history. |
Hyperlink-induced Pre-training for Passage Retrieval in Open-domain Question Answering (2022.acl-long)
Copied to clipboard
Jiawei Zhou, Xiaoguang Li, Lifeng Shang, Lan Luo, Ke Zhan, Enrui Hu, Xinyu Zhang, Hao Jiang, Zhao Cao, Fan Yu, Xin Jiang, Qun Liu, Lei Chen
| Challenge: | Existing methods to train dense passage retrieval have a large data gap between upstream and downstream relevance. |
| Approach: | They propose a method to pre-train the dense retriever with the text relevance induced by hyperlinks within Web documents. |
| Outcome: | The proposed method outperforms existing methods under different scenarios and in the open-domain question answering domain. |
A STEP towards Interpretable Multi-Hop Reasoning:Bridge Phrase Identification and Query Expansion (2022.lrec-1)
Copied to clipboard
| Challenge: | Identifying bridge phrases remains one of the challenges for multi-hop question answering . |
| Approach: | They propose an unsupervised method for the identification of bridge phrases in multi-hop question answering . they construct a graph of noun phrases from the question and available context . |
| Outcome: | The proposed method improves all downstream components in a multi-hop QA system. |
EdgeInfinite: A Memory-Efficient Infinite-Context Transformer for Edge Devices (2025.acl-industry)
Copied to clipboard
| Challenge: | Existing KV cache optimizations struggle with irreversible token eviction in long-output tasks . alternative sequence modeling architectures prove costly to adopt within established Transformer infrastructures. |
| Approach: | They propose a memory-efficient solution for infinite contexts that integrates compressed memory into Transformer-based LLMs through a trainable memory-gating module. |
| Outcome: | The proposed solution achieves comparable performance to baseline Transformer-based LLMs while optimizing memory consumption and time to first token. |