Papers by Zhuo Yu
SecFormer: Fast and Accurate Privacy-Preserving Inference for Transformer Models via SMPC (2024.findings-acl)
Copied to clipboard
| Challenge: | a growing number of cloud-based inference services are relying on SMPC to protect data privacy. |
| Approach: | They propose a framework for Privacy-Preserving Inference for Transformer models that eliminates exponential and maximum operations in PPI without sacrificing model performance. |
| Outcome: | The proposed framework outperforms MPCFormer in terms of performance and efficiency . it is 3.57 and 3.58 times faster than PUMA for BERTBASE and BERTLARGE . |
Revisiting Data Reconstruction Attacks on Real-world Dataset for Federated Natural Language Understanding (2024.lrec-main)
Copied to clipboard
Zhuo Zhang, Jintao Huang, Xiangjing Hu, Jingyuan Zhang, Yating Zhang, Hui Wang, Yue Yu, Qifan Wang, Lizhen Qu, Zenglin Xu
| Challenge: | Existing DRA methods fail to accurately recover the original text of real-world privacy data. |
| Approach: | They propose to use a real-world privacy dataset to examine the performance of federated learning (FL) methods. |
| Outcome: | The proposed method improves on a real-world privacy dataset and shows that the tokens within a recovery sentence are disordered and intertwined with tokens from other sentences in the same training batch. |
Decomposition for Enhancing Attention: Improving LLM-based Text-to-SQL through Workflow Paradigm (2024.findings-acl)
Copied to clipboard
Yuanzhen Xie, Xinzhou Jin, Tao Xie, Matrixmxlin Matrixmxlin, Liang Chen, Chenyun Yu, Cheng Lei, Chengxiang Zhuo, Bo Hu, Zang Li
| Challenge: | In-context learning of large-language models has achieved remarkable success in the field of natural language processing . however, the single-step chain-of-thought prompting approach faces challenges such as attention diffusion and inadequate performance in complex tasks like text-to-SQL. |
| Approach: | They propose a workflow paradigm method to enhance the attention and problem-solving scope of large-language models through decomposition. |
| Outcome: | The proposed method outperforms existing methods on three datasets and improves the upper limit of LLM-based approaches. |
Benchmarking Vision-Language Models on Chinese Ancient Documents: From OCR to Knowledge Reasoning (2026.findings-acl)
Copied to clipboard
Haiyang Yu, Yuchuan Wu, Fan Shi, Jinghui Lu, Ke Niu, Xiaodong Ge, Minghan Zhuo, Jingqun Tang, Bin Li
| Challenge: | Existing document benchmarks focus on English printed texts or simplified Chinese . current vision-language models struggle with visual complexity and poor adaptability . |
| Approach: | They propose a benchmark to evaluate Chinese ancient documents' visual/linguistic complexity . ancient documents are valuable cultural heritage, but they face challenges in digitization and understanding . |
| Outcome: | the first benchmark for Chinese ancient documents evaluates VLMs from OCR to knowledge reasoning . ancient documents carry thousands of years of Chinese history and culture . traditional methods only scan images, while current models struggle with visual complexity . |
CoTEvol: Self-Evolving Chain-of-Thoughts for Data Synthesis in Mathematical Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to improve LLMs' reasoning abilities suffer from diminishing returns or high computing overhead. |
| Approach: | They propose a genetic evolutionary framework that casts CoT generation as a population-based search over reasoning trajectories. |
| Outcome: | The proposed framework improves correct-CoT synthesis success by over 30% and enhances structural diversity with markedly improved efficiency. |
MARCH: Multi-Agent Reinforced Check for Hallucination (2026.acl-long)
Copied to clipboard
Zhuo Li, Yupeng Zhang, Pengyu Cheng, Jiajun Song, Mengyu Zhou, Hao Li, Shujie Hu, Yu Qin, null Erchao.zec, Xiaoxi Jiang, null Guanjunjiang
| Challenge: | Existing methods to detect hallucinations suffer from inherent confirmation bias, where the verifier inadvertently reproduces the errors of the original generation. |
| Approach: | They propose a framework that enforces rigorous factual alignment by leveraging deliberate *information asymmetry* by combining a pipeline of three specialized agents: a Solver, a Proposer, and a Checker. |
| Outcome: | Extensive experiments across hallucination benchmarks demonstrate that MARCH substantially reduces hallucinism rates. |
FedPETuning: When Federated Learning Meets the Parameter-Efficient Tuning Methods of Pre-trained Language Models (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing research on federated learning (FL) for pre-trained language models (PLMs) with increasing concerns about data privacy, enterprises or institutions are not allowed to collect data from end devices or local clients to a centralized server for fine-tuning PLMs. |
| Approach: | They investigate the parameter-efficient tuning of pre-trained language models (PLMs) and develop a federated benchmark for four representative PETuning methods . |
| Outcome: | The proposed method can defend against privacy attacks and maintain acceptable performance with reducing heavy resource consumption. |
COPR: Continual Human Preference Learning via Optimal Policy Regularization (2025.findings-acl)
Copied to clipboard
Han Zhang, Lin Gui, Yu Lei, Yuanzhao Zhai, Yehong Zhang, Zhuo Zhang, Yulan He, Hui Wang, Yue Yu, Kam-Fai Wong, Bin Liang, Ruifeng Xu
| Challenge: | Reinforcement Learning from Human Feedback (RLHF) is effective for aligning Large Language Models with human preferences, but its complex process limits its ability to continually learn human feedback. |
| Approach: | They propose a non-RL offline method to convert historical optimal policies into optimization constraints when continually learning new preferences. |
| Outcome: | The proposed method outperforms strong CL baselines in terms of reward-based evaluations and human assessment. |
Intent-Driven Semantic ID Generation for Grounded Conversational News Recommendation (2026.acl-industry)
Copied to clipboard
| Challenge: | a new approach to news recommendation grounds each suggestion in a rapidly evolving article corpus while addressing implicit user intents that lack explicit retrievable keywords. |
| Approach: | They propose an intent-driven Semantic ID generation paradigm to address these challenges . they map diverse intents to hierarchical SID prefixes and then fuzzy-match them to current news pool . |
| Outcome: | The proposed model achieves 0% hallucination and 12.4% L1 match on a mainstream Chinese news platform. |
GigaSpeech 2: An Evolving, Large-Scale and Multi-domain ASR Corpus for Low-Resource Languages with Automated Crawling, Transcription and Refinement (2025.acl-long)
Copied to clipboard
Yifan Yang, Zheshu Song, Jianheng Zhuo, Mingyu Cui, Jinpeng Li, Bo Yang, Yexing Du, Ziyang Ma, Xunying Liu, Ziyuan Wang, Ke Li, Shuai Fan, Kai Yu, Wei-Qiang Zhang, Guoguo Chen, Xie Chen
| Challenge: | GigaSpeech 2 is a large-scale, multi-domain, multilingual speech recognition corpus for low-resource languages. |
| Approach: | They propose a large-scale, multi-domain, multilingual speech recognition corpus for low-resource languages and an automated pipeline for data crawling, transcription, and label refinement. |
| Outcome: | The proposed corpus reduces the word error rate for Thai, Indonesian, and Vietnamese on a realistic YouTube test set by 25% to 40% compared to Whisper large-v3. |
DP-NMT: Scalable Differentially Private Machine Translation (2024.eacl-demo)
Copied to clipboard
| Challenge: | Neural machine translation (NMT) is a popular text generation task, yet there is nagging data privacy concerns. |
| Approach: | They propose an open-source framework for a privacy-preserving NMT with DP-SGD. |
| Outcome: | The proposed framework is open-source and open to the public . it combines models, datasets, and evaluation metrics to demonstrate its effectiveness. |
LoRE: Enhancing Search Relevance with Progressive Chain-of-Thought and Preference Alignment (2026.findings-acl)
Copied to clipboard
Chenji Lu, Zhuo Chen, Hui Zhao, Zhiyuan Zeng, Gang Zhao, Junjie Ren, null Lihaoran, Songyan Liu, Pengjie Wang, Chuan Yu, Jian Xu, Bo Zheng
| Challenge: | E-commerce search relevance is a critical component of retrieval systems. |
| Approach: | They propose a large-generative model for search relevance that trains reasoning knowledge, multi-modal understanding and rule awareness into three core competencies. |
| Outcome: | The proposed model outperforms GPT-5 in Macro-F1 and achieves 27% online gain. |
On the Role of Model Prior in Real-World Inductive Reasoning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have evaluated the inductive reasoning capabilities of Large Language Models (LLMs) by evaluating their ability to generate textual hypotheses based on in-context input-output pairs and test these hypothese based upon unseen examples. |
| Approach: | They evaluated three inductive reasoning strategies across five real-world tasks with three LLMs and found that hypothesis generation is primarily driven by the model’s inherent priors. |
| Outcome: | The proposed models generate high-quality hypotheses that can generalize to new instances when guided by in-context demonstrations. |
Same Company, Same Signal: The Role of Identity in Earnings Call Transcripts (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing studies rely on earnings call transcripts to predict volatility, but current models focus on capturing ticker identity rather than providing meaningful insights specific to each earnings. |
| Approach: | They propose a dataset that provides 20 earnings records per ticker to help predict volatility . they propose two training-free baselines to capture ticker-specific patterns . |
| Outcome: | The proposed dataset provides 20 earnings records per ticker, with a priorAfterMarket attribute and dense ticker coverage. |
Evolutionary Negative Module Pruning for Better LoRA Merging (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for integrating multiple low-rank Adaptation experts into a single backbone are limited by negative modules. |
| Approach: | They propose a plug-and-play LoRA pruning method to locate and exclude negative modules prior to merging. |
| Outcome: | The proposed method boosts the performance of existing merging algorithms across languages and vision domains. |