Papers by Ran Liu
Progra: Progress-Aware Reinforcement Learning for Multi-Turn Function Calling (2026.findings-acl)
Copied to clipboard
Huacan Chai, Zijie Cao, Maolin Ran, Yingxuan Yang, Jianghao Lin, Xin Peng, Hairui Wang, Renjie Ding, Ziyu Wan, Muning Wen, Weiwen Liu, Weinan Zhang, Fei Huang, Ying Wen
| Challenge: | Existing methods for multi-turn function calling are limited by redundancy and lack explicit integration of progress awareness into training. |
| Approach: | They propose a framework that explicitly integrates progress awareness into LLM training for multi-turn function calling. |
| Outcome: | Empirical results show that Progra outperforms existing methods on two public benchmarks. |
SumSurvey: An Abstractive Dataset of Scientific Survey Papers for Long Document Summarization (2024.findings-acl)
Copied to clipboard
| Challenge: | a growing need for long document summarization datasets with 16k input is causing problems. |
| Approach: | They propose to use a dataset to analyze salient information in long document summarizations. |
| Outcome: | The proposed dataset outperforms existing models and LLMs in the distribution form of salient information and the distribution of salinal information is an indicator of quality. |
“What is the value of templates?” Rethinking Document Information Extraction Datasets for LLMs (2024.findings-emnlp)
Copied to clipboard
Ran Zmigrod, Pranav Shetty, Mathieu Sibue, Zhiqiang Ma, Armineh Nourbakhsh, Xiaomo Liu, Manuela Veloso
| Challenge: | Existing work on prompt-response datasets for visually rich document understanding (VRDU) is labor-intensive. |
| Approach: | They propose a set of questions that are transformed from a key information extraction template to a prompt-response format using a plethora of bespoke templates. |
| Outcome: | The proposed datasets are compared with baseline models on K2Q with zero-shot prompting. |
LoopCoder: Scaling Code Intelligence via Looped Language Models (2026.findings-acl)
Copied to clipboard
Jian Yang, Wei Zhang, Shuyue Guo, Yizhi LI, Linzheng Chai, Zhengmao Ye, Shukai Liu, Yuyang Song, Jiajun Wu, Che Liu, Tianyu Zheng, Siwei Wu, Leo L, Xudong Ma, Chuan Hao, Ran Tao, Yan Xing, Jianzhou Wang, Mingjie Tang, Aishan Liu, Zhoujun Li, Xianglong Liu, Weifeng Lv, Bryan Dai
| Challenge: | Large language models have mastered syntax-level code generation, but complex algorithmic reasoning remains a challenge. |
| Approach: | They propose a recurrent inductive bias that aligns with the recursive nature of programming logic. |
| Outcome: | The proposed model achieves comparable performance to standard dense models with more parameters. |
RoseRAG: Robust Retrieval-augmented Generation with Small-scale LLMs via Margin-aware Preference Optimization (2025.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) have impressive performance but face high computational costs and latency, limiting their deployment in resource-constrained settings. |
| Approach: | They propose a robust RAG framework for large language models via Margin-aware Preference Optimization to enhance the accuracy and reliability of SLMs. |
| Outcome: | The proposed framework surpasses state-of-the-art benchmarks on three open-domain question answering tasks. |
Can Language Models Capture Human Writing Preferences for Domain-Specific Text Summarization? (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent studies employ large language models as auxiliary tools for humancentered NLP. |
| Approach: | They construct a model to capture human writing preferences by fine-tuning pre-trained models with data and designing prompts to optimize the output of large language models. |
| Outcome: | The proposed model captures human writing preferences through the dimensions of length, content depth, tone & style, and summary format. |
Fine-Tuning Language Models with Differential Privacy through Adaptive Noise Allocation (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Language models can memorize detailed information and patterns, but raise privacy concerns . ANADP reduces the performance gap between regular and DP fine-tuning while maintaining the privacy constraints. |
| Approach: | They propose an algorithm that allocates additive noise based on the importance of model parameters to reduce the performance gap between regular fine-tuning and traditional DP fine- tuning. |
| Outcome: | The proposed algorithm narrows the performance gap between regular fine-tuning and traditional DP fine- tuning while maintaining privacy constraints. |
Rethinking the Role of Prompting Strategies in LLM Test-Time Scaling: A Perspective of Probability Theory (2025.acl-long)
Copied to clipboard
| Challenge: | Recent studies have shown that scaling test-time compute can also effectively improve reasoning. |
| Approach: | They propose a probabilistic method to efficiently predict scaling performance and identify the best prompting strategy under large sampling times. |
| Outcome: | The proposed method significantly improves the scaling performance of majority voting on large language models. |
Towards Provably Secure Generative AI: Reliable Consensus Sampling (2026.findings-acl)
Copied to clipboard
Yu Cui, Hang Fu, Sicheng Pan, Zhuoyu Sun, Yifei Liu, Yuhong Nie, Bo Ran, Baohan Huang, Xufeng Zhang, Haibin Zhang, Cong Zuo, Licheng Wang
| Challenge: | Existing research on generative AI security is driven by mutually reinforcing attack and defense methodologies grounded in empirical experience. |
| Approach: | They propose a new algorithm that uses a random sampling algorithm to control risk. |
| Outcome: | The proposed algorithm improves robustness and utility while maintaining latency comparable to existing algorithms. |
Intent Contrastive Learning Based on Multi-view Augmentation for Sequential Recommendation (2025.coling-main)
Copied to clipboard
Bo Pei, Yingzheng Zhu, Guangjin Wang, Huajuan Duan, Wenya Wu, Fuyong Xu, Yizhao Zhu, Peiyu Liu, Ran Lu
| Challenge: | Existing work on intent-related models fails to capture long-term dependencies in user behavior and fails to effectively utilize item relevance. |
| Approach: | They propose a sequential recommendation framework that combine temporal variability with position encoding that has extrapolation properties to encode sequences, thereby expanding the model’s view of user behavior. |
| Outcome: | The proposed model improves on three real datasets by 0.8% to 14.7% compared to baselines. |
InfiMM: Advancing Multimodal Understanding with an Open-Sourced Visual Language Model (2024.findings-acl)
Copied to clipboard
Haogeng Liu, Quanzeng You, Yiqi Wang, Xiaotian Han, Bohan Zhai, Yongfei Liu, Wentao Chen, Yiren Jian, Yunzhe Tao, Jianbo Yuan, Ran He, Hongxia Yang
| Challenge: | InfiMM is a multimodal large language model that adapts to complex vision-language tasks. |
| Approach: | They present a Multimodal Large Language Model that adapts to intricate vision-language tasks using large-scale training data and comprehensive training strategies. |
| Outcome: | Empirical evaluations across a variety of benchmarks underscore InfiMM’s remarkable capability in multimodal understanding. |
Self-Supervised Sentence Polishing by Adding Engaging Modifiers (2023.acl-demo)
Copied to clipboard
| Challenge: | a typical way to polish sentences is to add engaging modifiers, which enhance the meaning of the sentence. |
| Approach: | They propose a task that requires polishing sentences while maintaining fluency . they remove engaging modifiers from public resources and fine-tune LongLM to reconstruct original sentences from corrupted ones. |
| Outcome: | The proposed model generates more engaging sentences with suitable modifiers than strong baselines while keeping fluency. |
Rethinking Data Mixing from the Perspective of Large Language Models (2026.acl-short)
Copied to clipboard
Yuanjian Xu, Tianze Sun, Changwei Xu, XinLong Zhao, Jianing Hao, Ran Chen, Yang Liu, Ruijie Xu, Stephen Chen, Guang Zhang
| Challenge: | Existing methods to mix data with LLMs have relied on domain definitions derived from intuition. |
| Approach: | They propose a reweighting framework that restructures data scheduling as a graph-constrained optimization problem. |
| Outcome: | The proposed framework achieves competitive performance on GPT-2 models. |
Context-Aware Adapter Tuning for Few-Shot Relation Learning in Knowledge Graphs (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to predict instances for missing relations on knowledge graphs are limited by their limited training examples. |
| Approach: | They propose a context-aware adapter for few-shot relation learning in KGs . they propose tunable relation adaptation and contextual information for each relation . |
| Outcome: | Experiments on three benchmark KGs validate the superiority of RelAdapter over state-of-the-art methods. |
Translation vs. Dialogue: A Comparative Analysis of Sequence-to-Sequence Modeling (2020.coling-main)
Copied to clipboard
| Challenge: | Existing models for machine translation and dialogue response generation require a large number of handcrafted features. |
| Approach: | They propose to interpret a general neural model comparatively by using the seq2seq model in two mainstream NLP tasks. |
| Outcome: | The proposed model is used in two mainstream NLP tasks and is compared with a standard model. |
Decoupling Mixture-of-Graphs: Unseen Relational Learning for Knowledge Graph Completion by Fusing Ontology and Textual Experts (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for knowledge Graph Completion (KGC) fail in unseen relation representations. |
| Approach: | They propose to use three kinds of graphs to obtain unseen relation representations . they propose to decouple mixture-of-graph experts (DMoG) for unseened relations learning . |
| Outcome: | The proposed method outperforms the state-of-the-art methods on unseen relation representations. |
Geoparsing: Diagram Parsing for Plane and Solid Geometry with a Unified Formal Language (2026.findings-acl)
Copied to clipboard
Peijie Wang, Ming-Liang Zhang, Jun Cao, Chao Deng, Dekang Ran, Pi Bu, Hongda Sun, Xuan Zhang, Yingyao Wang, Jun Song, Bo Zheng, Fei Yin, Cheng-Lin Liu
| Challenge: | Recent advances in Multimodal Large Language Models (MLLMs) have demonstrated remarkable capabilities across various vision reasoning tasks. |
| Approach: | They propose a unified formal language that integrates plane and solid geometry, comprehensively covering geometric structures and semantic relations. |
| Outcome: | The proposed language achieves state-of-the-art parsing performance and significantly boosts MLLMs’ capabilities for downstream geometry reasoning tasks. |
SimRAG: Self-Improving Retrieval-Augmented Generation for Adapting Large Language Models to Specialized Domains (2025.naacl-long)
Copied to clipboard
Ran Xu, Hui Liu, Sreyashi Nag, Zhenwei Dai, Yaochen Xie, Xianfeng Tang, Chen Luo, Yang Li, Joyce C. Ho, Carl Yang, Qi He
| Challenge: | Retrieval-augmented generation (RAG) enhances the question answering abilities of large language models (LLMs) however, adapting general-purpose RAG systems to specialized fields poses unique challenges due to distribution shifts and limited access to domain-specific data. |
| Approach: | They propose a method that equips large language models with joint capabilities of question answering and question generation for domain adaptation. |
| Outcome: | Experiments on 11 datasets across three different domains verify the efficacy of SimRAG over baselines by 1.2%–8.6%. |
Does Large Language Model Contain Task-Specific Neurons? (2024.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable capabilities in comprehensively handling various types of natural language processing (NLP) tasks. |
| Approach: | They propose a method for task-specific neuron localization based on Causal Gradient Variation with Special Tokens (CGVST) this method identifies task- specific neurons by concentrating on the most significant tokens during task processing, eliminating redundant tokens and minimizing interference from non-essential neurons. |
| Outcome: | The proposed method can locate task-specific neurons across eight public tasks. |
NumNet: Machine Reading Comprehension with Numerical Reasoning (D19-1)
Copied to clipboard
| Challenge: | Existing numerical MRC models are weak in numerical reasoning, such as addition, subtraction, sorting and counting. |
| Approach: | They propose a numerical MRC model that integrates numerical reasoning into existing MRC models and achieves an EM-score of 64.56% on the DROP dataset. |
| Outcome: | The proposed model outperforms all existing machine reading comprehension models by considering the numerical relations among numbers on the DROP dataset. |
NeuralClassifier: An Open-source Neural Hierarchical Multi-label Text Classification Toolkit (P19-3)
Copied to clipboard
| Challenge: | NeuralClassifier is a toolkit for hierarchical multi-label text classification. |
| Approach: | They propose a toolkit for neural hierarchical multi-label text classification . they use a variety of text encoders to implement the model . |
| Outcome: | The proposed model achieves comparable performance with reported results in the literature. |
Retrieval-based Knowledge Transfer: An Effective Approach for Extreme Large Language Model Compression (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Large-scale pre-trained language models (LLMs) have demonstrated exceptional performance in various natural language processing (NLP) tasks. |
| Approach: | They propose a new compression paradigm that extracts knowledge from pre-trained language models to construct a knowledge store from which the model can leverage it for effective inference. |
| Outcome: | The proposed model extracts knowledge from LLMs to construct a knowledge store, which the model can leverage for effective inference. |
InfiMM-WebMath-40B: Advancing Multimodal Pre-Training for Enhanced Mathematical Reasoning (2025.findings-emnlp)
Copied to clipboard
Xiaotian Han, Yiren Jian, Xuefeng Hu, Haogeng Liu, Yiqi Wang, Qihang Fan, Yuang Ai, Huaibo Huang, Ran He, Zhenheng Yang, Quanzeng You
| Challenge: | InfiMM-WebMath-40B is a dataset of interleaved image-text documents . it consists of 24 million web pages, 85 million image URLs, and 40 billion text tokens . |
| Approach: | InfiMM-WebMath-40B is a high-quality dataset of interleaved image-text documents . it contains 24 million web pages, 85 million image URLs, and 40 billion text tokens . |
| Outcome: | InfiMM-WebMath-40B is a high-quality dataset of interleaved image-text documents . it consists of 24 million web pages, 85 million image URLs, and 40 billion text tokens . |
Chinese Morph Resolution in E-commerce Live Streaming Scenarios (2025.naacl-industry)
Copied to clipboard
| Challenge: | Live morph resolution task is used to detect e-commerce live streaming violations . morphs are used to evade scrutiny and engage in false advertising . |
| Approach: | They propose a task to detect morph violations in live streaming scenarios . they use large language models to generate additional training data . |
| Outcome: | The proposed method improves performance and improves live streaming regulation. |
UniMorph 4.0: Universal Morphology (2022.lrec-1)
Copied to clipboard
Khuyagbaatar Batsuren, Omer Goldman, Salam Khalifa, Nizar Habash, Witold Kieraś, Gábor Bella, Brian Leonard, Garrett Nicolai, Kyle Gorman, Yustinus Ghanggo Ate, Maria Ryskina, Sabrina Mielke, Elena Budianskaya, Charbel El-Khaissi, Tiago Pimentel, Michael Gasser, William Abbott Lane, Mohit Raj, Matt Coler, Jaime Rafael Montoya Samame, Delio Siticonatzi Camaiteri, Esaú Zumaeta Rojas, Didier López Francis, Arturo Oncevay, Juan López Bautista, Gema Celeste Silva Villegas, Lucas Torroba Hennigen, Adam Ek, David Guriel, Peter Dirix, Jean-Philippe Bernardy, Andrey Scherbakov, Aziyana Bayyr-ool, Antonios Anastasopoulos, Roberto Zariquiey, Karina Sheifer, Sofya Ganieva, Hilaria Cruz, Ritván Karahóǧa, Stella Markantonatou, George Pavlidis, Matvey Plugaryov, Elena Klyachko, Ali Salehi, Candy Angulo, Jatayu Baxi, Andrew Krizhanovsky, Natalia Krizhanovskaya, Elizabeth Salesky, Clara Vania, Sardana Ivanova, Jennifer White, Rowan Hall Maudslay, Josef Valvoda, Ran Zmigrod, Paula Czarnowska, Irene Nikkarinen, Aelita Salchak, Brijesh Bhatt, Christopher Straughn, Zoey Liu, Jonathan North Washington, Yuval Pinter, Duygu Ataman, Marcin Wolinski, Totok Suhardijanto, Anna Yablonskaya, Niklas Stoehr, Hossep Dolatian, Zahroh Nuriah, Shyam Ratan, Francis M. Tyers, Edoardo M. Ponti, Grant Aiton, Aryaman Arora, Richard J. Hatcher, Ritesh Kumar, Jeremiah Young, Daria Rodionova, Anastasia Yemelina, Taras Andrushko, Igor Marchenko, Polina Mashkovtseva, Alexandra Serova, Emily Prud’hommeaux, Maria Nepomniashchaya, Fausto Giunchiglia, Eleanor Chodroff, Mans Hulden, Miikka Silfverberg, Arya D. McCarthy, David Yarowsky, Ryan Cotterell, Reut Tsarfaty, Ekaterina Vylomova
| Challenge: | The Universal Morphology project provides broad-coverage instantiated morphological inflection tables for hundreds of diverse languages. |
| Approach: | They propose a language-independent feature schema for rich morphological annotation and a type-level resource of annotated data in diverse languages realizing that schema. |
| Outcome: | The proposed schema has added 66 new languages, including 24 endangered languages. |
OpenRubrics: Towards Scalable Synthetic Rubric Generation for Reward Modeling and LLM Alignment (2026.acl-long)
Copied to clipboard
| Challenge: | Existing reward models rely on scalar or pairwise judgments that fail to capture multifaceted nature of human preferences. |
| Approach: | They propose a rubric-based reward model that uses a large collection of prompt, rubric pairs to generate a scalar score or preference label for each response. |
| Outcome: | The proposed model surpasses strong size-matched baselines by 8.4% across multiple benchmarks. |
xLAM: A Family of Large Action Models to Empower AI Agent Systems (2025.naacl-long)
Copied to clipboard
Jianguo Zhang, Tian Lan, Ming Zhu, Zuxin Liu, Thai Quoc Hoang, Shirley Kokane, Weiran Yao, Juntao Tan, Akshara Prabhakar, Haolin Chen, Zhiwei Liu, Yihao Feng, Tulika Manoj Awalgaonkar, Rithesh R N, Zeyuan Chen, Ran Xu, Juan Carlos Niebles, Shelby Heinecke, Huan Wang, Silvio Savarese, Caiming Xiong
| Challenge: | Autonomous agents powered by large language models (LLMs) have attracted significant research interest, but there are few standards for developing specialized models for agent tasks. |
| Approach: | They propose a series of large action models with dense and mixture-of-expert architectures that unifies, augments, and synthesizes diverse datasets to enhance agent generalizability and performance. |
| Outcome: | The proposed models outperform GPT-4, Claude-3, and many other models in terms of tool use and outperformed GPT-based models on multiple agent ability benchmarks. |
Multilingual Knowledge Graph Completion from Pretrained Language Models with Knowledge Constraints (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for multilingual knowledge graph completion do not align with mKGC tasks because of their English-centric bias. |
| Approach: | They propose to use multilingual pretrained language models to solve queries in different languages by reasoning a tail entity. |
| Outcome: | The proposed method outperforms the previous SOTA on Hits@1 and Hits @10 by 12.32% and 16.03% on public datasets. |
Polymorphic Universal Transformer (2026.acl-long)
Copied to clipboard
Yilong Chen, Zitian Gao, Yihao Xiao, Jason Klein Liu, Xinyu Yang, Yifan Luo, Haoming Luo, Zhengmao Ye, Tingwen Liu, Ran Tao, Bryan Dai
| Challenge: | Compute Distribution Skew is a pathological phenomenon in ultra-deep recurrent models . it causes over-smoothing, representation rank collapse, and degraded reasoning performance. |
| Approach: | They propose a dynamic architecture that redefines recursive computation by decoupling parameter count from depth. |
| Outcome: | The proposed model significantly improves representation rank and reasoning robustness while reducing computation by 64.7%. |
EquiBench: Benchmarking Large Language Models’ Reasoning about Program Semantics via Equivalence Checking (2025.emnlp-main)
Copied to clipboard
Anjiang Wei, Jiannan Cao, Ran Li, Hongyu Chen, Yuhui Zhang, Ziheng Wang, Yuan Liu, Thiago S. F. X. Teixeira, Diyi Yang, Ke Wang, Alex Aiken
| Challenge: | EquiBench is a new benchmark to evaluate large language models' ability to reason about program semantics . Unlike natural language, code is executable. |
| Approach: | They propose a benchmark to evaluate large language models through equivalence checking . EquiBench consists of 2400 program pairs across four languages and six categories . |
| Outcome: | The proposed benchmark consists of 2400 program pairs across four languages and six categories. |
Multilingual Knowledge Graph Completion via Efficient Multilingual Knowledge Sharing (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing MKGC research ignores the shareability of cross-lingual knowledge. |
| Approach: | They propose a multilingual knowledge Graph Completion framework that leverages multilingual shared knowledge to significantly enhance performance through two components: Knowledge-level Grouped Mixture of Experts (KL-GMoE) and Iterative Entity Reranking (IER). |
| Outcome: | The proposed framework achieves improvements of 5.47%, 3.27%, and 1.01% in the Hits@1, Hits @3, and Hits_10 metrics, respectively, compared with existing state-of-the-art (SOTA) MKGC method. |
Crab: A Novel Configurable Role-Playing LLM with Assessing Benchmark (2025.acl-long)
Copied to clipboard
Kai He, Yucheng Huang, Wenqing Wang, Delong Ran, Dongming Sheng, Junxuan Huang, Qika Lin, Jiaxing Xu, Wenqiang Liu, Mengling Feng
| Challenge: | Existing RP-LLMs employ only a single role with numerous dialogues, but Crab enables dynamic configuration of desired roles, thereby enhancing related flexibility and adaptability. |
| Approach: | They propose a Configurable Role-Playing LLM with Assessing Benchmark that combines a Role dataset curation, persona-emodying Llm construction, and comprehensive benchmark creation for RP dialogue generation. |
| Outcome: | The proposed model outperforms existing LLMs in performing fine-grained evaluations of RP while keeping dialogue per role minimal. |
Wav2SQL: Direct Generalizable Speech-To-SQL Parsing (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing models for speech-driven SQL parsing are based on a cascaded approach, resulting in data scarcity and inconsistent performance. |
| Approach: | They propose a direct generalizable speech-to-SQL parsing model which avoids error compounding across cascaded systems. |
| Outcome: | The proposed model avoids error compounding and achieves state-of-the-art results by 4.7% improvement over baseline. |