Mushui Liu

Dr. Mushui Liu


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 April 2025 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
MLMushui Liu
Mushui Liu
YMYuhang Ma
Yuhang Ma
ZYZhen Yang
Zhen Yang
JDJun Dan
Jun Dan
YYYunlong Yu
Yunlong Yu
CFChangjie Fan
Changjie Fan
Diffusion models have exhibited substantial success in text-to-image generation. However, they often encounter challenges when dealing with complex and dense prompts involving multiple objects, attribute binding, and long descriptions. In this paper, we propose a novel framework called LLM4GEN, which enhances the semantic understanding of text-to-image diffusion models by leveraging the representation of Large Language Models (LLMs). It can be seamlessly incorporated into various diffusion models as a plug-and-play component. A specially designed Cross-Adapter Module (CAM) integrates the original text features of text-to-image models with LLM features, thereby enhancing text-to-image generation. Additionally, to facilitate and correct entity-attribute relationships in text prompts, we develop an entity-guided regularization loss to further improve generation performance. We also introduce DensePrompts, which contains 7,000 dense prompts to provide a comprehensive evaluation for the text-to-image generation task. Experiments indicate that LLM4GEN significantly improves the semantic alignment of SD1.5 and SDXL, demonstrating increases of 9.69% and 12.90% in color on T2I-CompBench, respectively. Moreover, it surpasses existing models in terms of sample quality, image-text alignment, and human evaluation.

4 June 2025 in Knowledge-Based Systems
Verified
Journal Article
Closed access
MLMushui Liu
Mushui Liu
BLBozheng Li
Bozheng Li
JDJun Dan
Jun Dan
ZLZiqian Lu
Ziqian Lu
ZWZhao Wang
Zhao Wang
YYYunlong Yu
Yunlong Yu

28 October 2024
Verified
Conference Paper
Open access
JDJun Dan
Jun Dan
WLWeiming Liu
Weiming Liu
MLMushui Liu
Mushui Liu
CXChunfeng Xie
Chunfeng Xie
SDShunjie Dong
Shunjie Dong
JXJiazheng Xing
Jiazheng Xing
Semi-supervised graph domain adaptation, as a subfield of graph transfer learning, seeks to precisely annotate unlabeled target graph nodes by leveraging transferable features acquired from the limited labeled source nodes. However, most existing studies often directly utilize graph convolutional networks (GCNs)-based feature extractors to capture domain-invariant node features, while neglecting the issue that GCNs are insufficient in collecting complex structure information in graph. Considering the importance of graph structure information in encoding the complex relationship among nodes and edges, this paper aims to utilize such powerful information to assist graph transfer learning. To achieve this goal, we develop a novel framework called HOGDA. Concretely, HOGDA introduces a high-order structure information mixing (HSIM) module to effectively capture abundant structure information in graph, greatly enhancing the feature extractor's ability to adapt across different domains. Moreover, to achieve fine-grained feature distributions alignment, a novel strategy called adaptive weighted domain alignment (AWDA) is proposed to dynamically adjust the node weight during adversarial domain adaptation process, effectively boosting the model's transfer ability. Furthermore, to mitigate the overfitting phenomenon caused by limited source labeled nodes, we also design a trust-aware node clustering (TNC) strategy to guide the unlabeled nodes to achieve discriminative clustering. Extensive experimental results show that our HOGDA outperforms the state-of-the-art methods on various transfer tasks.

27 November 2024
Verified
Book Chapter
Closed access
PDF file
ZLZiqian Lu
Ziqian Lu
FSFengli Shen
Fengli Shen
MLMushui Liu
Mushui Liu
YYYunlong Yu
Yunlong Yu
XLXi Li
Xi Li

30 December 2024 in Neural Networks
Verified
Journal Article
Closed access
MLMushui Liu
Mushui Liu
WHWeijie He
Weijie He
ZLZiqian Lu
Ziqian Lu
JDJun Dan
Jun Dan
YYYunlong Yu
Yunlong Yu
JHJungong Han
Jungong Han

6 December 2023 in arXiv
Verified
Preprint
Open access
PDF file
MLMushui Liu
Mushui Liu
WHWeijie He
Weijie He
ZLZiqian Lu
Ziqian Lu
YYYunlong Yu
Yunlong Yu
Prompt learning is a powerful technique for transferring Vision-Language Models (VLMs) such as CLIP to downstream tasks. However, the prompt-based methods that are fine-tuned solely with base classes may struggle to generalize to novel classes in open-vocabulary scenarios, especially when data are limited. To address this issue, we propose an innovative approach called SYNC-CLIP that leverages SYNthetiC data for enhancing the generalization capability of CLIP. Based on the observation of the distribution shift between the real and synthetic samples, we treat real and synthetic samples as distinct domains and propose to optimize separate domain prompts to capture domain-specific information, along with the shared visual prompts to preserve the semantic consistency between two domains. By aligning the cross-domain features, the synthetic data from novel classes can provide implicit guidance to rebalance the decision boundaries. Experimental results on three model generalization tasks demonstrate that our method performs very competitively across various benchmarks. Notably, SYNC-CLIP outperforms the state-of-the-art competitor PromptSRC by an average improvement of 3.0% on novel classes across 11 datasets in open-vocabulary scenarios.