Papers by Zhiming Zheng
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. |
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. |