Kaishun Wu
2026
VIDA: A Visual Intent-driven Design Assistant for Proactive Multimodal Clarification
Yanshan Liu | Hongbo Zhang | Zhen Sun | Jiaheng Wei | Kaishun Wu
Findings of the Association for Computational Linguistics: ACL 2026
Yanshan Liu | Hongbo Zhang | Zhen Sun | Jiaheng Wei | Kaishun Wu
Findings of the Association for Computational Linguistics: ACL 2026
In complex domains like interior design, user requests are often ambiguous and multimodal. Professional designers address this by asking strategic clarification questions based on hierarchical priorities, a capability lacking in current Vision-Language Models (VLMs). When fine-tuned on dialogue data, existing models often exhibit modality forgetting, overfitting to textual patterns while neglecting visual cues and thus producing hallucinated or visually irrelevant questions. To bridge this gap, we introduce VIDA (Visual Intent-driven Design Assistant), an assistant designed to generate proactive, visually grounded, and strategically prioritized clarification questions. Instead of standard fine-tuning, we propose a strategy-aware alignment framework that evolves from imitation learning to value-driven reinforcement. We utilize Group Sequence Policy Optimization to strictly enforce expert protocols, ensuring the model not only mimics fluent speech but also adheres to optimal inquiry strategies. Crucially, we design a novel hierarchical reward mechanism with Dynamic Intent Binding to align the assistant with professional prioritization standards. To facilitate this research, we construct and release InteriorClarify, a multimodal benchmark dataset comprising 1,016 real-world consultation cases annotated with this three-tier intent hierarchy. Extensive experiments demonstrate that VIDA sets a new state-of-the-art, improving the Strategic Alignment Score (SAS) by 20.59% over SFT baselines and effectively restoring visual grounding capabilities lost during standard fine-tuning.
Beyond Prompt Engineering: A Systematic Analysis of Prompt Lexical Sensitivity and Its Impacts on Quality
Qipeng Xie | Zi Liang | Jiafei Wu | Yufei Chen | Weizheng Wang | Wenao Ma | Zhong Ming | Haiqin Yang | Kaishun Wu
Findings of the Association for Computational Linguistics: ACL 2026
Qipeng Xie | Zi Liang | Jiafei Wu | Yufei Chen | Weizheng Wang | Wenao Ma | Zhong Ming | Haiqin Yang | Kaishun Wu
Findings of the Association for Computational Linguistics: ACL 2026
Large Language Models (LLMs) often exhibit extreme sensitivity to surface-level prompt variations, where minor lexical perturbations trigger disproportionate performance fluctuations. Moving beyond black-box optimization or coarse-grained templates, we conduct the first analysis of n-gram token-level mechanisms, leveraging a large-scale dataset of 132,000 prompt variants. Our investigation uncovers the Scaling Law of Prompt Performance Stability: higher average performance is inherently associated with lower variance and greater stability. We identify that this robustness is driven by two linguistic pillars: Domain-Specific Terminology, which anchors semantic boundaries, and Explicit Action Directives, which formalize reasoning trajectories. By narrowing the model’s interpretative space, these patterns effectively "lock" the generation process. We operationalize these findings into an automated Prompt-Refining Agent that autonomously restructures queries via domain anchoring and operational constraints. Empirical results show a 40.7% reduction in performance variance for code generation, offering a statistically grounded framework for robust prompt engineering.
Listening Like Humans: Semantics-Guided Noise-Robust Multimodal Speech Recognition
Yan Fang | Jun Chen | Yian Yao | Shuxin Zhong | Min Sun | Kaishun Wu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Yan Fang | Jun Chen | Yian Yao | Shuxin Zhong | Min Sun | Kaishun Wu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Severe acoustic degradation is often caused by overlapping noise, disfluencies, and environmental distortions. This phenomenon results in the dissolution of linguistic structures and the generation of unreliable ASR outputs. Inspired by human speech comprehension, we propose Speech-MLM, a novel multimodal framework that reframes ASR as semantics-guided speech reconstruction. This perspective introduces three core challenges: (C1) collapse of linguistic structure under acoustic degradation, (C2) semantic ambiguity under noise, and (C3) misalignment across modalities. To address these issues, we propose Speech-MLM, a multimodal ASR framework that integrates speech, spectrogram-derived visual cues, and textual variants to enhance robustness. It consists of: (i) Cognitive Structure Extractor that recovers prosodic structure from visualized acoustic features, (ii) Semantic Weaver that learns semantic equivalence across varied textual forms, and (iii) Retrieval-Guided Fusion Learner that unifies modalities within a shared semantic space. Experiments on multiple real-world noisy datasets demonstrate that Speech-MLM achieves an average 38.85% reduction in WER, while also attaining 98.71% BERTScore and 96.7% USE, over advanced baselines, demonstrating substantial gains in semantic robustness and generalization across domains.
MTO: A Multi-turn Conversational Text-to-OverpassQL Dataset for Enhanced OpenStreetMap Query Generation
Haodi Zhang | Xinrui Zhu | Mingze Kong | Zhidan Liu | Tao Fan | Kaishun Wu | Yuanfeng Song
Findings of the Association for Computational Linguistics: ACL 2026
Haodi Zhang | Xinrui Zhu | Mingze Kong | Zhidan Liu | Tao Fan | Kaishun Wu | Yuanfeng Song
Findings of the Association for Computational Linguistics: ACL 2026
We propose a comprehensive framework for constructing multi-turn Text-to-OverpassQL dialogue datasets. Under this framework, we introduce the first multi-turn Text-to-OverpassQL dataset built upon the OverpassNL corpus. Our dataset comprises over 7,800 dialogues, each containing 2 to 4 user utterances, resulting in more than 20,000 individual utterances aligned with executable Overpass queries. To generate high-quality multi-turn dialogues, we design a four-stage pipeline. First, we convert Overpass queries into syntax trees using a custom parser developed based on the official OverpassQL grammar. This enables structural manipulation while preserving syntactic and executable validity. Second, we apply a diverse set of tree-editing templates, including both simple keyword-level changes and complex structural decompositions, to produce multiple valid and diverse Overpass queries. Third, we leverage a prompt-based approach to guide large language models in generating context-aware natural language questions, ensuring increasing inter-turn dependency across the dialogue. Finally, we implement a hybrid filtering strategy that combines manual annotation with model-assisted selection to validate alignment and correctness at scale. In addition to presenting the dataset, we evaluate the performance of several mainstream large language models and demonstrate that our end-to-end baseline model achieves competitive results. This work offers a new benchmark for studying executable semantic parsing and contextual understanding in map-based query tasks.
2025
Efficient Data Labeling by Hierarchical Crowdsourcing with Large Language Models
Haodi Zhang | Junyu Yang | Jinyin Nie | Peirou Liang | Kaishun Wu | Defu Lian | Rui Mao | Yuanfeng Song
Proceedings of the 31st International Conference on Computational Linguistics
Haodi Zhang | Junyu Yang | Jinyin Nie | Peirou Liang | Kaishun Wu | Defu Lian | Rui Mao | Yuanfeng Song
Proceedings of the 31st International Conference on Computational Linguistics
Large language models (LLMs) have received lots of attention for their impressive performance in in-context dialogues and their potential to revolutionize service industries with a new business model, Model-as-a-Service (MaaS). Automated data labeling is a natural and promising service. However, labeling data with LLMs faces two main challenges: 1) the labels from LLMs may contain uncertainty, and 2) using LLMs for data labeling tasks can be prohibitively expensive, as the scales of datasets are usually tremendous. In this paper, we propose a hierarchical framework named LMCrowd that leverages multiple LLMs for efficient data labeling under budget constraints. The proposed LMCrowd framework first aggregates labels from multiple freely available LLMs, and then employs a large, paid MaaS LLM for relabeling selected instances. Furthermore, we formalize the core process as an optimization problem, aiming to select the optimal set of instances for relabeling by the MaaS LLM, given the current belief state. Extensive experimental evaluations across various real-world datasets demonstrate that our framework outperforms human labelers and GPT-4 in terms of both accuracy and efficiency.
MEBench: Benchmarking Large Language Models for Cross-Document Multi-Entity Question Answering
Teng Lin | Yuyu Luo | Honglin Zhang | Jicheng Zhang | Chunlin Liu | Kaishun Wu | Nan Tang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Teng Lin | Yuyu Luo | Honglin Zhang | Jicheng Zhang | Chunlin Liu | Kaishun Wu | Nan Tang
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Cross-Document Multi-entity question answering (MEQA) demands the integration of scattered information across documents to resolve complex queries involving entities, relationships, and contextual dependencies. Although Large Language Models (LLMs) and Retrieval-augmented Generation (RAG) systems show promise, their performance on cross-document MEQA remains underexplored due to the absence of tailored benchmarks. To address this gap, we introduce MEBench, a scalable multi-document, multi-entity benchmark designed to systematically evaluate LLMs’ capacity to retrieve, consolidate, and reason over scattered and dense information. Our benchmark comprises 4,780 questions which are systematically categorized into three primary categories: Comparative Reasoning, Statistical Reasoning and Relational Reasoning, further divided into eight distinct types, ensuring broad coverage of real-world multi-entity reasoning scenarios. Our experiments on state-of-the-art LLMs reveal critical limitations: even advanced models achieve only 59% accuracy on MEBench. Our benchmark emphasizes the importance of completeness and factual precision of information extraction in MEQA tasks, using Entity-Attributed F1 (EA-F1) metric for granular evaluation of entity-level correctness and attribution validity. MEBench not only highlights systemic weaknesses in current LLM frameworks but also provides a foundation for advancing robust, entity-aware QA architectures.
Search
Fix author
Co-authors
- Yuanfeng Song 2
- Haodi Zhang (张昊迪) 2
- Yufei Chen 1
- Jun Chen 1
- Tao Fan 1
- Yan Fang 1
- Mingze Kong 1
- Defu Lian 1
- Zi Liang 1
- Peirou Liang 1
- Teng Lin 1
- Yanshan Liu 1
- Zhidan Liu 1
- Chunlin Liu 1
- Yuyu Luo 1
- Wenao Ma 1
- Rui Mao 1
- Zhong Ming 1
- Jinyin Nie 1
- Zhen Sun 1
- Min Sun 1
- Nan Tang 1
- Weizheng Wang 1
- Jiaheng Wei 1
- Jiafei Wu 1
- Qipeng Xie 1
- Haiqin Yang 1
- Junyu Yang 1
- Yian Yao 1
- Hongbo Zhang 1
- Honglin Zhang 1
- Jicheng Zhang 1
- Shuxin Zhong 1
- Xinrui Zhu 1