Papers by Jie Hu
Reasoning in a Combinatorial and Constrained World: Benchmarking LLMs on Natural-Language Combinatorial Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | NLCO evaluates large language models for combinatorial optimization (CO) . existing evaluations emphasize relatively simple reasoning competencies . |
| Approach: | They propose a combinatorial optimization benchmark that evaluates large language models on CO reasoning. |
| Outcome: | The proposed model can handle combinatorial optimization without writing code or calling external solvers. |
EpiCoDe: Boosting Model Performance Beyond Training with Extrapolation and Contrastive Decoding (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to enhance performance of Large language models are limited due to the cost of training data and privacy concerns. |
| Approach: | They propose a method that enhances a finetuned model with its inferior version and adopts contrastive decoding to reduce predicted errors. |
| Outcome: | The proposed method outperforms existing methods in data-scarcity scenarios across three domains and shows that it is more robust and robust. |
Formally Specifying the Intended Behavior of the Program: LLM-Driven Neuro-Symbolic Program Specification Synthesis (2026.acl-demo)
Copied to clipboard
Cheng Wen, Hu Junjie, YiKun Hu, Jie Su, Bin Yu, Dugang Liu, Zhiwu Xu, Weidi Sun, Shengchao Qin, Cong Tian
| Challenge: | Formal verification typically requires developers to write detailed formal specifications . a formal verification system that generates candidate specifications is costly and error-prone . |
| Approach: | They propose an LLM-driven neuro-symbolic demonstration system that reframes specification writing as constrained structured synthesis. |
| Outcome: | The proposed system reduces hallucinations and produces proof-ready annotations. |
KACC: A Multi-task Benchmark for Knowledge Abstraction, Concretization and Completion (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing studies focus on partial aspects of knowledge abstraction, concretization, and completion (KACC). |
| Approach: | They propose a unified knowledge graph benchmark to improve existing benchmarks . they collect new datasets that contain larger concept graphs and cross-view links . |
| Outcome: | The proposed benchmark improves existing benchmarks in terms of dataset scale, task coverage, and difficulty. |
Improving Multi-turn Dialogue Modelling with Utterance ReWriter (P19-1)
Copied to clipboard
| Challenge: | Recent research has achieved impressive results in single-turn dialogue modelling, but multi-turn models still remain challenging. |
| Approach: | They propose to rewrite human utterances as a pre-process to help multi-turn dialgoue modelling. |
| Outcome: | The proposed architecture achieves remarkably good performance on the utterance rewriting task. |
PaCoRe: Learning to Scale Test-Time Compute with Parallel Coordinated Reasoning (2026.acl-long)
Copied to clipboard
Jingcheng Hu, Yinmin Zhang, Shijie Shang, Xiaobo Yang, Yue Peng, Zhewei Huang, Hebin Zhou, Xin Wu, Jie Cheng, Fanqi Wan, Xiangwen Kong, Chengyuan Yao, Kaiwen Yan, Ailin Huang, Hongyu Zhou, Qi Han, Zheng Ge, Xiangyu Zhang, Heung-Yeung Shum
| Challenge: | Parallel Coordinated Reasoning (PaCoRe) overcomes a central limitation of contemporary language models: their inability to scale test-time compute (TTC) far beyond sequential reasoning under a fixed context window. |
| Approach: | They propose a training-and-inference framework to overcome a central limitation of language models: their inability to scale test-time compute (TTC) under a fixed context window. |
| Outcome: | The proposed model scales to multi-million-token effective TTC without exceeding context limits. |
Self-Training with Pseudo-Label Scorer for Aspect Sentiment Quad Prediction (2024.acl-long)
Copied to clipboard
| Challenge: | Aspect Sentiment Quad Prediction (ASQP) aims to predict all quads (aspect term, aspect category, opinion term, sentiment polarity) for a given review. |
| Approach: | They propose a self-training framework with a pseudo-label scorer to assess the match between reviews and their pseudo-labels and train a generative model on it. |
| Outcome: | The proposed framework can predict all quads (aspect term, aspect category, opinion term, sentiment polarity) for a given review, and it can significantly improve self-training. |
QSpell 250K: A Large-Scale, Practical Dataset for Chinese Search Query Spell Correction (2025.naacl-industry)
Copied to clipboard
| Challenge: | Chinese Search Query Spell Correction is a task designed to identify and correct typographical errors within queries. |
| Approach: | They propose a large-scale benchmark specifically developed for Chinese Query Spell Correction. |
| Outcome: | The proposed benchmark covers a broad range of topics, including formal entities, everyday colloquialisms and idiomatic expressions. |
ℛ3: Advertisement Compliance ℛectification via Group-ℛelative Experience Extractor and Curriculum ℛeinforcement (2026.acl-industry)
Copied to clipboard
| Challenge: | Existing methods of content moderation are infeasible due to over-editing and compromise the advertiser’s original semantic intent. |
| Approach: | They propose a framework to harmonize compliance with original intent preservation that integrates a data-driven framework and a curriculum to enforce compliance while maximizing semantic consistency. |
| Outcome: | The proposed framework outperforms state-of-the-art baselines on industrial datasets and on online A/B testing on industrial video. |
Multi-Granularity Semantic Revision for Large Language Model Distillation (2026.acl-long)
Copied to clipboard
Xiaoyu Liu, Yun Zhang, Wei Li, Simiao Li, Xudong Huang, Hanting Chen, Yehui Tang, Jie Hu, Zhiwei Xiong, Yunhe Wang
| Challenge: | Existing methods for generating large language models rely on student-generated outputs, which introduce generation errors and misguide the distillation process. |
| Approach: | They propose a multi-granularity semantic revision method for LLM distillation that corrects errors using teacher-generated tokens and re-generates the sequence to minimize errors. |
| Outcome: | The proposed method reduces errors and misguides distillation on student models and improves consistency between teacher and student outputs. |
[MASK] Insertion: a robust method for anti-adversarial attacks (2023.findings-eacl)
Copied to clipboard
| Challenge: | Existing studies have focused on adversarial defenses against pretrained language models. |
| Approach: | They propose an adversarial defensing algorithm that inserts tokens into input sequences . they show an improvement in accuracy between 3.2 and 11.1 absolute points . |
| Outcome: | The proposed algorithm improves model accuracy on clean and polluted inputs compared with state-of-the-art models . |
MTP-RL: Acceleration of Reinforcement Learning Rollouts with Policy-Aligned Multi-Token Prediction (2026.findings-acl)
Copied to clipboard
| Challenge: | Reinforcement learning (RL) is widely applied to boost the performance of pretrained models, yet its training efficiency is severely constrained by rollout generation. |
| Approach: | They propose a framework that accelerates the rollout phase for diverse models by equipping a pipeline to equip the multi-layer parameter-sharing MTP for all models and an advantage-aware MTP optimization strategy. |
| Outcome: | The proposed framework achieves stable growth of acceptance length during RL training, and also accelerates RL rollouts, achieving an average 23.1%–55.3% reduction in rollout time compared to baselines. |
ZoomRAG: Hierarchical Random-walk Zooming across Multi-scale Information Graphs for Fast and Accurate RAG (2026.findings-acl)
Copied to clipboard
Xianming Hu, Jingyang Chen, Bin Tang, Yihe Liu, Yihong Huang, Hongbo Zhao, Nuoyi Chen, Jie Zhang, Ping Li, Kai Zhang
| Challenge: | retrieval-augmented generation (RAG) is a powerful tool for NLP applications . but it is challenging to encode large knowledge bases as compact offline structures . |
| Approach: | They propose a coarse-to-fine hierarchical graph inference method that uses random walks to retrieve information from a corpus of documents. |
| Outcome: | The proposed method reduces offline indexing costs and accelerates retrieval. |
A Black-Box Attack on Code Models via Representation Nearest Neighbor Search (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for generating adversarial code examples face challenges such as limted availability of substitute variables and the creation of adversarials with noticeable perturbations. |
| Approach: | They propose a search seed based on historical attacks to find adversarial substitutes . they employ a pre-trained variable name encoder to map the search seed to a continuous vector space . |
| Outcome: | The proposed approach outperforms baseline methods in terms of ASR and QT. |
Repulsive Attention: Rethinking Multi-head Attention as Bayesian Inference (2020.emnlp-main)
Copied to clipboard
Bang An, Jie Lyu, Zhenyi Wang, Chunyuan Li, Changwei Hu, Fei Tan, Ruiyi Zhang, Yifan Hu, Changyou Chen
| Challenge: | Existing studies show that multi-head attention is an effective module in deep neural networks, but there are no explicit mechanisms guaranteeing this property. |
| Approach: | They propose a non-parametric approach that explicitly improves the repulsiveness in multi-head attention and consequently strengthens model’s expressiveness. |
| Outcome: | The proposed approach improves the repulsiveness in multi-head attention and strengthens model’s expressiveness. |
Reasoning with Ontology Graph: Toward Type-Constrained Knowledge Graph Question Answering (2026.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graph question answering methods rely on LLM-induced type systems with inconsistent granularity or perform multi-hop reasoning without explicit target-type constraints. |
| Approach: | They propose a type-constrained knowledge graph question answering framework that reasons over a relation-centric ontology graph. |
| Outcome: | The proposed framework achieves state-of-the-art and produces ontology-grounded reasoning chains with substantial Hit@1 gains. |
Thinking Economically: A Hierarchical Framework for Adaptive-Complexity Reasoning in LLMs (2026.findings-acl)
Copied to clipboard
Yubo Gao, Haotian Wu, Hong Chen, Junquan Huang, Yibo Yan, Jungang Li, Zihao Dongfang, Sicheng Tao, PS Tan, Jie Zhang, Xuming Hu
| Challenge: | Existing efficiency methods for Chain-of-Thought (CoT) generate excessively long rationales without commensurate accuracy gains. |
| Approach: | They propose a training framework that operationalizes this principle through coarse-to-fine budgeting. |
| Outcome: | Experiments on GSM8K and MATH500 show that HAB surpasses standard CoT in accuracy and reduces token usage, achieving stronger performance-efficiency trade-off than baselines. |
Localized Low-Rank Adaptation within Clustered Parameter Subspaces (2026.acl-long)
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) for large language models has been successful in various domains. |
| Approach: | They propose to perform low-rank updates within clustered parameter subspaces . they group rows/columns of update matrix into locally coherent, uncorrelated subspace blocks . |
| Outcome: | Empirical results show that low-rank Adaptation (LoRA) is better than global adaptations in various domains. |
OEE-CFC: A Dataset for Open Event Extraction from Chinese Financial Commentary (2024.findings-emnlp)
Copied to clipboard
Qizhi Wan, Changxuan Wan, Rong Hu, Dexi Liu, Xu Wenwu, Kang Xu, Zou Meihua, Liu Tao, Jie Yang, Zhenwei Xiong
| Challenge: | Existing corpora with unconventional entities serving as event arguments lack rich multi-events and shared arguments. |
| Approach: | They develop an open event template that includes 21 event argument roles and an open corpus supporting open event extraction. |
| Outcome: | The proposed corpus includes 17,469 events, 44,221 arguments, 3,644 complex arguments, and 5,898 shared arguments. |
GRNFormer: A Biologically-Guided Framework for Integrating Gene Regulatory Networks into RNA Foundation Models (2025.findings-acl)
Copied to clipboard
Mufan Qiu, Xinyu Hu, Fengwei Zhan, Sukwon Yun, Jie Peng, Ruichen Zhang, Bhavya Kailkhura, Jiekun Yang, Tianlong Chen
| Challenge: | Foundation models for single-cell RNA sequencing ignore biological prior knowledge encoded in gene regulatory relationships and fail to leverage multi-omics signals. |
| Approach: | They propose a framework that integrates multi-scale gene regulatory networks into RNA foundation model training. |
| Outcome: | The proposed framework improves on state-of-the-art models on three downstream tasks . it integrates multi-scale gene regulatory networks (GRNs) from multi-omics data into training . |
YuLan-Mini: Pushing the Limits of Open Data-efficient Language Model (2025.acl-long)
Copied to clipboard
Hu Yiwen, Huatong Song, Jie Chen, Jia Deng, Jiapeng Wang, Kun Zhou, Yutao Zhu, Jinhao Jiang, Zican Dong, Yang Lu, Xu Miao, Xin Zhao, Ji-Rong Wen
| Challenge: | prevailing pre-training approaches for large language models involve several complexities. |
| Approach: | They propose a low-cost training recipe and a robust optimization approach to mitigate training instability . they also propose synthesis, curriculum, and data selection pipelines to integrate data . |
| Outcome: | The proposed model achieves top-tier performance among models with similar parameter scale . it is comparable to industry-leading models that require significantly more data . |
Diversifying Dialogue Generation with Non-Conversational Text (2020.acl-main)
Copied to clipboard
| Challenge: | Neural network-based sequence-to-sequence models suffer from low diversity in open-domain dialogue generation. |
| Approach: | They propose a way to diversify dialogue generation by leveraging non-conversational text . they collect large-scale corpus from forum comments, idioms and book snippets . |
| Outcome: | The proposed model produces significantly more diverse responses without sacrificing relevance with context. |
C-LLM: Learn to Check Chinese Spelling Errors Character by Character (2024.emnlp-main)
Copied to clipboard
| Challenge: | Chinese Spell Checking (CSC) aims to detect and correct spelling errors in sentences. |
| Approach: | They propose a Chinese Spell Checking method that learns to check errors Character by Character. |
| Outcome: | The proposed method achieves a 2.1% enhancement in general scenarios and a significant improvement in vertical domain scenarios compared to existing methods. |
Dialogue is Better Than Monologue: Instructing Meidcal LLMs via Strategic Conversations (2026.findings-eacl)
Copied to clipboard
Zijie Liu, Xinyu Zhao, Jie Peng, Jinhao Duan, Zhuangdi Zhu, Qingyu Chen, Kaidi Xu, Xia Hu, Tianlong Chen
| Challenge: | Existing tuning methods for medical AI models are monologue-based . existing benchmarks are based on licensing exams or research articles . |
| Approach: | They propose a benchmark to expose limitations of monologue-based tuning for medical AI models . they use a large dialogue dataset to capture stepwise diagnostic reasoning . |
| Outcome: | The proposed model outperforms monologue-tuned models on a medical question answering task and improves accuracy on standard medical QA benchmarks. |
Best Practices for Distilling Large Language Models into BERT for Web Search Ranking (2025.coling-industry)
Copied to clipboard
| Challenge: | Recent studies have highlighted the potential of Large Language Models (LLMs) as zero-shot relevance rankers. |
| Approach: | They propose to use a ranking loss to transfer ranking knowledge from LLMs to smaller models like BERT. |
| Outcome: | The proposed model has been successfully integrated into a commercial web search engine as of February 2024. |
Knowledge-to-Verification: Exploring RLVR for LLMs in Knowledge-Intensive Domains (2026.acl-long)
Copied to clipboard
Zhonghang Yuan, Zhefan Wang, Fang Hu, Zihong Chen, Jinzhe Li, Gang Li, Jie Ying, Huanjun Kong, Songyang Zhang, Nanqing Dong
| Challenge: | Recent large language models (LLMs) have demonstrated remarkable progress in reasoning, but their applications on knowledge-intensive domains have not been explored due to the scarcity of high-quality verifiable data. |
| Approach: | They propose a framework that extends reinforcement learning with verifiable rewards (RLVR) to knowledge-intensive domains through automated verififiability data synthesis while enabling verification of the LLM's reasoning process. |
| Outcome: | Extensive experiments show that the proposed framework enhances the reasoning of large language models in knowledge-intensive domains without significantly compromising the model’s general capabilities. |
Gamma-Guard: Lightweight Residual Adapters for Robust Guardrails in Large Language Models (2025.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) are widely deployed as zero-shot evaluators for answer grading, content moderation, and document ranking. |
| Approach: | They propose a system that trains LLMs with adapters to denoise embeddings and refocus attention. |
| Outcome: | The proposed model lifts adversarial accuracy from 5% to 95% a 90 percentage-point gain while reducing clean-data accuracy by just 8 percentage points. |
OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific Problems (2024.acl-long)
Copied to clipboard
Chaoqun He, Renjie Luo, Yuzhuo Bai, Shengding Hu, Zhen Thai, Junhao Shen, Jinyi Hu, Xu Han, Yujie Huang, Yuxiang Zhang, Jie Liu, Lei Qi, Zhiyuan Liu, Maosong Sun
| Challenge: | Large Language Models (LLMs) and Large Multimodal Models have exceeded general human capabilities in various tasks. |
| Approach: | They present an Olympiad-level bilingual multimodal scientific benchmark featuring 8,476 problems from Olympiad level mathematics and physics competitions. |
| Outcome: | The best performing model, GPT-4V, attains an average score of 17.97% on OlympiadBench, with a mere 10.74% in physics, highlighting the benchmark rigor and the intricacy of physical reasoning. |
Adversarial Preference Learning for Robust LLM Alignment (2025.findings-acl)
Copied to clipboard
Yuanfu Wang, Pengyu Wang, Chenyang Xi, Bo Tang, Junyi Zhu, Wenqiang Wei, Chen Chen, Chao Yang, Jingfeng Zhang, Chaochao Lu, Yijun Niu, Keming Mao, Zhiyu Li, Feiyu Xiong, Jie Hu, Mingchuan Yang
| Challenge: | Modern language models rely on Reinforcement Learning from Human Feedback (RLHF) to encourage safe behaviors, but they remain vulnerable to adversarial attacks due to three key limitations: (1) the inefficiency and high cost of human annotation; (2) the vast diversity of potential adversarials; and (3) the risk of feedback bias and reward hacking. |
| Approach: | They propose an iterative adversarial training method that incorporates three key innovations to address these challenges. |
| Outcome: | Experiments on Mistral-7B-Instruct-v0.3 show that the proposed method significantly enhances robustness and reduces harmful outputs from 5.88% to 0.43%. |
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. |
DataSciBench: An LLM Agent Benchmark for Data Science (2026.findings-acl)
Copied to clipboard
Dan Zhang, Sining Zhoubian, Min Cai, Fengzu Li, Lekang Yang, Wei Wang, Tianjiao Dong, Ziniu Hu, Jie Tang, Yisong Yue
| Challenge: | Existing benchmarks focus on single task, simple evaluation metrics, and readily available ground truth (GT) DataSciBench is built on curated, natural, and challenging prompts with complex evaluation criteria and uncertain GT. |
| Approach: | They propose a benchmark for evaluating Large Language Models in data science that integrates LLM-based self-consistency and human verification to ensure accuracy. |
| Outcome: | The proposed framework outperforms open-source models in all metrics and offers rigorous insights into LLM strengths and weaknesses. |
Towards Faithful Industrial RAG: A Reinforced Co-adaptation Framework for Advertising QA (2026.acl-industry)
Copied to clipboard
Wenwei Li, Ming Xu, Tianle Xia, Lingxiang Hu, Yiding Sun, Linfang Shang, Liqun Liu, Peng Shu, Huan Yu, Jie Jiang
| Challenge: | Existing methods for QA in industrial environments are inherently relational and often updated. |
| Approach: | They propose a framework that optimizes retrieval and generation through two components: Graph-aware Retrieval and evidence-constrained reinforcement learning. |
| Outcome: | Experiments on an internal advertising QA dataset show consistent gains across expert-judged dimensions including accuracy, completeness, safety, and URL validity. |
DecorateLM: Data Engineering through Corpus Rating, Tagging, and Editing with Language Models (2024.emnlp-main)
Copied to clipboard
Ranchi Zhao, Zhen Thai, Yifan Zhang, Shengding Hu, Jie Zhou, Yunqi Ba, Jie Cai, Zhiyuan Liu, Maosong Sun
| Challenge: | Large Language Models (LLMs) are pre-trained on vast datasets composed of billions of tokens harvested from diverse text sources. |
| Approach: | They propose a data engineering method to refine the pretraining corpus through data rating, tagging and editing. |
| Outcome: | The proposed method improves the quality of the pretraining corpus by enhancing 100 billion tokens of the training corpus. |
TreeRL: LLM Reinforcement Learning with On-Policy Tree Search (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for On-Policy LLM RL typically train a separate process reward model, which suffers from distribution mismatch and reward hacking. |
| Approach: | They propose a reinforcement learning framework that directly incorporates on-policy tree search for RL training. |
| Outcome: | Experiments on math and code reasoning benchmarks show that tree search achieves superior performance compared to traditional ChainRL. |
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. |
A Law Reasoning Benchmark for LLM with Tree-Organized Structures including Factum Probandum, Evidence and Experiences (2025.findings-acl)
Copied to clipboard
Jiaxin Shen, Jinan Xu, Huiqi Hu, Luyi Lin, Guoyang Ma, Fei Zheng, Fandong Meng, Jie Zhou, Wenjuan Han
| Challenge: | a recent study focuses on generating impartial and interpretable judicial judgments based on established criminal fact. |
| Approach: | They propose a law reasoning schema enriched with hierarchical factum probandum, evidence, and implicit experience that enables public scrutiny and preventing bias. |
| Outcome: | The proposed schema enables public scrutiny and prevents bias in the "Intelligent Court" it employs a suite of legal analysis tools to address the challenge task. |
UltraEval: A Lightweight Platform for Flexible and Comprehensive Evaluation for LLMs (2024.acl-demos)
Copied to clipboard
Chaoqun He, Renjie Luo, Shengding Hu, Ranchi Zhao, Jie Zhou, Hanghao Wu, Jiajie Zhang, Xu Han, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing evaluation platforms are complex and poorly modularized, hindering seamless incorporation into researcher’s workflows. |
| Approach: | They propose a lightweight evaluation framework characterized by lightweight, comprehensiveness, modularity, and efficiency that integrates models, data, and metrics into a unified evaluation workflow. |
| Outcome: | The proposed evaluation framework is lightweight, comprehensive, modular, and efficient. |
Search-P1: Path-Centric Reward Shaping for Stable and Efficient Agentic RAG Training (2026.acl-industry)
Copied to clipboard
Tianle Xia, Ming Xu, Lingxiang Hu, Yiding Sun, Wenwei Li, Linfang Shang, Liqun Liu, Peng Shu, Huan Yu, Jie Jiang
| Challenge: | Retrieval-Augmented Generation (RAG) enhances large language models by incorporating external knowledge, yet traditional singleround retrieval struggles with complex multistep reasoning. |
| Approach: | They propose a framework that introduces path-centric reward shaping for agentic RAG training. |
| Outcome: | The proposed framework improves on existing methods with an average accuracy gain of 7.7 points. |
CSCD-NS: a Chinese Spelling Check Dataset for Native Speakers (2024.acl-long)
Copied to clipboard
| Challenge: | Existing datasets aimed at Chinese learners and native speakers are limited in size and quality. |
| Approach: | They propose a method that simulates the input process through an input method and generates large-scale pseudo data that closely resembles the actual error distribution. |
| Outcome: | The proposed method outperforms existing methods and outperformed existing models. |
Extracting Military Event Temporal Relations via Relative Event Time Prediction and Virtual Adversarial Training (2025.findings-naacl)
Copied to clipboard
| Challenge: | Existing models for extracting event temporal relations typically compare the relative times of events directly, neglecting the contextual information between event pairs. |
| Approach: | They propose a temporal relationship extraction model based on relative event time prediction and virtual adversarial training, MFRV. |
| Outcome: | The proposed model can capture and infer temporal relationships and can be generalized by generating adversarial samples. |
LLMBox: A Comprehensive Library for Large Language Models (2024.acl-demos)
Copied to clipboard
Tianyi Tang, Hu Yiwen, Bingqian Li, Wenyang Luo, ZiJing Qin, Haoxiang Sun, Jiapeng Wang, Shiyi Xu, Xiaoxue Cheng, Geyang Guo, Han Peng, Bowen Zheng, Yiru Tang, Yingqian Min, Yushuo Chen, Jie Chen, Ranchi Zhao, Luran Ding, Yuhao Wang, Zican Dong, Xia Chunxuan, Junyi Li, Kun Zhou, Xin Zhao, Ji-Rong Wen
| Challenge: | a library to facilitate the development, use, and evaluation of large language models (LLMs) is presented. |
| Approach: | They propose a unified library to facilitate the development, use and evaluation of large language models (LLMs). |
| Outcome: | The proposed library is based on extensive experiments in a variety of evaluation settings. |
EventRelBench: A Comprehensive Benchmark for Evaluating Event Relation Understanding in Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing LLMs fail to capture event relationships, despite advances in NLP . a new benchmark is being developed to assess LLM's ability to extract event relationships . |
| Approach: | They propose a benchmark to assess LLMs' ability to extract event relations . EventRelBench comprises 35K diverse event relation questions . |
| Outcome: | The benchmark EventRelBench measures the performance of large language models on event relation extraction tasks. |
Toward Fully Exploiting Heterogeneous Corpus:A Decoupled Named Entity Recognition Model with Two-stage Training (2021.findings-acl)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is a fundamental and widely used task in natural language processing. |
| Approach: | They propose a decoupled NER model with two-stage training to take advantage of heterogeneous corpus, including dictionaries, distantly supervised instances, and human-annotated instances. |
| Outcome: | Empirical results show that the proposed model improves against baselines and can be scaled to a large extent. |
MINTQA: A Multi-Hop Question Answering Benchmark for Evaluating LLMs on New and Long-tail Knowledge (2026.acl-long)
Copied to clipboard
| Challenge: | Existing studies have shown that large language models can handle knowledge with varying familiarity. |
| Approach: | They propose a benchmark to evaluate multi-hop question answering on new and tail knowledge . they use RAG to integrate external knowledge into large language models . |
| Outcome: | The proposed benchmark evaluates the multi-hop reasoning ability of large language models . it primarily evaluates their ability to handle knowledge with different levels of familiarity . |
SSR-A: Spatial- and Semantic-Aware Instructions and Curriculum Reinforcement for Advertisement Compliant Rectification (2026.acl-industry)
Copied to clipboard
| Challenge: | Existing methods to fix non-compliant images suffer from over-editing, destroying original intent and perceptual similarity. |
| Approach: | They propose a framework for the minimalist rectification of non-compliant image ads. |
| Outcome: | The proposed framework outperforms state-of-the-art baselines in both compliance and preservation of visual and commercial consistency. |
CARE-STaR: Constraint-aware Self-taught Reasoner (2025.findings-acl)
Copied to clipboard
Zhiliang Li, Bo Tang, Yijun Niu, Beihong Jin, Qiwen Shi, Yuchen Feng, Zhiyu Li, Jie Hu, Mingchuan Yang, Feiyu Xiong
| Challenge: | Recent research on instruction following has demonstrated that LLMs can handle complex instructions. |
| Approach: | They propose to assign constraints to different levels of constraints in instructions . they use chain-of-thought and self-taught reasoner methods to identify constraints . |
| Outcome: | The proposed method outperforms supervised fine-tuning (SFT) on three instruction-following benchmarks. |