Papers by Jingying Zeng
Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models (2025.findings-acl)
Copied to clipboard
Yingqian Cui, Pengfei He, Jingying Zeng, Hui Liu, Xianfeng Tang, Zhenwei Dai, Yan Han, Chen Luo, Jing Huang, Zhen Li, Suhang Wang, Yue Xing, Jiliang Tang, Qi He
| Challenge: | Chain-of-Thought (CoT) reasoning has improved the performance of large language models (LLMs) however, the detailed reasoning process in CoT often incurs long generation times and high computational costs due to the inclusion of unnecessary steps. |
| Approach: | They propose a method to identify critical reasoning steps using perplexity as a measure of their importance. |
| Outcome: | The proposed method achieves a better balance between reasoning accuracy and efficiency of CoT. |
A General Framework to Enhance Fine-tuning-based LLM Unlearning (2025.findings-acl)
Copied to clipboard
Jie Ren, Zhenwei Dai, Xianfeng Tang, Hui Liu, Jingying Zeng, Zhen Li, Rahul Goutam, Suhang Wang, Yue Xing, Qi He, Hui Liu
| Challenge: | Existing approaches to remove copyrighted and privacy-sensitive data from Large Language Models (LLMs) have been proposed to remove specific data from LLMs without requiring full retraining. |
| Approach: | They propose a general framework that enhances the utility of fine-tuning-based methods by distinguishing target data and suppressing related generations. |
| Outcome: | The proposed framework improves the unlearning and utility of fine-tuning-based methods by distinguishing the target data and suppressing related generations. |
A Reward-Guided Dual-Phase Framework for Adaptive Inference-Time Reasoning (2026.findings-acl)
Copied to clipboard
Yingqian Cui, Zhenwei Dai, Pengfei He, Bing He, Hui Liu, Zhan Shi, Xianfeng Tang, Jingying Zeng, Suhang Wang, Yue Xing, Jiliang Tang, Benoit Dumoulin
| Challenge: | Large Language Models (LLMs) have made strong progress in reasoning. |
| Approach: | They propose a dual-phase test-time scaling framework that separates planning and execution and performs search over each phase independently. |
| Outcome: | Experiments on math reasoning and code generation benchmarks show that the proposed approach improves accuracy while reducing redundant computation. |