CZChuang Zhao

Chuang Zhao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Chuang Zhao has a total of 48 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Enhancing Protein Representation Learning via Manifold Restore Mixing

    by Yizhou Dang, Chuang Zhao, Lianbo Ma, Guibing Guo, Xingwei Wang, Zhu Sun

    Data augmentation (DA) has been proven to be an effective means for improving protein representation learning (PRL) by generating additional training samples. Although mainstream perturbation- and sampling-based augmentation methods can produce data containing sufficient variations, they carry the risk of disrupting the protein structure and function. Some crafted protein homology modeling tools can generate conformations, but reduce structural diversity. The above dilemmas lead us to a question: Can we restore the disrupted structure caused by DA operations, providing data with both the original structure and diverse variations? In this work, we first analyze and empirically reveal the structure defect and performance degradation issues of existing DA methods. Based on the findings, we propose a simple yet effective DA method, Manifold Restore Mixing (MRM), for protein representation learning. Specifically, inspired by manifold mixup, we mix the hidden representations of original and augmented protein data to generate new samples that restore structural information lost in DA while introducing diverse variations. Furthermore, we develop a sample difficulty scheduler that adjusts the beta distribution in mixup to provide models with progressively challenging mixed samples during training, which improves the final performance. Comprehensive experiments on various PRL backbones and downstream tasks demonstrate the effectiveness and generalization of our method. The complete code and weights will be released upon acceptance. We provide a implementation at https://github.com/KingGugu/MRM.

  • Open Access

    Pay Attention to Sequence Split: Uncovering the Impacts of Sub-Sequence Splitting on Sequential Recommendation Models

    by Yizhou Dang, Yifan Wu, Minhan Huang, Chuang Zhao, Lianbo Ma, Guibing Guo, Xingwei Wang, Zhu Sun


  • Multi-scale asymmetric graph contrastive anomaly detection

    by Wenxin Zhang, Xi Xuan, Guangzhen Yao, Renda Han, Chuang Zhao, Xiangxiang Lang, Feng Zhou, Cuicui Luo


  • Rational or Emotional? Next-Item Recommendations in Virtual Games via Disentangling Players’ Needs

    by Hongke Zhao, Chuang Zhao, Runze Wu, Yong Ge

    Virtual games have become a prominent cultural, social, and economic phenomenon, captivating millions of players globally, which stimulates intelligent services, like recommendations, with strong real evidence of enabling platforms to optimize operational management, enhance user satisfaction, and drive revenue growth. Even though traditional recommender systems that rely on modeling user preferences have achieved great success in commerce, they commonly model users’ purchase behavior with a unified preference representation, which has limitations for capturing users’ diverse intrinsic purchase motivations. In this paper, we therefore conduct a study that focuses on designing a recommender system for virtual games. We argue that purchases in virtual games are mainly motivated by both rational needs and emotional needs, with the former reflecting a player’s practical need to improve their ability for a specific game campaign (e.g., attack, defense) and the latter being more of a psychological preference (e.g., color, style). We design a framework called RERec that discriminately learns representations of the two types of motivations via distinct architectures and features a better-supervised optimization that is oriented toward the entire process rather than specific items. For its rational needs module, RERec employs a unique time-gating mechanism to perceive the temporal impacts of campaigns on players’ volatile rational needs. A heterogeneous item-taxonomy graph is also used as prior knowledge of similarity among items to accelerate convergence. On the other hand, because a player’s emotional preferences are relatively stable over a short period, RERec employs a hierarchical attention mechanism to capture the comprehensiveness and focus of the player’s emotional needs. RERec also incorporates player attributes to enhance the personalized emotional need representations. Extensive experiments and analyses on large-scale real-world data sets from both a well-known game company and the public benchmarks fully demonstrate RERec’s superiority in specific respects as well as its effectiveness. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: This study was partially funded by the National Natural Science Foundation of China [Grants 72101176 and 72471165] and Emerging Frontiers Cultivation Program of Tianjin University Interdisciplinary Center. Supplemental Material: The online appendix is available at https://doi.org/10.1287/ijoc.2025.1179 . The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1179 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1179 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

  • Code and Data Repository for Rational or Emotional? Next-item Recommendations in Virtual Games via Disentangling Players' Needs

    by Hongke Zhao, Chuang Zhao, Runze Wu, Yong Ge

    We make a contribution to the game recommendation literature by decoupling purchase sequences into two heterogeneous motivations to be modeled, i.e., rational needs and emotional needs, based on data observations and consumption motivation theory.


  • Open Access

    GANPrompt: Improving LLM-Based Recommendations with GAN-Enhanced Diversity Prompts

    by Xinyu Li, Chuang Zhao, Hongke Zhao, Likang Wu, Ming He, Jianping Fan

    Large Language Models (LLMs) have demonstrated remarkable proficiency in understanding and generating natural language, with an increasing presence in the field of recommendation systems. However, LLMs still encounter a significant issue known as prompt sensitivity, where the model’s output is susceptible to minor changes in the input prompt. This challenge is particularly problematic in recommendation systems, which rely on stable and consistent outputs. Fine-tuning LLMs with diverse prompts can reduce prompt sensitivity but also lead to a decline in recommendation performance. Therefore, choosing an effective fine-tuning method is important to achieve enhanced robustness without sacrificing performance. To address prompt sensitivity while maintaining recommendation performance, we propose Generative Adversarial Network-based prompt enhancement (GANPrompt), a framework for improving LLM-based recommendation systems using adversarial game theory. In this framework, the generator and discriminator compete to produce diverse prompts, which are then used to fine-tune LLM-based recommendation systems, enhancing both robustness and accuracy. Specifically, to generate diverse prompts for fine-tuning and enhance the robustness of LLMs, we develop a GAN-based generator for diverse prompts, with an attribute generation module providing the foundational data support. Further, we introduce a diversity constraint to ensure that the generated prompts maintain high diversity while preserving semantic consistency. To maintain accuracy during the fine-tuning process, we introduce an explicit guidance knowledge token integration method. This method reduces noise and information loss in the face of diverse prompts by enhancing the use of traditional collaborative signals. Through extensive experiments on four publicly available datasets and one real-world industrial dataset, we demonstrate the effectiveness of the proposed framework. Our source code is available at https://github.com/LxytIUON/GANPrompt .


  • Enhancing Domain Generalization in Medical Image Segmentation With Global and Local Prompts

    by Chuang Zhao, Xiaomeng Li

    Enhancing domain generalization (DG) is a crucial and compelling research pursuit within the field of medical image segmentation, owing to the inherent heterogeneity observed in medical images. The recent success with large-scale pre-trained vision models (PVMs), such as Vision Transformer (ViT), inspires us to explore their application in this specific area. While a straightforward strategy involves fine-tuning the PVM using supervised signals from the source domains, this approach overlooks the domain shift issue and neglects the rich knowledge inherent in the instances themselves. To overcome these limitations, we introduce a novel framework enhanced by global and local prompts (GLPs). Specifically, to adapt PVM in the medical DG scenario, we explicitly separate domain-shared and domain-specific knowledge in the form of GLPs. Furthermore, we develop an individualized domain adapter to intricately investigate the relationship between each target domain sample and the source domains. To harness the inherent knowledge within instances, we devise two innovative regularization terms from both the consistency and anatomy perspectives, encouraging the model to preserve instance discriminability and organ position invariance. Extensive experiments and in-depth discussions in both vanilla and semi-supervised DG scenarios deriving from five diverse medical datasets consistently demonstrate the superior segmentation performance achieved by GLP. Our code and datasets are publicly available at https://github.com/xmed-lab/GLP.