Demo Data from EDBT 2026 / reviewers in the wild / expert
Xinda Wang 0006
dblp:402/0306
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2026
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
5 papers |
Language models and text generation · 66% Reinforcement learning · 12% Knowledge representation and reasoning · 9% | |
| Network and information security
1 paper |
Security and privacy of machine learning · 100% |
Topics — the 12 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Language models and text generation
large language model evaluation |
2.0 | 2 | 2026 | Gradient-Guided Multi-Judge Prompt Optimization · ACL (1) 2026 TASE: Token Awareness and Structured Evaluation for Multilingual Language Models · AAAI 2026 |
Natural language and speech › Language models and text generation › large language model evaluation
LLM-as-a-judge |
1.0 | 1 | 2026 | Gradient-Guided Multi-Judge Prompt Optimization · ACL (1) 2026 |
Natural language and speech › Language models and text generation › evaluation of language models
multilingual evaluation |
1.0 | 1 | 2026 | TASE: Token Awareness and Structured Evaluation for Multilingual Language Models · AAAI 2026 |
Natural language and speech › Language models and text generation › prompting › prompt engineering
prompt optimization |
1.0 | 1 | 2026 | Gradient-Guided Multi-Judge Prompt Optimization · ACL (1) 2026 |
Machine learning › Reinforcement learning
reward design |
1.0 | 1 | 2026 | Triviality Corrected Endogenous Reward · ACL (1) 2026 |
Natural language and speech › Language models and text generation › text generation evaluation
story evaluation |
1.0 | 1 | 2026 | EvolvR: Self-Evolving Pairwise Reasoning for Story Evaluation to Enhance Generation · ACL (1) 2026 |
Natural language and speech › Language models and text generation › text generation
story generation |
1.0 | 1 | 2026 | EvolvR: Self-Evolving Pairwise Reasoning for Story Evaluation to Enhance Generation · ACL (1) 2026 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
structured reasoning |
1.0 | 1 | 2026 | TASE: Token Awareness and Structured Evaluation for Multilingual Language Models · AAAI 2026 |
Computer vision › Face, body and person analysis
face recognition |
0.9 | 1 | 2025 | Recoverable Facial Identity Protection via Adaptive Makeup Transfer Adversarial Attacks · AAAI 2025 |
Security and privacy of machine learning
adversarial attack |
0.9 | 1 | 2025 | Recoverable Facial Identity Protection via Adaptive Makeup Transfer Adversarial Attacks · AAAI 2025 |
Machine learning › Generative modeling
generative adversarial network |
0.3 | 1 | 2025 | Recoverable Facial Identity Protection via Adaptive Makeup Transfer Adversarial Attacks · AAAI 2025 |
Machine learning › Generative modeling › style transfer
makeup transfer |
0.3 | 1 | 2025 | Recoverable Facial Identity Protection via Adaptive Makeup Transfer Adversarial Attacks · AAAI 2025 |
Methods — techniques the papers use, named apart from their topics
makeup transfer · 1.7generative adversarial network · 1.7triviality correction · 1.0synthetic data generation · 1.0self-evolving pairwise reasoning · 1.0reinforcement learning · 1.0multi-judge aggregation · 1.0gradient-guided optimization · 1.0endogenous reward · 1.0GRPO training · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | TASE: Token Awareness and Structured Evaluation for Multilingual Language ModelsabstractWhile large language models (LLMs) have demonstrated remarkable performance on high-level semantic tasks, they often struggle with fine-grained, token-level understanding and structural reasoning—capabilities that are essential for applications requiring precision and control. We introduce TASE, a comprehensive benchmark designed to evaluate LLMs' ability to perceive and reason about token-level information across languages. TASE covers 10 tasks under two core categories: token awareness and structural understanding, spanning Chinese, English, and Korean, with a 35,927-instance evaluation set and a scalable synthetic data generation pipeline for training. Tasks include character counting, token alignment, syntactic structure parsing, and length constraint satisfaction. We evaluate over 30 leading commercial and open-source LLMs, including O3, Claude 4, Gemini 2.5 Pro, and DeepSeek-R1, and train a custom Qwen2.5-14B model using the GRPO training method. Results show that human performance significantly outpaces current LLMs, revealing persistent weaknesses in token-level reasoning. TASE sheds light on these limitations and provides a new diagnostic lens for future improvements in low-level language understanding and cross-lingual generalization. Chenzhuo Zhao, Xinda Wang 0006, Junting Lu |
AAAI | 2 |
| 2026 | EvolvR: Self-Evolving Pairwise Reasoning for Story Evaluation to Enhance GenerationabstractXinda Wang, Zhengxu Hou, Yangshijie Zhang, Yanbingren, Jialin Liu, ChenZhuo Zhao, Zhibo Yang, Bin-Bin Yang, Feng Xiao. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026. Xinda Wang 0006, Zhengxu Hou, Yangshijie Zhang, Bingren Yan, Chenzhuo Zhao, Bin-Bin Yang |
ACL (1) | 1 |
| 2026 | Triviality Corrected Endogenous RewardabstractXinda Wang, Zhengxu Hou, Yangshijie Zhang, Yanbingren, Jialin Liu, ChenZhuo Zhao, Zhibo Yang, Bin-Bin Yang, Feng Xiao. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026. Xinda Wang 0006, Zhengxu Hou, Yangshijie Zhang, Bingren Yan, Chenzhuo Zhao, Bin-Bin Yang |
ACL (1) | 1 |
| 2026 | Gradient-Guided Multi-Judge Prompt OptimizationabstractChenZhuo Zhao, Xinda Wang, Pu Zhao, Yue Huang, Junting Lu, Ziqian Liu, Qingwei Lin, Saravan Rajmohan, Dongmei Zhang. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2026. Chenzhuo Zhao, Xinda Wang 0006, Pu Zhao 0004, Junting Lu, Qingwei Lin, Saravan Rajmohan, Dongmei Zhang 0001 |
ACL (1) | 2 |
| 2025 | Recoverable Facial Identity Protection via Adaptive Makeup Transfer Adversarial AttacksabstractUnauthorised face recognition (FR) systems have posed significant threats to digital identity and privacy protection. To alleviate the risk of compromised identities, recent makeup transfer-based attack methods embed adversarial signals in order to confuse unauthorised FR systems. However, their major weakness is that they set up a fixed image unrelated to both the protected and the makeup reference images as the confusion identity, which in turn has a negative impact on both attack success rate and visual quality of transferred photos. In addition, the generated images cannot be recognised by authorised FR systems once attacks are triggered. To address these challenges, in this paper, we propose a Recoverable Makeup Transferred Generative Adversarial Network (RMT-GAN) which has the distinctive feature of improving its image-transfer quality by selecting a suitable transfer reference photo as the target identity. Moreover, our method offers a solution to recover the protected photos to their original counterparts that can be recognised by authorised systems. Experimental results demonstrate that our method provides significantly improved attack success rates while maintaining higher visual quality compared to state-of-the-art makeup transfer-based adversarial attack methods. Our code and supplementary materials are available on Github. Xiyao Liu 0001, Junxing Ma, Xinda Wang 0006, Qianyu Lin, Jian Zhang 0048, Gerald Schaefer, Cagatay Turkay, Hui Fang 0003 |
AAAI | 3 |