Papers by Yanmin Zhu
HiCoLoRA: Addressing Context-Prompt Misalignment via Hierarchical Collaborative LoRA for Zero-Shot DST (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to zero-shot Dialog State Tracking (zs-DST) are inadequate to generalize to new domains without extensive training. |
| Approach: | They propose a framework that enhances zero-shot slot inference through robust prompt alignment. |
| Outcome: | Experiments on multi-domain datasets show that HiCoLoRA outperforms baselines, achieving SOTA in zs-DST. |
DarwinTOD: LLM-Driven Lifelong Self-evolution for Task-oriented Dialog Systems (2026.acl-long)
Copied to clipboard
| Challenge: | Continual learning approaches fail to achieve autonomy lifelong improvement in dynamic environments . current task-oriented dialog systems are static, unable to learn from ongoing interactions . |
| Approach: | They propose a lifelong self-evolving dialog framework that integrates evolutionary computation and LLM driven self-improvement into a single framework. |
| Outcome: | The proposed framework surpasses state-of-the-art methods and exhibits continuous performance gains throughout evolution. |
DyBBT: Dynamic Balance via Bandit-inspired Targeting for Dialog Policy with Cognitive Dual Systems (2026.acl-long)
Copied to clipboard
| Challenge: | Task oriented dialog systems often rely on static exploration strategies that do not adapt to dynamic dialog contexts. |
| Approach: | They propose a dialog policy learning framework that formalizes the exploration challenge through a structured cognitive state space C. |
| Outcome: | The proposed framework achieves SOTA performance in success rate, efficiency, and generalization. |
Can Large Language Models Tackle Graph Partitioning? (2025.emnlp-main)
Copied to clipboard
| Challenge: | Large language models (LLMs) have remarkable capabilities in understanding complex tasks, but they can only handle graph partitioning tasks that require global perception abilities. |
| Approach: | They propose a pipeline for coarsening, reasoning, and refining to enable LLMs to perform graph partitioning on small-scale graphs. |
| Outcome: | The proposed pipeline can handle graph partitioning tasks on small graphs with coarsening, reasoning, and refining. |
SpeechFake: A Large-Scale Multilingual Speech Deepfake Dataset Incorporating Cutting-Edge Generation Methods (2025.acl-long)
Copied to clipboard
| Challenge: | Existing speech deepfake datasets are limited in scale and diversity, making it challenging to train models that can generalize well to unseen deepfakkes. |
| Approach: | They propose a large-scale speech deepfake dataset that includes over 3 million deepfak samples, totaling more than 3,000 hours of audio, generated using 40 different speech synthesis tools. |
| Outcome: | The proposed dataset includes over 3 million deepfake samples, totaling more than 3,000 hours of audio, generated using 40 different speech synthesis tools. |