Chao Zhang

Chao Zhang

Auto-generated profile, based on publicly available information

Chao Zhang

City University of Hong Kong, Hong Kong, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
20 July 2025
Verified
Conference Paper
Open access
CZChao Zhang
Chao Zhang
HZHaoxin Zhang
Haoxin Zhang
SWShiwei Wu
Shiwei Wu
DWDi Wu
Di Wu
Tong XuTong Xu
Tong Xu
ECEnhong Chen
Enhong Chen

13 May 2024
Verified
Conference Paper
Open access
CZChao Zhang
Chao Zhang
SWShiwei Wu
Shiwei Wu
HZHaoxin Zhang
Haoxin Zhang
Tong XuTong Xu
Tong Xu
YGYan Gao
Yan Gao
ECEnhong Chen
Enhong Chen
People enjoy sharing "notes" including their experiences within online communities. Therefore, recommending notes aligned with user interests has become a crucial task. Existing online methods only input notes into BERT-based models to generate note embeddings for assessing similarity. However, they may underutilize some important cues, e.g., hashtags or categories, which represent the key concepts of notes. Indeed, learning to generate hashtags/categories can potentially enhance note embeddings, both of which compress key note information into limited content. Besides, Large Language Models (LLMs) have significantly outperformed BERT in understanding natural languages. It is promising to introduce LLMs into note recommendation. In this paper, we propose a novel unified framework called NoteLLM, which leverages LLMs to address the item-to-item (I2I) note recommendation. Specifically, we utilize Note Compression Prompt to compress a note into a single special token, and further learn the potentially related notes' embeddings via a contrastive learning approach. Moreover, we use NoteLLM to summarize the note and generate the hashtag/category automatically through instruction tuning. Extensive validations on real scenarios demonstrate the effectiveness of our proposed method compared with the online baseline and show major improvements in the recommendation system of Xiaohongshu.

21 October 2023
Verified
Conference Paper
Open access
CZChao Zhang
Chao Zhang
FWFangzhao Wu
Fangzhao Wu
JYJingwei Yi
Jingwei Yi
DXDerong Xu
Derong Xu
YYYang Yu
Yang Yu
ECEnhong Chen
Enhong Chen
Federated learning (FL) is important for privacy-preserving services by training models without collecting raw user data. Most FL algorithms assume all data is annotated, which is impractical due to the high cost of labeling data in real applications. To alleviate the reliance on labeled data, semi-supervised federated learning (SSFL) has been proposed to utilize unlabeled data on clients to improve model performance. However, most existing methods either have privacy issues which share models trained on other clients, or generate pseudo-labels for unlabeled local datasets with the global model, which is usually biased towards the global data distribution. The latter may lead to sub-optimal accuracy of pseudo-labels, due to the gap between the local data distribution and the global model, especially in non-IID settings. In this paper, we propose a semi-supervised heterogeneous federated learning method with local knowledge enhancement, called FedLoKe, which aims to train an accurate global model from both labeled and unlabeled local data with non-IID distributions. Specifically, in FedLoKe, the server maintains a global model to capture global data distribution, and each client learns a local model to capture local data distribution. Since the distribution captured by the local model is aligned with the local data distribution, we utilize it to generate high-accuracy pseudo-labels of the unlabeled dataset for global model training. To prevent the local model from severely overfitting the small number of local labeled data, we further use the exponential moving average and apply the global model to generate pseudo-labels for local modeling training. Experiments on four datasets show the effectiveness of FedLoKe. Our code is available at: https://github.com/zcfinal/FedLoKe.

20 May 2025 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
PQPenggang Qin
Penggang Qin
Tong XuTong Xu
Tong Xu
CZChao Zhang
Chao Zhang
HWHeda Wang
Heda Wang
YHYao Hu
Yao Hu
ECEnhong Chen
Enhong Chen
Recently, audiences have increasingly watched diverse dramas and movies on streaming platforms, prompting platform administrators to enhance their understanding of video semantics. In particular, capturing and interpreting social relations among characters is critical for content-driven intelligent services and enhancing user experience. However, most existing research has solely approached social relations recognition as a classification problem, without justifiable interpretation of prediction results within the video context. To address this issue, we study cognitive science research and the Chain-of-Thought (CoT) strategy. Based on these foundations, we propose SaMo-CoT, an approach that leverages large language models (LLMs) in step-by-step reasoning. This approach simulates human cognitive processes by combining social scenarios in videos and incorporating empirical social interaction knowledge. In this way, we enable verbal rationales for determining social relations in video understanding. Furthermore, we present an innovative doubly-right social relation recognition framework that predicts both correct social relation labels and correct scenario rationales. Specifically, we translate verbal CoT into multimodal CoT by leveraging scenario-aware prompts and contrastive learning. Extensive experiments demonstrate significant improvements in classification accuracy and interpretability compared to traditional approaches.

1 April 2019
Verified
Conference Paper
Closed access
RHRunqi Han
Runqi Han
CZChao Zhang
Chao Zhang
Big data technology to analyze transportation problems has become reliable and effective. Optimizing urban traffic by improving transportation organization has always been the focus of attention in the field of transportation. In order to deeply study the urban traffic saving that can be brought by the overlapping transportation organization, this paper relies on big data technology, scientific modeling, and combines big data analysis technology with traditional traffic four-stage method to quantify important indicators. At the same time, based on big data and simulation technology, the station carrying capacity and waiting organization capacity are discussed, which provides the basis for implementing the overlapping transportation organization plan.

13 June 2026 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
CZChao Zhang
Chao Zhang
YWYuhao Wang
Yuhao Wang
DXDerong Xu
Derong Xu
HZHaoxin Zhang
Haoxin Zhang
YLYuanjie Lyu
Yuanjie Lyu
ECEnhong Chen
Enhong Chen
Retrieval-Augmented Generation (RAG) utilizes external knowledge to augment Large Language Models’ (LLMs) reliability. For flexibility, agentic RAG employs autonomous, multi-round retrieval and reasoning to resolve queries. Although recent agentic RAG has improved via reinforcement learning, they often incur substantial token overhead from search and reasoning. This trade-off prioritizes accuracy over efficiency. To address this issue, this work proposes TeaRAG, a T oken- e fficient a gentic RAG framework capable of compressing both retrieval content and reasoning steps. 1) First, the retrieved content is compressed by augmenting chunk-based semantic retrieval with a graph retrieval using concise triplets. A knowledge association graph is then built from semantic similarity and co-occurrence. Finally, Personalized PageRank is leveraged to highlight key knowledge within this graph, reducing the number of tokens per retrieval. 2) Besides, to reduce reasoning steps, Iterative Process-aware Direct Preference Optimization (IP-DPO) is proposed. Specifically, our reward function evaluates the knowledge sufficiency by a knowledge matching mechanism, while penalizing excessive reasoning steps. This design can produce high-quality preference-pair datasets, supporting iterative DPO to improve reasoning conciseness. Across six datasets, improves the average Exact Match by \(4\%\) and \(2\%\) while reducing output tokens by \(61\%\) and \(59\%\) on Llama3‑8B‑Instruct and Qwen2.5‑14B‑Instruct, respectively. Code is available at https://github.com/Applied-Machine-Learning-Lab/TeaRAG .