Papers by Zhiming Zhang
Python is Not Always the Best Choice: Embracing Multilingual Program of Thoughts (2024.emnlp-main)
Copied to clipboard
Xianzhen Luo, Qingfu Zhu, Zhiming Zhang, Libo Qin, Xuanyu Zhang, Qing Yang, Dongliang Xu, Wanxiang Che
| Challenge: | Program of Thoughts (PoT) is an approach characterized by its executable intermediate steps, which ensure the accuracy of the logical calculations in the reasoning process. |
| Approach: | They propose a task and model agnostic approach which harnesses strength and diversity from various languages to achieve better performance across all tasks. |
| Outcome: | The proposed approach outperforms Python Self-Consistency in almost all tasks and models and achieves comparable or superior performance on ChatGPT. |
An Efficient Framework for Whole-Page Reranking via Single-Modal Supervision (2026.acl-industry)
Copied to clipboard
Zishuai Zhang, Sihao Yu, null Xiewenyi, Ying Nie, Junfeng Wang, Zhiming Zheng, Dawei Yin, Hainan Zhang
| Challenge: | Existing whole-page reranking methods require large-scale expert annotations to achieve high-quality results. |
| Approach: | They propose a whole-page reranking framework that converts single-modal rankers into page-level guidance by constructing budget-aware candidates for cross-modal annotations and distilling intra-modality preferences to align relevance scales across modalities. |
| Outcome: | The proposed framework reduces annotation costs by 70-90% while outperforming fully-annotated reranking baselines. |
Detecting Stealthy Backdoor Samples based on Intra-class Distance for Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing detectors use classifier-style probability signals or rely on rewriting, which can degrade quality and introduce new triggers. |
| Approach: | They propose to efficiently remove poisoned examples before or during fine-tuning . |
| Outcome: | The proposed method outperforms prior detectors on two machine translation datasets and one QA dataset. |
Stable-RAG: Mitigating Retrieval-Permutation-Induced Hallucinations in Retrieval-Augmented Generation (2026.acl-long)
Copied to clipboard
| Challenge: | Existing RAG methods focus on enhancing LLM robustness to low-quality retrieval, but neither address permutation sensitivity. |
| Approach: | They propose a method that exploits permutation sensitivity to mitigate hallucinations in Large Language Models. |
| Outcome: | The proposed model improves answer accuracy, reasoning consistency, and generalization across datasets, retrievers, and input lengths compared with strong baselines. |
Beyond the Surface: A Solution-Aware Retrieval Model for Competition-level Code Generation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing retrieval models emphasize surface-level semantic similarity, neglecting deeper solution-level logical similarities. |
| Approach: | They propose a solution-aware ranking model empowered by synthetic data for competitive programming tasks. |
| Outcome: | The proposed ranking model outperforms existing retrieval models in precision and recall metrics. |
Vulnerability of Text-to-Image Models to Prompt Template Stealing: A Differential Evolution Approach (2025.findings-acl)
Copied to clipboard
Yurong Wu, Fangwen Mu, Qiuhong Zhang, Jinjing Zhao, Xinrun Xu, Lingrui Mei, Yang Wu, Lin Shi, Junjie Wang, Zhiming Ding, Yiwei Wang
| Challenge: | Prompt trading has emerged as a significant intellectual property concern in recent years, where vendors entice users by showcasing sample images before selling prompt templates that can generate similar images. |
| Approach: | They propose a prompt-stealing benchmark consisting of 50 templates and 450 images organized into Easy and Hard difficulty levels. |
| Outcome: | The proposed method outperforms baseline methods with an average improvement of over 10%. |
Language Models as Continuous Self-Evolving Data Engineers (2025.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable capabilities, yet their further evolution is often hampered by the scarcity of high-quality training data and the heavy reliance of traditional methods on expert-labeled data. |
| Approach: | They propose a paradigm that enables LLMs to train themselves by generating, cleaning, reviewing and annotating data with preference information. |
| Outcome: | The proposed model can generate, clean, review, and annotate data with preference information significantly reducing time and cost of post-training data construction. |
Exposure Bias versus Self-Recovery: Are Distortions Really Incremental for Autoregressive Text Generation? (2021.emnlp-main)
Copied to clipboard
| Challenge: | Exposure bias is a central problem for auto-regressive language models (LM) it is believed that teacher forcing would cause test-time generation to be incrementally distorted due to the training-generation discrepancy. |
| Approach: | They propose to quantify the impact of exposure bias in quality, diversity, consistency and consistency by using ground-truth data prefixes instead of prefix generated by the model. |
| Outcome: | The proposed model performs better when the training-generation discrepancy is removed . the model is more robust and self-recovery ability is shown to counter exposure bias. |
Privacy-Preserving Reasoning with Knowledge-Distilled Parametric Retrieval Augmented Generation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing RAG systems require uploading local documents to the cloud, resulting in inference latency and poor generalization on out-of-distribution (OOD) inputs. |
| Approach: | They propose a generalizable knowledge-distilled parametric RAG model aligned with standard RAG in document structure and parameter activation. |
| Outcome: | The proposed model outperforms baselines in accuracy and generalizes well on out-of-distribution (OOD) data. |
Turning Trash into Treasure: Accelerating Inference of Large Language Models with Token Recycling (2025.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) generate only one token at each decoding step, leading to high latency. |
| Approach: | They propose a speculative decoding paradigm that stores tokens in an adjacency matrix and employs a breadth-first-search algorithm to construct a draft tree. |
| Outcome: | The proposed method outperforms existing train-free methods by 30% and even a training method by 25%. |