Papers by Chao Zeng

12 papers
Rehearsal-free Continual Language Learning via Efficient Parameter Isolation (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for learning continual tasks do not cache history data, which makes the problem more challenging.
Approach: They propose a method that allocates a small portion of private parameters and learns them with a shared pre-trained model.
Outcome: The proposed method is comparable to existing methods and comparable to those using historical data.
Type-Driven Multi-Turn Corrections for Grammatical Error Correction (2022.findings-acl)

Copied to clipboard

Challenge: Existing studies focus on data augmentation to combat exposure bias . but data augmented models lack the ability to recognize the procedure of gradual corrections .
Approach: They propose a type-driven multi-turn corrections approach that uses multiple training instances to train dominant models.
Outcome: The proposed model achieves state-of-the-art single-model performance on English GEC benchmarks.
LRQuant: Learnable and Robust Post-Training Quantization for Large Language Models (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for post-training quantization (PTQ) are limited by the complexity of the quantization parameter and performance degradations when tested on unseen datasets.
Approach: They propose a learnable smooth-based PTQ framework that allows for rapid adaptation during testing.
Outcome: The proposed framework improves performance on unseen datasets and reduces memory constraints.
Enhancing Mathematical Reasoning in LLMs by Stepwise Correction (2025.acl-long)

Copied to clipboard

Challenge: Existing Best-of-N decoding methods often lead to incorrect solutions . a novel method is proposed to help large language models identify and revise incorrect steps in their generated reasoning paths.
Approach: They propose a method that helps large language models identify and revise incorrect steps in their generated reasoning paths.
Outcome: The proposed method outperforms the state-of-the-art Best-ofN decoding method by +2.4 and reduces token consumption by 77.8%.
RRAtention: Dynamic Block Sparse Attention via Per-Head Round-Robin Shifts for Long-Context Inference (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to dynamic sparse attention require preprocessing, lack global evaluation, violate query independence, or incur high computational overhead.
Approach: They propose a dynamic sparse attention method that achieves all desirable properties through a head **r**ound-**r**obin (RR) sampling strategy.
Outcome: Experiments on natural language understanding and multimodal video comprehension show that the proposed method achieves 2.4 speedup at 128K context length outperforming existing methods.
Improving Consistency for Text Summarization with Energy Functions (2023.findings-emnlp)

Copied to clipboard

Challenge: Current abstractive summarization models generate inconsistent content due to the inherently noisy dataset and the discrepancy between maximum likelihood estimation based training objectives and consistency measurements.
Approach: They propose a new consistency taxonomy that categorizes inconsistent content into faithfulness, factuality, and self-supportiveness.
Outcome: Experiments on XSUM and CNN/DM datasets show that EnergySum mitigates the trade-off between accuracy and consistency.
BMInf: An Efficient Toolkit for Big Model Inference and Tuning (2022.acl-demo)

Copied to clipboard

Challenge: Recent years, pre-trained language models (PLMs) have achieved promising results on various NLP tasks.
Approach: They propose an open-source toolkit for big model inference and tuning which can support big model tuning at extremely low computation cost.
Outcome: The proposed toolkit can support big model inference and tuning at extremely low computation cost.
RU22Fact: Optimizing Evidence for Multilingual Explainable Fact-Checking on Russia-Ukraine Conflict (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods to verify factuality of claims do not provide sufficient evidence for explainable fact-checking systems.
Approach: They propose a method to automatically retrieve and summarize evidence from the Web and a novel multilingual explainable fact-checking dataset on the Russia-Ukraine conflict in 2022.
Outcome: The proposed method can retrieve and summarize evidence from the Web and generate explanations in 16 languages.
GlimpRouter: Efficient Collaborative Inference by Glimpsing One Token of Thoughts (2026.findings-acl)

Copied to clipboard

Challenge: Existing routing strategies rely on local token probabilities or post-hoc verification, introducing significant inference overhead.
Approach: They propose a step-wise collaboration framework that generates only the first token of each reasoning step and routes it to a larger model only when initial token entropy exceeds a threshold.
Outcome: The proposed approach reduces inference latency while preserving accuracy.
ShredBench: Evaluating the Semantic Reasoning Capabilities of Multimodal LLMs in Document Reconstruction (2026.findings-acl)

Copied to clipboard

Challenge: Empirical evaluations on state-of-the-art MLLMs reveal a significant performance gap . ML models lack the fine-grained cross-modal reasoning required to bridge visual discontinuities.
Approach: They propose a benchmark that renders fragmented documents directly from Markdown to facilitate evaluation of VRDU tasks.
Outcome: The proposed benchmark renders fragmented documents directly from Markdown.
Large Language Models Can Self-Correct with Key Condition Verification (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods to correct reasoning without external feedback have not been used in large language models.
Approach: They propose an iterative verify-then-correct framework to progressively identify and correct (probably) false responses, named ProCo.
Outcome: The proposed method improves the accuracy of LLMs on three reasoning tasks.
Teaching LLM to be Persuasive: Reward-Enhanced Policy Optimization for Alignment from Heterogeneous Rewards (2026.acl-industry)

Copied to clipboard

Challenge: a large language model (LLM) is used as a business development agent for persuasive price negotiation in online travel agencies.
Approach: They propose a reward-enhancing policy optimization method that integrates three complementary reward sources-a preference-trained reward model and an LLM-as-a-judge.
Outcome: The proposed method improves average dialogue rating to 4.63 (+0.33 over GRPO) and raises share of conversations with at least one excellent response to 66.67% (+23.34 pp over grepo).

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations