Papers by Xinda Wang
SAFER: Advancing Safety Alignment via Efficient Ex-Ante Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing alignment methods struggle to cover diverse safety scenarios and remain vulnerable to adversarial attacks. |
| Approach: | They propose a framework for 'S**afety' alignment via e**F**ficient' E**x-Ante-R**easoning that instantiates structured Ex-Ance reasoning and embeds predefined safety rules. |
| Outcome: | The proposed framework enhances safety performance while maintaining usefulness and efficiency. |
EvolvR: Self-Evolving Pairwise Reasoning for Story Evaluation to Enhance Generation (2026.acl-long)
Copied to clipboard
Xinda Wang, Zhengxu Hou, Yangshijie Zhang, null Yanbingren, Jialin Liu, ChenZhuo Zhao, Zhibo Yang, Bin-Bin Yang, Feng Xiao
| Challenge: | Existing methods for story evaluation lack reasoning capabilities for open-source models . evolvR framework provides high-fidelity evaluators for story generation tasks . |
| Approach: | They propose a framework that self-synthesizes chain-of-thought data via a multi-persona strategy . they propose evolvR to provide a reward model for story generation . |
| Outcome: | The proposed framework achieves state-of-the-art performance on three evaluation benchmarks . it also enhances the quality of generated stories, validating the superiority of the framework . |
Gradient-Guided Multi-Judge Prompt Optimization (2026.acl-long)
Copied to clipboard
ChenZhuo Zhao, Xinda Wang, Pu Zhao, Yue Huang, Junting Lu, Ziqian Liu, Qingwei Lin, Saravan Rajmohan, Dongmei Zhang
| Challenge: | Existing approaches to prompt optimization trade off signal quality against computational cost. |
| Approach: | They propose a framework that uses a first-order gradient approximation to score segment importance in a continuous masking direction. |
| Outcome: | The proposed framework improves efficiency and robustness by using a first-order gradient approximation to score segment importance in a continuous masking direction. |
Triviality Corrected Endogenous Reward (2026.acl-long)
Copied to clipboard
Xinda Wang, Zhengxu Hou, Yangshijie Zhang, null Yanbingren, Jialin Liu, ChenZhuo Zhao, Zhibo Yang, Bin-Bin Yang, Feng Xiao
| Challenge: | Recent work on unsupervised reinforcement learning for mathematical reasoning using confidence-based endogenous rewards focuses on open-ended text generation, requiring either annotated data or powerful closed-source models. |
| Approach: | They propose a method that rewards the relative information gain between a specialist and a generalist reference policy, modulated by a probability-dependent correction mechanism. |
| Outcome: | The proposed model improves on multiple writing benchmarks and model architectures without external supervision and validates generality across different generation tasks. |
PMPO: Probabilistic Metric Prompt Optimization for Small and Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods evaluate candidate prompts by sampling full outputs, often coupled with self critique or human annotated preferences, which limits scalability, especially for smaller models or models that are not instruction tuned. |
| Approach: | They propose a framework that uses token level cross entropy as a direct, lightweight evaluation signal to evaluate candidate prompts. |
| Outcome: | The proposed framework outperforms prior prompt optimizers across model sizes and datasets. |