Xuhao Zhao

Xuhao Zhao

Auto-generated profile, based on publicly available information

Xuhao Zhao

Shanghai Jiao Tong University, Shanghai, China, China

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
4 March 2024
Verified
Conference Paper
Open access
WMWenze Ma
Wenze Ma
YWYuexian Wang
Yuexian Wang
Yanmin ZhuYanmin Zhu
Yanmin Zhu
ZWZhaobo Wang
Zhaobo Wang
MJMengyuan Jing
Mengyuan Jing
FTFeilong Tang
Feilong Tang
Graph-based social recommendation improves the prediction accuracy of recommendation by leveraging high-order neighboring information contained in social relations. However, most of them ignore the problem that social relations can be noisy for recommendation. Several studies attempt to tackle this problem by performing social graph denoising, but they suffer from 1) adaptability issues for other graph-based social recommendation models and 2) insufficiency issues for user social representation learning. To address the limitations, we propose a model-agnostic graph denoising module (denoted as MADM) which works as a plug-and-play module to provide refined social structure for base models. Meanwhile, to propel user social representations to be minimal and sufficient for recommendation, MADM further employs mutual information maximization (MIM) between user social representations and the interaction graph and realizes two ways of MIM: contrastive learning and forward predictive learning. We provide theoretical insights and guarantees from the perspectives of Information Theory and Multi-view Learning to explain its rationality. Extensive experiments on three real-world datasets demonstrate the effectiveness of MADM.

20 July 2025
Verified
Conference Paper
Open access
CZChenhao Zhai
Chenhao Zhai
CMChang Meng
Chang Meng
YYYu Yang
Yu Yang
KZKexin Zhang
Kexin Zhang
XZXuhao Zhao
Xuhao Zhao
XLXiu Li
Xiu Li

21 October 2023
Verified
Conference Paper
Open access
XZXuhao Zhao
Xuhao Zhao
Yanmin ZhuYanmin Zhu
Yanmin Zhu
CWChunyang Wang
Chunyang Wang
MJMengyuan Jing
Mengyuan Jing
JYJiadi Yu
Jiadi Yu
FTFeilong Tang
Feilong Tang
User cold-start recommendation is one of the most challenging problems that limit the effectiveness of recommender systems. Meta-learning-based methods are introduced to address this problem by learning initialization parameters for cold-start tasks. Recent studies attempt to enhance the initialization methods. They first represent each task by the cold-start user and interacted items. Then they distinguish tasks based on the task relevance to learn adaptive initialization. However, this manner is based on the assumption that user preferences can be reflected by the interacted items saliently, which is not always true in reality. In addition, we argue that previous approaches suffer from their adaptive framework (e.g., adaptive initialization), which reduces the adaptability in the process of transferring meta-knowledge to personalized RSs. In response to the issues, we propose a task-difficulty-aware meta-learning with adaptive update strategies (TDAS) for user cold-start recommendation. First, we design a task difficulty encoder, which can represent user preference salience, task relevance, and other task characteristics by modeling task difficulty information. Second, we adopt a novel framework with task-adaptive local update strategies by optimizing the initialization parameters with task-adaptive per-step and per-layer hyperparameters. Extensive experiments based on three real-world datasets demonstrate that our TDAS outperforms the state-of-the-art methods. The source code is available at https://github.com/XuHao-bit/TDAS.

13 July 2025
Verified
Conference Paper
Open access
XZXuhao Zhao
Xuhao Zhao
ZZZhongrui Zhang
Zhongrui Zhang
Yanmin ZhuYanmin Zhu
Yanmin Zhu
ZWZhaobo Wang
Zhaobo Wang
WMWenze Ma
Wenze Ma
FTFeilong Tang
Feilong Tang

9 July 2025 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
XZXuhao Zhao
Xuhao Zhao
Yanmin ZhuYanmin Zhu
Yanmin Zhu
CWChunyang Wang
Chunyang Wang
MJMengyuan Jing
Mengyuan Jing
WMWenze Ma
Wenze Ma
FTFeilong Tang
Feilong Tang
User cold-start recommendation presents a significant challenge for recommender systems, affecting their overall effectiveness. Meta-learning-based methods have been introduced to address this issue. These methods treat the user cold-start recommendation problem as a few-shot learning task, where each user represents a unique task. The objective is to acquire shared initialization parameters that can be effectively applied across all cold-start users. Subsequently, these shared parameters are fine-tuned into personalized parameters using individual interaction data. Recent studies argue that shared parameters are unsuitable for all users with an implicit grouping distribution of user preference. Therefore, they propose adaptive-initialization-based methods, which first differentiate tasks based on user preferences and then generate task-adaptive initialization parameters using task representations. However, both the meta-learning and adaptive-initialization-based manners ignore discovering the adaptive capability of update strategies in the process of transferring initialization parameters to personalized parameters. Instead, they rely on task-shared optimization strategies, leading the model to fall into an overfitting or underfitting situation. In response to this, we propose a dual-adaptive update strategies enhanced meta-optimization framework (DAUS) for user cold-start recommendation. 1 First, we integrate dual-adaptive update strategies to enhance the adaptive capability of transferring initialization parameters. This involves incorporating both task-adaptive optimization hyperparameters and objectives. Second, we design a multifaceted task encoder , which can provide diverse task information to differentiate between tasks, including explicit task features (task relevance, training signals, etc.) and other implicit task information. Extensive experiments based on three real-world datasets demonstrate that our DAUS outperforms the state-of-the-art methods. The source code is available at https://github.com/XuHao-bit/DAUS .