Papers by Zhuo Wang

40 papers
Advancing Zero-shot Text-to-Speech Intelligibility across Diverse Domains via Preference Alignment (2025.acl-long)

Copied to clipboard

Challenge: Existing zero-shot text-to-speech systems struggle in challenging scenarios such as tongue twisters, repeated words, code-switching, and cross-lingual synthesis.
Approach: They propose a dataset that leverages preference alignment techniques to improve performance . they also extend the Direct Preference Optimization framework to accommodate diverse TTS architectures .
Outcome: The proposed dataset improves intelligibility, similarity, and audio quality for multiple models across domains.
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 .
WhitenedCSE: Whitening-based Contrastive Learning of Sentence Embeddings (2023.acl-long)

Copied to clipboard

Challenge: Extensive experiments on seven semantic textual similarity tasks show our method achieves consistent improvement over the contrastive learning baseline and sets new states of the art.
Approach: They propose a whitening-based contrastive learning method for sentence embedding learning which combines contrastive and shuffled group whitening.
Outcome: The proposed method achieves better alignment and uniformity on seven semantic textual similarity tasks.
Adaptive Hyper-parameter Learning for Deep Semantic Retrieval (2023.emnlp-industry)

Copied to clipboard

Challenge: Existing methods for deep semantic retrieval are highly sensitive to hyper-parameters . a novel adaptive metric learning method is proposed to overcome this limitation .
Approach: They propose a method that adaptively obtains hyper-parameters without fixed or extra-trainable hyper-parmeters . they adopt a symmetric metric learning method to mitigate model collapse issues .
Outcome: The proposed method outperforms existing methods on a real-world dataset and brings economic benefits.
Revisiting Data Reconstruction Attacks on Real-world Dataset for Federated Natural Language Understanding (2024.lrec-main)

Copied to clipboard

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.
SDiaReward: Modeling and Benchmarking Spoken Dialogue Rewards with Modality and Colloquialness (2026.acl-long)

Copied to clipboard

