Papers by Di Chen
Learning from Contrasts: Synthesizing Reasoning Paths from Diverse Search Trajectories (2026.acl-long)
Copied to clipboard
| Challenge: | MCTS methods retain only the single highest-reward trajectory, discarding comparative signals present in the many explored paths. |
| Approach: | They propose a framework that transforms supervision extraction into a synthesis procedure. |
| Outcome: | The proposed framework matches or exceeds baselines on 60K CRPS-synthesized examples on out-of-domain benchmarks. |
Biology-Instructions: A Dataset and Benchmark for Multi-Omics Sequence Understanding Capability of Large Language Models (2025.findings-emnlp)
Copied to clipboard
Haonan He, Yuchen Ren, Yining Tang, Ziyang Xu, Junxian Li, Minghao Yang, Di Zhang, Yuan Dong, Tao Chen, Shufei Zhang, Yuqiang Li, Nanqing Dong, Wanli Ouyang, Dongzhan Zhou, Peng Ye
| Challenge: | Biology-Instructions is the first large-scale instruction-tuning dataset for multi-omics biological sequences. |
| Approach: | They propose a large-scale instruction-tuning dataset for multi-omics biological sequences . they propose 'chatMultiOmics' to overcome limitations of current LLMs on multi-ome tasks . |
| Outcome: | The proposed dataset bridges LLMs and complex biological sequence-related tasks while maintaining conversational fluency. |
Grafting Pre-trained Models for Multimodal Headline Generation (2022.emnlp-industry)
Copied to clipboard
| Challenge: | Existing approaches to generate video headlines with pre-trained language models are labor intensive and impractical. |
| Approach: | They propose to graft the encoder from the pre-trained video-language model on the generative pre-trainer model and propose a consensus fusion mechanism for the integration of different components. |
| Outcome: | The proposed model achieves strong results on a brand-new dataset collected from real-world applications. |
QiMeng-PRepair: Precise Code Repair via Edit-Aware Reward Optimization (2026.acl-long)
Copied to clipboard
Changxin Ke, Rui Zhang, Jiaming Guo, Yuanbo Wen, Li Ding, Shuo Wang, Xuyuan Zhu, Xiong Peng, Di Huang, Zidong Du, Xing Hu, Qi Guo, Yunji Chen
| Challenge: | Existing approaches to program repair are based on correctness alone. |
| Approach: | They propose a framework that mitigates over-editing and improves repair accuracy by generating buggy programs and re-edits. |
| Outcome: | The proposed framework improves repair precision by 31.4% under fix1@1, a metric that considers repair correctness and extent, and significantly increases decoding throughput when combined with speculative editing. |
WorkForceAgent-R1: Incentivizing Reasoning Capability in LLM-based Web Agents via Reinforcement Learning (2026.findings-eacl)
Copied to clipboard
| Challenge: | Existing web agents relying on supervised fine-tuning struggle with generalization and robustness due to insufficient reasoning capabilities when handling the inherently dynamic nature of web interactions. |
| Approach: | They propose a large language model-empowered web agent that trains using a rule-based reinforcement learning framework to enhance single-step reasoning and planning for business-oriented web navigation tasks. |
| Outcome: | The proposed agent outperforms baseline LLM-based agents on the WorkArena benchmark by 10.26–16.59%. |
VidCapBench: A Comprehensive Benchmark of Video Captioning for Controllable Text-to-Video Generation (2025.findings-acl)
Copied to clipboard
Xinlong Chen, Yuanxing Zhang, Chongling Rao, Yushuo Guan, Jiaheng Liu, Fuzheng Zhang, Chengru Song, Qiang Liu, Di Zhang, Tieniu Tan
| Challenge: | Existing studies have not identified a link between video caption evaluation and T2V generation. |
| Approach: | They propose a video caption evaluation scheme specifically designed for T2V generation that integrates video annotation with caption evaluation. |
| Outcome: | The proposed system is agnostic to any particular caption format and can be used for training. |
A Holistic Approach to Reference-Free Evaluation of Machine Translation (2023.acl-short)
Copied to clipboard
| Challenge: | Traditional machine translation evaluation relies on reference written by humans . reference-free evaluation gets rid of labor-intensive annotations, which can pivot easily to new domains . |
| Approach: | They propose a reference-free evaluation approach that characterizes evaluation as two aspects: fluency and faithfulness. |
| Outcome: | The proposed approach outperforms SOTA reference-fee metrics on machine translation datasets. |
Revisiting Entropy Regularization: Adaptive Coefficient Unlocks Its Potential for LLM Reinforcement Learning (2026.findings-acl)
Copied to clipboard
| Challenge: | Reasoning ability is a defining capability of Large Language Models (LLMs), but RLVR training suffers from policy entropy collapse, hindering exploration and limiting reasoning performance. |
| Approach: | They propose a framework that dynamically balances exploration and exploitation via three components: difficulty-aware coefficient allocation, initial-anchored target entropy, and dynamic global coefficient adjustment. |
| Outcome: | The proposed framework outperforms baselines on multiple mathematical reasoning benchmarks. |
PLAWBENCH: A Rubric-Based Benchmark for Evaluating LLMs in Real-World Legal Practice (2026.acl-long)
Copied to clipboard
Yuzhen Shi, Huanghai Liu, Yiran HU, Song Gaojie, Xu Xinran, Yubo Ma, Tianyi Tang, Li Zhang, Qingjing Chen, Feng Di, Wenbo Lv, Weiheng Wu, Kexin Yang, Sen Yang, Wei Wang, Rongyao Shi, Qiu Yuanyang, Yuemeng Qi, Zhang Jingwen, Sui Xiaoyu, Yifan Chen, Zhang Yi, An Yang, Bowen Yu, Dayiheng Liu, Junyang Lin, Weixing Shen, Bing Zhao, Charles L. A. Clarke, HU Wei
| Challenge: | Existing benchmarks for large language models (LLMs) are coarse, single-dimensional metrics and do not explicitly assess fine-grained legal reasoning. |
| Approach: | They propose a Practical Law Benchmark to evaluate large language models in real-world legal practice scenarios. |
| Outcome: | The proposed model is based on 850 questions and 13 scenarios with expert-designed evaluation rubrics. |
HyperText: Endowing FastText with Hyperbolic Geometry (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Empirically, we show that HyperText outperforms FastText on a range of text classification tasks with much reduced parameters. |
| Approach: | They propose a model that uses hyperbolic geometry to model tree-like hierarchies in natural language sentences by embedding words or ngrams in hyperbolical space. |
| Outcome: | Empirically, the proposed model outperforms FastText on a range of text classification tasks with much reduced parameters. |
Inducer-tuning: Connecting Prefix-tuning and Adapter-tuning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Prefix-tuning is an essential paradigm of parameter-efficient transfer learning . fine-tuned models require separate copies of model parameters for each task . |
| Approach: | They propose to understand and further develop prefix-tuning through the kernel lens . they propose a new variant of prefix tuning that shares the exact mechanism as prefix tun . |
| Outcome: | The proposed method improves prefix-tuning performance by training only a small portion of parameters. |
rSIM: Incentivizing Reasoning Capabilities of LLMs via Reinforced Strategy Injection (2026.acl-long)
Copied to clipboard
| Challenge: | Existing literature on Reasoning Language Models (RLMs) focuses on the ability to integrate reasoning strategies into the chain-of-thought process, contributing to improved problem-solving accuracy. |
| Approach: | They propose a reinforced strategy injection mechanism that enables any LLM to become an RLM by employing a small planner to guide the LLM's CoT through the adaptive injection of reasoning strategies. |
| Outcome: | The proposed model outperforms existing models in mathematical, coding, and financial reasoning tasks and is generalizable. |
Finding the Dominant Winning Ticket in Pre-Trained Language Models (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing studies on pre-trained language models show that they can fine-tune parameters but achieve good downstream performance. |
| Approach: | They find that a dominant winning ticket takes up 0.05% of the parameters and is transferable across different tasks. |
| Outcome: | The proposed model can achieve comparable performance with the full-parameter model, the authors show . the dominant winning ticket takes up 0.05% of the parameters, and the model is transferable across tasks, they show - the authors conclude . |
SWE-Swiss: A Multi-Task Fine-Tuning and RL Recipe for High-Performance Issue Resolution (2026.findings-acl)
Copied to clipboard
Zhenyu He, Qingping Yang, Wei Shen, Xiaojian Zhong, Kechi Zhang, Chenxin An, Wenlei Shi, Tianle Cai, Di He, Jiaze Chen, Jingjing Xu
| Challenge: | SWE-Swiss-32B demonstrates strong generalization to other common LLM benchmarks. |
| Approach: | They propose a two-phase training recipe that decomposes issue resolution into three core skills: Localization, Repair, and Unit Test Generation. |
| Outcome: | The proposed model achieves a 60.2% score on the SWE-bench Verified benchmark and is in the top-tier performance bracket of much larger models. |
Hybrid Neural Attention for Agreement/Disagreement Inference in Online Debates (D18-1)
Copied to clipboard
| Challenge: | Existing models for agreement/disagreement in debates lack the ability to model these two factors together. |
| Approach: | They propose a hybrid attention model which combines self and cross attention mechanism to locate salient part from textual context and interaction between users. |
| Outcome: | The proposed model outperforms the state-of-the-art models on three (dis)agreement inference datasets. |
RolePlot: A Systematic Framework for Evaluating and Enhancing the Plot-Progression Capabilities of Role-Playing Agents (2025.acl-long)
Copied to clipboard
| Challenge: | Existing research has focused on role-playing agents’ ability to portray specified characters, but their ability to advance the plot requires substantial improvements to deliver more engaging interaction. |
| Approach: | They propose a role-playing framework to evaluate and enhance the plot-progression capabilities of role-players. |
| Outcome: | The proposed framework improves RPAs’ ability to time plot developments and yields a significant increase in conversation turns and sustained higher arousal levels. |
Towards Effective and Efficient Continual Pre-training of Large Language Models (2025.acl-long)
Copied to clipboard
Jie Chen, Zhipeng Chen, Jiapeng Wang, Kun Zhou, Yutao Zhu, Jinhao Jiang, Yingqian Min, Xin Zhao, Zhicheng Dou, Jiaxin Mao, Yankai Lin, Ruihua Song, Jun Xu, Xu Chen, Rui Yan, Zhewei Wei, Di Hu, Wenbing Huang, Ji-Rong Wen
| Challenge: | Continual pre-training (CPT) has been an important approach for adapting language models to specific domains or tasks. |
| Approach: | They propose a Continual pre-training method that can greatly improve Chinese language ability and scientific reasoning ability of LLMs. |
| Outcome: | The proposed method can greatly improve Chinese language ability and scientific reasoning ability of LLMs. |
Improving Translation Quality Estimation with Bias Mitigation (2023.acl-long)
Copied to clipboard
| Challenge: | State-of-the-art translation Quality Estimation models are biased, relying on monolingual features while ignoring the bilingual semantic alignment. |
| Approach: | They propose a method to mitigate the bias of translation quality estimation models by contrastive learning between clean and noisy sentence pairs. |
| Outcome: | The proposed method improves the estimation performance while mitigating the bias. |
Concept-Based Label Embedding via Dynamic Routing for Hierarchical Text Classification (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for hierarchical text classification focus on modeling the text, but the concept of sharing among classes has been ignored in previous work. |
| Approach: | They propose a concept-based method that explicitly represents the concept and model the sharing mechanism among classes for the hierarchical text classification. |
| Outcome: | The proposed method outperforms state-of-the-art methods on two widely used datasets. |
Empowering parameter-efficient transfer learning by recognizing the kernel structure in self-attention (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods to fine-tune pre-trained language models are parameter efficient . fine- tuning the models requires multiple copies of the parameters, which is inefficient. |
| Approach: | They propose to use kernel-based adapters to tune only a few parameters while freezing the rest of the parameters. |
| Outcome: | The proposed methods achieve or improve strong performance over a diverse set of natural language generation and understanding tasks. |
The Security Threat of Compressed Projectors in Large Vision-Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Mainstream VLPs have significant security implications, but their security implications have not been thoroughly examined. |
| Approach: | a study evaluates the security of visual language projectors by comparing them to uncompressed projector. |
| Outcome: | The evaluation reveals significant differences in security profiles between compressed and uncompressed projectors. |
UniKeyphrase: A Unified Extraction and Generation Framework for Keyphrase Prediction (2021.findings-acl)
Copied to clipboard
| Challenge: | Mainstream methods that ignore the diversity among keyphrases or weakly capture the relation between tasks implicitly ignore keyphrase diversity. |
| Approach: | They propose a novel end-to-end learning framework that jointly learns to extract and generate keyphrases by exploiting latent semantic relation between extraction and generation. |
| Outcome: | The proposed approach outperforms mainstream methods on a benchmarked document on keyphrase prediction. |
Sketching as a Tool for Understanding and Accelerating Self-attention for Long Sequences (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing models for long sequences are not efficient due to the quadratic space and time complexity of the self-attention modules. |
| Approach: | They propose to reduce the quadratic complexity to linear (modulo logarithmic factors) by low-dimensional projection and row selection. |
| Outcome: | The proposed methods outperform transformer-based models with smaller time/space footprint on the Long Range Arena benchmark. |
Breaking the Stage Barrier: A Novel Single-Stage Approach to Long Context Extension for Large Language Models (2025.coling-main)
Copied to clipboard
Haoran Lian, Junmin Chen, Wei Huang, Yizhe Xiong, Wenping Hu, Guiguang Ding, Hui Chen, Jianwei Niu, Zijia Lin, Fuzheng Zhang, Di Zhang
| Challenge: | Recent studies show that Large language models struggle with handling long token sequences due to limited training context size. |
| Approach: | They propose a single-stage continual pretraining method to equip LLMs with long context modeling capabilities. |
| Outcome: | The proposed method outperforms existing methods on 4 language modeling benchmarks. |
DSMoE: Matrix-Partitioned Experts with Dynamic Routing for Computation-Efficient Dense LLMs (2025.emnlp-main)
Copied to clipboard
Minxuan Lv, Zhenpeng Su, Leiyu Pan, Yizhe Xiong, Zijia Lin, Hui Chen, Wei Zhou, Jungong Han, Guiguang Ding, Wenwu Ou, Di Zhang, Kun Gai, Songlin Hu
| Challenge: | Existing sparsification methods like pruning can lose model knowledge through parameter removal. |
| Approach: | They propose a novel approach that achieves sparsification by partitioning pre-trained FFN layers into computational blocks. |
| Outcome: | The proposed approach achieves superior performance across language modeling and downstream tasks under equivalent computational constraints. |
Code Reffix: A Benchmark for Reflection-Guided Code Repair with Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks focus on the repair generation capability of LLMs, lacking fine-grained evaluation of reflection. |
| Approach: | They propose a benchmark with oracle reflections and a dual-task protocol to decouple evaluation of reflection from repair. |
| Outcome: | The proposed benchmarks show that underperforming reflection capabilities remain a bottleneck for code repair. |
DioR: Adaptive Cognitive Detection and Contextual Retrieval Optimization for Dynamic Retrieval-Augmented Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for generating large language models face limitations in key aspects such as retrieval triggers and contextual scrutiny of retrieval content. |
| Approach: | They propose a dynamic RAG method that uses cognitive detection and contextual retrieval optimization to determine when retrieval is needed and what to retrieve for LLMs. |
| Outcome: | The proposed method achieves superior performance on all tasks, demonstrating the effectiveness of the proposed method. |
Autonomous Workflow for Multimodal Fine-Grained Training Assistants Towards Mixed Reality (2024.findings-acl)
Copied to clipboard
Jiahuan Pei, Irene Viola, Haochen Huang, Junxiao Wang, Moonisa Ahsan, Fanghua Ye, Jiang Yiming, Yao Sai, Di Wang, Zhumin Chen, Pengjie Ren, Pablo Cesar
| Challenge: | a fine-grained, comprehensive understanding of multimodal environments remains under-explored. |
| Approach: | They propose an automated workflow for integrating AI agents into extended reality (XR) they propose a cerebral language agent that integrates LLM with memory, planning, and interaction with XR tools and a vision-language agent . |
| Outcome: | The proposed workflow integrates AI agents seamlessly into extended reality (XR) applications for fine-grained training. |
Multilingual Neural Machine Translation with Language Clustering (D19-1)
Copied to clipboard
| Challenge: | Existing work on multilingual neural machine translation has been neglected due to its burdensome training process. |
| Approach: | They develop a framework that clusters languages into different groups and trains one multilingual model for each cluster. |
| Outcome: | The proposed model reduces the cost of training and improves translation accuracy. |
VISIAR: Empower MLLM for Visual Story Ideation (2025.findings-acl)
Copied to clipboard
Zhaoyang Xia, Somdeb Sarkhel, Mehrab Tanjim, Stefano Petrangeli, Ishita Dasgupta, Yuxiao Chen, Jinxuan Xu, Di Liu, Saayan Mitra, Dimitris N. Metaxas
| Challenge: | Existing literature on visual storytelling has not explored the ideation process fully. |
| Approach: | They propose a visual story ideation task that automates the selection and arrangement of visual assets into coherent sequences that convey expressive storylines. |
| Outcome: | The proposed framework surpasses baseline by 33.5% and 18.5%, respectively, on three metrics. |
Dialogue Language Model with Large-Scale Persona Data Engineering (2025.naacl-industry)
Copied to clipboard
| Challenge: | Existing persona-consistent dialogue models lack robustness due to limited scale and diversity of datasets. |
| Approach: | They propose an open-domain persona dialogue system that employs extensive generative pre-training on a persona dialog dataset to enhance persona consistency. |
| Outcome: | The proposed model generates vast persona dialogue datasets and addresses invalid persona bias. |
Improving Visual-Semantic Embedding with Adaptive Pooling and Optimization Objective (2023.eacl-main)
Copied to clipboard
Zijian Zhang, Chang Shu, Ya Xiao, Yuan Shen, Di Zhu, Youxin Chen, Jing Xiao, Jey Han Lau, Qian Zhang, Zheng Lu
| Challenge: | Recent VSE models combine simple pooling methods with hard triplet loss to improve performance. |
| Approach: | They propose an adaptive pooling strategy that allows the model to learn how to aggregate features through a combination of simple pooling methods. |
| Outcome: | The proposed strategy outperforms current state-of-the-art systems on image-to-text and text-toimage retrieval. |
Decoding at the Speed of Thought: Harnessing Parallel Decoding of Lexical Units for LLMs (2024.lrec-main)
Copied to clipboard
Chenxi Sun, Hongzhi Zhang, Zijia Lin, Jingyuan Zhang, Fuzheng Zhang, Zhongyuan Wang, Bin Chen, Chengru Song, Di Zhang, Kun Gai, Deyi Xiong
| Challenge: | Large language models have demonstrated exceptional capability in natural language understanding and generation, but their generation speed is limited by the inherently sequential nature of their decoding process. |
| Approach: | They propose a method that accelerates decoding process without sacrificing quality . they propose lexical unit decoding, which can be integrated with other methods . |
| Outcome: | The proposed method significantly reduces decoding time while maintaining quality while maintaining output quality. |
Improving Large Language Models via Fine-grained Reinforcement Learning with Minimum Editing Constraint (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing reinforcement learning methods do not provide fine-grained supervision for complex reasoning tasks. |
| Approach: | They propose a reinforcement learning method that incorporates a generative model as the reward model and a token-level supervision model for RL training. |
| Outcome: | Experiments on 8 tasks show the proposed method is effective . |