Papers by Dong Liang
Verified Critical Step Optimization for LLM Agents (2026.findings-acl)
Copied to clipboard
| Challenge: | Critical Step Optimization (CSO) focuses preference learning on verified critical steps where alternative actions demonstrably flip task outcomes from failure to success. |
| Approach: | They propose a method which focuses preference learning on verified critical steps where alternative actions demonstrably flip task outcomes from failure to success. |
| Outcome: | The proposed method outperforms the existing methods on GAIA-Text-103 and XBench-DeepSearch while requiring supervision at only 16% of trajectory steps. |
Convolutional Interaction Network for Natural Language Inference (D18-1)
Copied to clipboard
| Challenge: | Attention-based neural models have achieved great success in natural language inference (NLI). |
| Approach: | They propose a general model to capture the interaction between two sentences, which can be an alternative to the attention mechanism for NLI. |
| Outcome: | The proposed model can capture complex interactions on three large datasets. |
SDBench: A Survey-based Domain-specific LLM Benchmarking and Optimization Framework (2025.acl-long)
Copied to clipboard
| Challenge: | acquiring domain-specific knowledge often requires professional expert manpower. |
| Approach: | They propose a generic framework for generating evaluation datasets for domain-specific LLMs. |
| Outcome: | The proposed framework reduces the reliance on expert manpower while ensuring that the collected data is uniformly distributed. |
CLOMO: Counterfactual Logical Modification with Large Language Models (2024.acl-long)
Copied to clipboard
Yinya Huang, Ruixin Hong, Hongming Zhang, Wei Shao, Zhicheng Yang, Dong Yu, Changshui Zhang, Xiaodan Liang, Linqi Song
| Challenge: | Existing studies on evaluating model reasoning are limited in both form and content. |
| Approach: | They propose a task to cultivate counterfactual thought processes within large language models and an evaluation metric to evaluate their natural language output instead of modeling the task as a multiple-choice problem. |
| Outcome: | The proposed evaluation metric aligns well with human preference. |
Topology Matters: Measuring Memory Leakage in Multi-Agent LLMs (2026.findings-acl)
Copied to clipboard
| Challenge: | Multi-agent LLMs are rapidly moving from prototype to real-world use . network topology is a first-order security parameter in multi-aggent systems . |
| Approach: | They propose a framework for comparing topology-conditioned memory leakage in multi-agent LLM systems. |
| Outcome: | The proposed framework evaluates topology-conditioned memory leakage in multi-agent LLM systems. |
MinerU2.5: A Decoupled Vision-Language Model for Efficient High-Resolution Document Parsing (2026.acl-industry)
Copied to clipboard
Junbo Niu, Zheng Liu, Zhuangcheng Gu, Bin Wang, Linke Ouyang, Zhiyuan Zhao, Tao Chu, Tianyao He, Fan Wu, Qintong Zhang, Zhenjiang Jin, Guang Liang, Rui Zhang, Wenzheng Zhang, Yuan Qu, Zhifei Ren, Yuefeng Sun, Zirui Tang, Boyu Niu, Yuanhong Zheng, Dongsheng Ma, Ziyang Miao, Hejun Dong, Siyi Qian, Junyuan Zhang, Fangdong Wang, Jingzhou Chen, Xiaomeng Zhao, Liqun Wei, Wei Li, Shasha Wang, RuiLiang Xu, Yuanyuan Cao, Lu Chen, Qianqian Wu, Huaiyu Gu, Lindong Lu, Dechen Lin, null Shenguanlin, Xuanhe Zhou, Linfeng Zhang, Yuhang Zang, Xiaoyi Dong, Jiaqi Wang, Bo Zhang, Lei Bai, Pei Chu, Weijia Li, Jiang Wu, Lijun Wu, Zhenxiang Li, Guangyu Wang, Zhongying Tu, Chao Xu, Kai Chen, Bowen Zhou, Dahua Lin, Wentao Zhang, Conghui He
| Challenge: | Document images are characterized by higher resolutions, denser content, and more complex structural layouts. |
| Approach: | They propose a 1.2B-parameter document parsing vision-language model that decouples layout analysis from local content recognition. |
| Outcome: | The proposed model surpasses general-purpose and domain-specific models on multiple benchmarks while maintaining significantly lower computational overhead. |
Emphasising Structured Information: Integrating Abstract Meaning Representation into LLMs for Enhanced Open-Domain Dialogue Evaluation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing evaluation metrics struggle to evaluate adversarial negative examples . existing metrics struggle in handling adversarials, resulting in low correlations with human judgments. |
| Approach: | They propose a framework that integrates AMR and domain-specific language models for automatic open-domain dialogue evaluation. |
| Outcome: | The proposed evaluation framework achieves strong correlations with human judgments across multiple datasets. |
Cocktail: A Comprehensive Information Retrieval Benchmark with LLM-Generated Documents Integration (2024.findings-acl)
Copied to clipboard
Sunhao Dai, Weihao Liu, Yuqi Zhou, Liang Pang, Rongju Ruan, Gang Wang, Zhenhua Dong, Jun Xu, Ji-Rong Wen
| Challenge: | Large Language Models (LLMs) have led to an influx of AI-generated content on the internet, transforming corpus of Information Retrieval (IR) systems from human-written to a coexistence with LLM-generated contents. |
| Approach: | They propose a benchmark named Cocktail that compares IR models with LLMs to find relevant documents and passages from a corpus. |
| Outcome: | The proposed benchmark aims to evaluate IR models in the mixed-sourced data landscape of the LLM era. |
PFDial: A Structured Dialogue Instruction Fine-tuning Method Based on UML Flowcharts (2025.findings-acl)
Copied to clipboard
Ming Zhang, Yuhui Wang, Yujiong Shen, Tingyi Yang, Changhao Jiang, Yilong Wu, Shihan Dou, Qinhao Chen, Zhiheng Xi, Zhihao Zhang, Yi Dong, Zhen Wang, Zhihui Fei, Mingyang Wan, Tao Liang, Guojun Ma, Qi Zhang, Tao Gui, Xuanjing Huang
| Challenge: | Large Language Models (LLMs) have shown remarkable progress in dialogue and reasoning, but they struggle to solve strictly constrained dialogue tasks. |
| Approach: | They construct a dataset that contains 12,705 high-quality Chinese dialogue instructions from 440 flowcharts containing 5,055 process nodes. |
| Outcome: | The proposed model outperforms GPT-4o models on backward transitions and outperformed GPT-42 models on the same dataset. |
CLUE: A Chinese Language Understanding Evaluation Benchmark (2020.coling-main)
Copied to clipboard
Liang Xu, Hai Hu, Xuanwei Zhang, Lu Li, Chenjie Cao, Yudong Li, Yechen Xu, Kai Sun, Dian Yu, Cong Yu, Yin Tian, Qianqian Dong, Weitang Liu, Bo Shi, Yiming Cui, Junyi Li, Jun Zeng, Rongzhao Wang, Weijian Xie, Yanting Li, Yina Patterson, Zuoyu Tian, Yiwen Zhang, He Zhou, Shaoweihua Liu, Zhe Zhao, Qipeng Zhao, Cong Yue, Xinrui Zhang, Zhengliang Yang, Kyle Richardson, Zhenzhong Lan
| Challenge: | Existing language evaluation benchmarks for English are limited to English . lack of such benchmarks makes it difficult to replicate success in other languages . |
| Approach: | They introduce a large-scale Chinese language understanding evaluation benchmark . the benchmark uses a set of current state-of-the-art pre-trained Chinese models . |
| Outcome: | The first large-scale Chinese Language Understanding Evaluation (CLUE) benchmark is released . the benchmark evaluates models across a wide range of tasks on original Chinese text . existing language evaluation benchmarks are mostly limited to English . |
Too Correct to Learn: Reinforcement Learning on Saturated Reasoning Data (2026.acl-short)
Copied to clipboard
| Challenge: | Strong base models saturate benchmarks, resulting in weaker performance, a paradox . a new approach to Reinforcement Learning (RL) is needed to improve performance . |
| Approach: | They propose a method that uses constrained uniform top-k sampling to flatten the local optimization landscape by sampling uniformly from constrained high-confidence candidates. |
| Outcome: | Experiments show that the proposed approach prevents policy degeneration and boosts out-of-domain generalization. |
PAD-Net: An Efficient Framework for Dynamic Networks (2023.acl-long)
Copied to clipboard
| Challenge: | Dynamic networks can significantly improve the model’s representation power with acceptable computational cost. |
| Approach: | They propose a partially dynamic network to transform redundant dynamic parameters into static ones and iterative mode partition to partition dynamic and static parameters efficiently. |
| Outcome: | The proposed network surpasses fully dynamic networks by +0.7% top-1 acc with only 30% dynamic parameters for DY-Conv and +1.9% average score in language understanding with only 50% dynamic parameters. |
From Specific-MLLMs to Omni-MLLMs: A Survey on MLLMs Aligned with Multi-modalities (2025.findings-acl)
Copied to clipboard
Shixin Jiang, Jiafeng Liang, Jiyuan Wang, Xuan Dong, Heng Chang, Weijiang Yu, Jinhua Du, Ming Liu, Bing Qin
| Challenge: | MLLMs are able to integrate multiple modalities into a single model to tackle complex tasks in real-world scenarios. |
| Approach: | They propose a comprehensive survey of Omni-MLLMs to address the challenges and opportunities of multimodal modeling. |
| Outcome: | The proposed model can integrate multiple modalities into a single model and provide novel perspectives. |
What If Consensus Lies? Selective-Complementary Reinforcement Learning at Test Time (2026.acl-long)
Copied to clipboard
| Challenge: | Existing TTRL methods rely on positive pseudo-labeling strategies to enhance reasoning capabilities. |
| Approach: | They propose a test-time reinforcement learning framework that mitigates label noise amplification by deriving pseudo-rewards from majority voting consensus. |
| Outcome: | The proposed framework mitigates label noise amplification by implementing selective positive pseudo-labeling and entropy-gated negative p-labeled pruning. |
Your Reasoning Model is Secretly a Reward Model - Optimization-Free Verification from Experience (2026.acl-long)
Copied to clipboard
| Challenge: | Existing verifiers operate on the surface text or on confidence proxies derived from token probabilities, which can be brittle. |
| Approach: | They propose a training-free, non-parametric verifier that summarizes each reasoning trace by an activation delta and compares it to two class centroids computed from labeled experience. |
| Outcome: | The proposed model improves selection and reranking on large and less-calibrated models. |
EduBench: A Comprehensive Benchmarking Dataset for Evaluating Large Language Models in Diverse Educational Scenarios (2026.acl-long)
Copied to clipboard
Bin Xu, Yu Bai, Huashan Sun, Yiguan Lin, Siming Liu, Xinyue Liang, Yaolin Li, Zhuangzhi Dong, Jingren Zhang, Yufan Deng, Xinyu Zou, Yang Gao, Heyan Huang
| Challenge: | Existing benchmarks that focus on knowledge-intensive tasks do not reflect diverse educational scenarios. |
| Approach: | They propose a benchmark that incorporates 9 major scenarios and 4,000 educational contexts. |
| Outcome: | The proposed model performs comparable to state-of-the-art large models on the test set. |
MorphoBench: A Benchmark with Difficulty Adaptive to Model Reasoning (2026.findings-acl)
Copied to clipboard
Xukai Wang, Xuanbo Liu, Mingrui Chen, Haitian Zhong, Xuanlin Yang, Bohan Zeng, Jinbo Hu, Hao Liang, Junbo Niu, Xuchen Li, Ruitao Wu, Ruichuan An, Yang Shi, Liu Liu, Qiang Liu, Zhouchen Lin, Xu-Yao Zhang, Wentao Zhang, Bin Dong
| Challenge: | Existing benchmarks designed to evaluate the reasoning capabilities of large models are limited in scope and lack flexibility to adapt difficulty according to evolving reasoning capacities of models. |
| Approach: | They propose a benchmark that incorporates multidisciplinary questions to evaluate the reasoning capabilities of large models and can adjust and update question difficulty based on the reasoning abilities of advanced models. |
| Outcome: | The proposed benchmark incorporates multidisciplinary questions to evaluate the reasoning capabilities of large models and can adjust and update question difficulty based on the reasoning abilities of advanced models. |
Save the Good Prefix: Precise Error Penalization via Process-Supervised RL to Enhance LLM Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing reinforcement learning methods rely on sparse outcome rewards, which fail to credit correct intermediate steps in partially successful solutions. |
| Approach: | They propose a process reward model that rewards correct steps only when they detect errors . they propose VPPO, which rewards the correct prefix and an erroneous suffix . |
| Outcome: | a new approach outperforms sparse-reward RL and prior PRM-guided baselines on Pass@1 and Pass@K . a process reward model (PRM) outperformed sparser-rebound RL on multiple reasoning benchmarks . |
FTibSuite: A Comprehensive Resource Suite for Tibetan Vision–Language Modeling (2026.findings-acl)
Copied to clipboard
| Challenge: | FTibSuite provides an end-to-end training-and-evaluation workflow for vision–language models . Tibetan is underserved due to the lack of infrastructure for reproducible training and evaluation. |
| Approach: | They propose a resource-centric workflow for Tibetan VLMs that provides an end-to-end training-and-evaluation workflow and human-verified multimodal annotations. |
| Outcome: | FTibSuite provides an end-to-end training-and-evaluation workflow and human-verified multimodal annotations. |
SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapters (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Pretrain-finetuned models are increasingly complex and require more parameters to match the performance of full fine-tuning. |
| Approach: | They propose an efficient Adapter Tuning technique that freezes pretrained language models and fine-tunes a few extra modules. |
| Outcome: | The proposed setting outperforms the standard Adapter Tuning by 80% . the proposed setting is easy to use and has a high sparse ratio . |
Optimal Partial Transport Based Sentence Selection for Long-form Document Matching (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for document matching are limited by the partial nature of the sentence-level matching signals. |
| Approach: | They propose a matching approach that equips existing document matching models with an Optimal Partial Transport component, namely OPT-Match, which selects the key sentences that play a major role in matching. |
| Outcome: | The proposed approach outperforms existing models on four publicly available datasets and the key sentences selected by it are consistent with human-provided rationales. |
Never Lost in the Middle: Mastering Long-Context Question Answering with Position-Agnostic Decompositional Training (2024.acl-long)
Copied to clipboard
Junqing He, Kunhao Pan, Xiaoqun Dong, Zhuoyang Song, LiuYiBo LiuYiBo, Qianguosun Qianguosun, Yuxin Liang, Hao Wang, Enming Zhang, Jiaxing Zhang
| Challenge: | Large language models suffer from severe hallucinations, compromising performance in knowledge-oriented QA, dialogue, and writing. |
| Approach: | They propose to enhance the information searching and reflection ability of large language models by training them in position-agnostic multi-step QA tasks to improve their model's accuracy. |
| Outcome: | The proposed model improves in multi-doc QA and other benchmarks by 13.7% absolute gain in shuffled settings, by 21.5% in passage retrieval task. |
MinT: Boosting Generalization in Mathematical Reasoning via Multi-view Fine-tuning (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods focus on specializing LMs in mathematical reasoning and rely on knowledge distillation. |
| Approach: | They propose a multi-view fine-tuning method that exploits existing mathematical problem datasets with diverse annotation styles. |
| Outcome: | The proposed method outperforms existing methods that rely heavily on LLM teachers . it grants models generalization ability across views and datasets, and the capability to learn from inaccurate or incomplete data. |
EconProver: Towards More Economical Test-Time Scaling for Automated Theorem Proving (2026.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have recently advanced the field of Automated Theorem Proving (ATP) Existing cost analyses regulate only the number of sampling passes, ignoring the substantial disparities in sampling costs. |
| Approach: | They propose to integrate two complementary methods into a unified EconRL pipeline to increase pass rates under constrained sampling passes. |
| Outcome: | The proposed method reduces token usage and sample passes while maintaining the original performance. |
ReasMark: A Robust Watermark for Attributing LLM Reasoning Under Knowledge Distillation Attacks (2026.acl-long)
Copied to clipboard
Peizhuo Lv, Ruihua Zhou, Yunpeng Li, Ruigang Liang, Xingshuo Han, XiaoFeng Wang, Wei Dong, Yuling Liu
| Challenge: | Existing reasoning-enhanced large language models fail to provide reliable attribution of reasoning behavior once it is transferred through knowledge distillation. |
| Approach: | They propose to embed a reasoning-length gap in a model by querying a target domain and training a local student to imitate its outputs. |
| Outcome: | et al. show that ReasMark outperforms baselines while preserving task utility. |
AdaTag: Multi-Attribute Value Extraction from Product Profiles with Adaptive Decoding (2021.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to extract product attribute values are limited by knowledge sharing across different attributes. |
| Approach: | They propose to use adaptive decoding to handle extraction of product attribute values by parameterizing the decoder with pretrained attribute embeddings, through a hypernetwork and a Mixture-of-Experts module. |
| Outcome: | The proposed model is able to handle multiple attributes without sharing the entire network parameters across all attributes. |
EfficientBERT: Progressively Searching Multilayer Perceptron via Warm-up Knowledge Distillation (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Pre-trained language models have shown remarkable results on various NLP tasks. |
| Approach: | They propose to improve the feed-forward network (FFN) in BERT with a higher computational cost than improving the multi-head attention (MHA). |
| Outcome: | The proposed model is 6.9 smaller and 4.4 faster than BERTBASE and has competitive performances on GLUE and SQuAD Benchmarks. |
Learn Beyond The Answer: Training Language Models with Reflection for Mathematical Reasoning (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies focus on *broadening* the training set with data augmentation techniques to maximize such benefits. |
| Approach: | They propose a method that embeds problem reflection into each training instance. |
| Outcome: | The proposed method enhances performance in standard and complex scenarios that require reflective thinking. |
Supervised neural machine translation based on data augmentation and improved training & inference process (D19-52)
Copied to clipboard
| Challenge: | This paper describes the neural machine translation systems for the shared translation tasks of WAT 2019 . |
| Approach: | They propose a model for translation tasks of WAT 2019 that employs a Transformer model as the baseline and a deep layer model to improve translation quality. |
| Outcome: | The proposed methods can improve translation quality over traditional statistical machine translation (SMT) The proposed models can improve the translation quality of Japanese-English and Japanese-Chinese corpus. |
TRACE: Evaluating Execution Efficiency of LLM-Based Code Translation (2026.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have improved the functional correctness of code translation, but execution efficiency remains overlooked. |
| Approach: | They propose a benchmark to explicitly assess execution efficiency in LLM-translated code. |
| Outcome: | The proposed benchmark identifies that execution efficiency is an essential dimension of code translation . the results highlight that correctness and efficiency are often misaligned . |
Investigating and Enhancing the Robustness of Large Multimodal Models Against Temporal Inconsistency (2025.acl-long)
Copied to clipboard
Jiafeng Liang, Shixin Jiang, Xuan Dong, Ning Wang, Zheng Chu, Hui Su, Jinlan Fu, Ming Liu, See-Kiong Ng, Bing Qin
| Challenge: | Large Multimodal Models (LMMs) have demonstrated impressive performance on general video comprehension benchmarks, but their robustness needs to be thoroughly investigated for broader applications. |
| Approach: | They propose a temporal robustness benchmark which introduces temporal inconsistency perturbations separately at the visual and textual modalities to assess the robustness of models. |
| Outcome: | The proposed method improves the model’s robustness and reliability in temporal analysis. |
CodeV: Issue Resolving with Visual Data (2025.findings-acl)
Copied to clipboard
Linhao Zhang, Daoguang Zan, Quanshun Yang, Zhirong Huang, Dong Chen, Bo Shen, Tianyu Liu, Yongshun Gong, Huang Pengjie, Xudong Lu, Guangtai Liang, Lizhen Cui, Qianxiang Wang
| Challenge: | Large Language Models (LLMs) have expanded to more complex repository-level tasks. |
| Approach: | They propose a first approach to leveraging visual data to enhance the issue-resolving capabilities of Large Language Models (LLMs) they demonstrate the effectiveness of CodeV and provide valuable insights into leveraging visualization to resolve GitHub issues. |
| Outcome: | The proposed approach improves the issue-resolving capabilities of Large Language Models (LLMs) by using visual data. |
MetaLogic: Logical Reasoning Explanations with Fine-Grained Structure (2022.emnlp-main)
Copied to clipboard
| Challenge: | Current explanation datasets often employ synthetic data with simple reasoning structures. |
| Approach: | They propose a comprehensive logical reasoning explanation form that incorporates three main components to better fit the human cognitive process. |
| Outcome: | The proposed model performs better than existing models on real-life scenarios, but is more challenging for the current models. |