Challenge: SDiaReward is an end-to-end spoken dialogue system that integrates paralinguistic nuances and spontaneous nature of human conversation.
Approach: They propose an end-to-end multi-turn reward model trained on SDiaReward-Dataset . it is a collection of episode-level preference pairs targeting modality and colloquiality gaps .
Outcome: The proposed model outperforms general-purpose audio LLMs in episode-level evaluation.
Towards Reliable Large Audio Language Model (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in large audio language models (LALMs) have demonstrated impressive results and promising prospects in universal understanding and reasoning across speech, music, and general sound.
Approach: They propose to use training-free and training-based methods to enhance LALM reliability to different extents.
Outcome: The proposed methods improve the reliability of large audio language models to different extents.
Assistant-Guided Mitigation of Teacher Preference Bias in LLM-as-a-Judge (2025.findings-emnlp)

Copied to clipboard

Challenge: LLM-as-a-Judge uses large language models to evaluate the quality of LLM generated responses, but training proxy judge models using evaluation data generated by powerful teacher models introduces a critical yet previously overlooked issue: teacher preference bias.
Approach: They propose a new setting that incorporates an additional assistant model, which is not biased toward the teacher model’s responses, to complement the training data.
Outcome: The proposed model reduces teacher preference bias while maintaining strong performance across six evaluation benchmarks.
Med-SRAF: A Multi-Agent Framework for Medical Reasoning via Semantic Routing and Agentic Fusion (2026.findings-acl)

Copied to clipboard

Challenge: Existing RAG methods suffer from a two-part problem: semantic drift and concatenation fallacy . et al.: rapid development of Large Language Models has led to a paradigm shift in artificial intelligence .
Approach: They propose a multi-agent retrieval augmentation framework guided by medical domain knowledge to address these challenges.
Outcome: The proposed framework outperforms existing general RAG baselines on five widely used medical benchmarks.
ArkRepoBench: A Repository-Level Code Completion Benchmark for HarmonyOS Development (2026.findings-acl)

Copied to clipboard

Challenge: Despite the maturity of LLM-based code assistance for mainstream languages, the capabilities of ArkTS are largely unexplored.
Approach: They propose to benchmark repository-level code completion for ArkTS using 7,519 samples from 20 official HarmonyOS repositories.
Outcome: The proposed benchmark covers multiple difficulty levels and categorizes completion instances into Single-File, Cross-Filled Independent, and Cross-Filed Dependent settings based on dependency analysis.
Out-of-Distribution Generalization in Natural Language Processing: Past, Present, and Future (2023.emnlp-main)

Copied to clipboard

Challenge: Existing literature on the generalization of machine learning models to out-of-distribution data is lacking.
Approach: They propose to present the first comprehensive review of recent progress, methods, and evaluations on the generalization challenge from an OOD perspective in natural language understanding.
Outcome: The proposed survey provides the first comprehensive review of recent progress, methods, and evaluations on the generalization challenge from an OOD perspective in natural language understanding.
On Robustness of Prompt-based Semantic Parsing with Large Pre-trained Language Model: An Empirical Study on Codex (2023.eacl-main)

Copied to clipboard

Challenge: Existing techniques for parsing natural-language utterances are vulnerable to adversarial attacks, requiring large amounts of labelled data and expensive human annotation.
Approach: They propose to enhance the adversarial robustness of a prompt-based semantic parser based on a language model trained on code by constructing a set of demonstration examples.
Outcome: The proposed method can be enhanced without significant amounts of labelled data or expensive human annotations on in-domain semantic parsing data.
Not Just Plain Text! Fuel Document-Level Relation Extraction with Explicit Syntax Refinement and Subsentence Modeling (2022.findings-emnlp)

Copied to clipboard

Challenge: Document-level relation extraction (DocRE) aims to identify semantic labels among entities within a document.
Approach: They propose a document-level relation extraction framework that captures and exploits instructive information by adding extra syntactic information into text representations.
Outcome: The proposed framework outperforms existing methods on three benchmark datasets.
ADEPT-SQL: A High-performance Text-to-SQL Application for Real-World Enterprise-Level Databases (2025.acl-demo)

Copied to clipboard

Challenge: et al., 2017) address domain-specific knowledge barriers, schemas complexity, and computational costs of large LLMs.
Approach: They propose a domain-adapted Text2SQL system that addresses critical deployment challenges in professional fields.
Outcome: The proposed system achieves 97% execution accuracy on real-world databases . it is faster than existing systems and has a higher performance than existing ones.
KBM: Delineating Knowledge Boundary for Adaptive Retrieval in Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Retrieval-augmented generation (RAG) is employed to tackle these challenges . a Knowledge Boundary Model (KBM) is used to express the known/unknown of a given question .
Approach: They propose a Knowledge Boundary Model to express the known/unknown of a given question . they find that not all questions need to trigger RAG to improve performance .
Outcome: The proposed model reduces time and computational costs by retrieving parts of unknown knowledge . the proposed model can express the known/unknown of a given question and determine whether a RAG needs to be triggered .
Prompting ChatGPT in MNER: Enhanced Multimodal Named Entity Recognition with Auxiliary Refined Knowledge (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to enhance textual entity prediction neglect the need for external knowledge or encounter high redundancy in the retrieved knowledge.
Approach: They propose a framework that leverages ChatGPT as an implicit knowledge base and heuristically generates auxiliary knowledge for more efficient entity prediction.
Outcome: The proposed framework outperforms state-of-the-art methods on two classic datasets and exhibits a stronger robustness and generalization capability.
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.
From Implicit Exploration to Structured Reasoning: Guideline and Refinement for LLMs (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing models rely on implicit exploration, which leads to unstable reasoning paths and lack of error correction.
Approach: They propose a framework that shifts from implicit exploration to structured reasoning through guideline and refinement.
Outcome: The proposed model outperforms strong baselines on the Big-Bench Hard benchmark.
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.
From Conversation to Evaluation: Benchmarking LLMs on Development Knowledge via SimpleDevQA (2026.findings-acl)

Copied to clipboard

Challenge: Existing Dev Knowledge QA benchmarks are limited in development knowledge scope and often not built from real user queries.
Approach: They conduct preliminary analysis of real user–LLM dialogues from WildChat to investigate the importance of Dev Knowledge QA in AI-assisted software development scenarios.
Outcome: The proposed benchmark is based on real user–LLM dialogues from WildChat.
COPR: Continual Human Preference Learning via Optimal Policy Regularization (2025.findings-acl)

Copied to clipboard

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.
From Curated Data to Scalable Models: Continual Pre-training of Dense and MoE Large Language Models for Tibetan (2026.acl-long)

Copied to clipboard

Challenge: Large language models have achieved remarkable success across a wide range of tasks, yet their performance remains heavily biased toward high-resource languages.
Approach: They propose a pipeline for advancing Tibetan language modeling through multilingual continual pre-training with Tibetan, Chinese, and English.
Outcome: The proposed model outperforms open-source and Tibetan-focused models on diverse tasks.
Federated Model Decomposition with Private Vocabulary for Text Classification (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods to train federated learning (FL) for natural language processing require sensitive data to leave local devices.
Approach: They propose a fedrated model decomposition method that protects the privacy of vocabularies . they propose an adaptive updating technique to improve the performance of local models .
Outcome: The proposed method protects the privacy of vocabularies in federated learning tasks . it maintains competitive performance and provides better privacy-preserving capacity compared to status quo methods.
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

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.
FEDLEGAL: The First Real-World Federated Learning Benchmark for Legal NLP (2023.acl-long)

Copied to clipboard

Challenge: federated learning (FL) is a promising technique for preserving data privacy . however, there is no work on applying FL to legal NLP .
Approach: They propose to use federated learning to train models in a collaborative way without sharing data . they propose to test the FL benchmark on real-world legal data from Chinese courts .
Outcome: The proposed benchmark combines five legal NLP tasks and one privacy task on Chinese courts.
LoRE: Enhancing Search Relevance with Progressive Chain-of-Thought and Preference Alignment (2026.findings-acl)

Copied to clipboard

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.
Detecting Knowledge Boundary of Vision Large Language Models by Sampling-Based Inference (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods to detect the knowledge boundary of Vision Large Language Models (VLLMs) are expensive and require indiscriminate retrieval to address questions that require real-time information or are knowledge-intensive.
Approach: They propose a method that fine-tunes a VLLM on an automatically constructed dataset for boundary identification.
Outcome: The proposed method reduces indiscriminate retrieval while maintaining or improving the performance of a VLLM on an automatically constructed dataset.
Graph-guided Cross-composition Feature Disentanglement for Compositional Zero-shot Learning (2025.findings-acl)

Copied to clipboard

Challenge: Disentanglement of visual features of primitives (i.e., attributes and objects) has shown exceptional results in Compositional Zero-shot Learning (CZSL).
Approach: They propose a solution that takes multiple compositions as inputs and constrains disentangled primitive features to be general across compositions.
Outcome: The proposed architecture significantly improves performance on three popular CZSL benchmarks and has been verified by solid ablation studies.
Safeguarding LLM Fine-tuning via Push-Pull Distributional Alignment (2026.acl-long)

Copied to clipboard

Challenge: Existing safety defenses for large language models fail to explicitly repel harmful patterns . Optimal transport (SOT) allows for safe fine-tuning without sacrificing safety .
Approach: They propose a framework that reframes safe fine-tuning from instance-level filtering challenge to distribution-level alignment task grounded in Optimal Transport.
Outcome: a new framework improves safety of large language models while maintaining competitive performance . the proposed framework reduces the risk of errors and improves model performance compared to baselines .
Self-Improvement Towards Pareto Optimality: Mitigating Preference Conflicts in Multi-Objective Alignment (2025.findings-acl)

Copied to clipboard

Challenge: Existing approaches to optimize large language models with human preferences suffer from preference conflicts in the data.
Approach: They propose to construct Pareto-optimal responses to resolve preference conflicts by using a self-improving DPO framework that enables LLMs to self-generate and select Paret-optimized responses.
Outcome: The proposed framework achieves superior Pareto Front performance over baselines on two datasets.
Self-Improvement Programming for Temporal Knowledge Graph Question Answering (2024.lrec-main)

Copied to clipboard

Challenge: Existing methods implicitly model time constraints by learning time-aware embeddings of questions and candidate answers, which is far from understanding the question comprehensively.
Approach: They propose a temporal-based temporal programming method that leverages the in-context learning ability of Large Language Models to understand combinatory time constraints in questions.
Outcome: The proposed method outperforms existing methods on multiTQ and CronQuestions datasets and is highly efficient on multi-level questions.
Breaking the Hourglass Phenomenon of Residual Quantization: Enhancing the Upper Bound of Generative Retrieval (2024.emnlp-industry)

Copied to clipboard

Challenge: Generative retrieval (GR) is a transformative paradigm in search and recommender systems . however, data sparsity and long-tailed distribution hinder the full utilization of GR .
Approach: They propose a method to reduce the "Hourglass" phenomenon in RQ-SID where codebook tokens become overly concentrated.
Outcome: The proposed methods improve retrieval efficiency and generalization capabilities.
OSCR-Attack: One-Shot Character Level Attacks through Self-Optimizing Continuous Relaxation (2026.findings-acl)

Copied to clipboard

Challenge: Character-level adversarial attacks preserve semantics but are costly and inefficient . generative LLMs are gaining popularity due to their uncertainty and vulnerability to textual adversarials .
Approach: They propose an end-to-end framework that transforms discrete choices into continuous representations and a conflict resolution strategy that maps them back into discrete insertion operations.
Outcome: The proposed framework improves ASR by 21.45% points and accelerates the attack by 3.66 times compared to baselines.
WavAlign: Enhancing Intelligence and Expressiveness in Spoken Dialogue Models via Adaptive Hybrid Post-Training (2026.findings-acl)

Copied to clipboard

Challenge: End-to-end spoken dialogue models have higher potential ceiling in expressiveness and perceptual ability than cascaded systems.
Approach: They propose a modality-aware adaptive post-training recipe that constrains preference updates to the semantic channel and improves acoustic behavior via explicit anchoring.
Outcome: The proposed model improves speech quality and expressiveness across spoken dialogue benchmarks and architectures.
DetectLLM: Leveraging Log Rank Information for Zero-Shot Detection of Machine-Generated Text (2023.findings-emnlp)

Copied to clipboard

Challenge: Large language models generate huge amounts of text, making it impractical to manually distinguish whether a text is machine-generated.
Approach: They propose two methods to detect machine-generated text by leveraging Log-Rank information and propose a faster method that uses less perturbations to achieve the same level of performance.
Outcome: The proposed methods improve over the state of the art by 3.9 and 1.75 AUROC points absolute and require less perturbations to achieve the same level of performance.
Psyche-R1: Towards Reliable Psychological LLMs through Unified Empathy, Expertise, and Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Recent reasoning-augmented LLMs have demonstrated impressive capabilities across a wide range of domains owing to their exceptional text understanding capabilities.
Approach: They propose a Chinese psychological LLM that integrates empathy, psychological expertise, and reasoning.
Outcome: The proposed model produces over 75k high-quality psychological questions paired with detailed rationales, generated through and iterative prompt-rationale optimization procedure, along with 73k empathetic dialogues.
FinHEAR: Human Expertise and Adaptive Risk-Aware Temporal Reasoning for Financial Decision-Making (2025.findings-emnlp)

Copied to clipboard

Challenge: Large language models often overlook key behavioral patterns underlying human financial behavior.
Approach: FinHEAR is a multi-agent framework for human expertise and Adaptive Risk-aware reasoning.
Outcome: FinHEAR outperforms baseline models in trend forecasting and decision-making.
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.
TROJail: Trajectory-Level Optimization for Multi-Turn Large Language Model Jailbreaks with Process Rewards (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to training multi-turn attackers to probe model safety vulnerabilities rely on turn-level optimization, which is insufficient for learning long-term attack strategies.
Approach: They propose a multi-turn reinforcement learning problem that optimizes the harmfulness of the final-turn response as the outcome reward.
Outcome: The proposed approach improves attack success rates across multiple models and benchmarks, highlighting the effectiveness of the proposed approach.
Improving Retrieval Augmented Open-Domain Question-Answering with Vectorized Contexts (2024.findings-acl)

Copied to clipboard

Challenge: Retrieval Augmented Generation can be used to process long contexts in Open-Domain Question-Answering tasks.
Approach: They propose a method to cover longer contexts in Open-Domain Question-Answering tasks by using a small encoder language model and cross-attention with origin inputs.
Outcome: The proposed method can cover longer contexts while keeping the computing requirements close to the baseline.

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