Changyu Li

Changyu Li

Auto-generated profile, based on publicly available information

Changyu Li

University of Electronic Science and Technology of China, Chengdu, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 April 2021
Verified
Conference Paper
Closed access
ZDZhiyi Deng
Zhiyi Deng
CLChangyu Li
Changyu Li
SLShujin Liu
Shujin Liu
WAWaqar Ali
Waqar Ali
JSJie Shao
Jie Shao
Nowadays, going out and participating in group activities is an indispensable part of human life, and group recommendation systems are needed to provide suggestions. In practice, group recommendation faces serious sparsity issues due to the lack of group-item interaction data, and the key challenge is to aggregate group member preference for group decision making. Conventional group recommendations applied a predefined strategy to aggregate the preferences of group members, which cannot model the group decision making process and do not address the data sparsity problem well. In this paper, we introduce knowledge graph into group recommendation as side information, and propose a novel end-to-end method named knowledge graph-based attentive group recommendation (KGAG) to solve the data sparsity and preference aggregation problems. Specifically, a graph convolution network (GCN) is employed to capture abundant structure information of items and users in knowledge graph to overcome the sparsity problem. Besides, to learn knowledge-aware group representation for inferring the group decision better, we capture the user-item connectivity and user-user connectivity in knowledge graph, and then adopt attention mechanism to learn the influence of each member according to user-user interaction in group and the candidate item, for member preference aggregation. Additionally, the attention mechanism can provide interpretability to group recommendation. Moreover, we extend the margin loss to our KGAG which forces the prediction score of positive item to be a distance larger than that of negative item. Experimental results show the superiority of the proposed KGAG and verify the efficacy of each component of KGAG.

17 October 2021
Verified
Conference Paper
Open access
DZDongyang Zhang
Dongyang Zhang
CLChangyu Li
Changyu Li
NXNing Xie
Ning Xie
Guoqing WangGuoqing Wang
Guoqing Wang
JSJie Shao
Jie Shao
Recently, convolutional neural network (CNN) has been the core ingredient of modern models, triggering the surge of deep learning in super-resolution (SR). Despite the great success of these CNN-based methods which are prone to be deeper and heavier, it is impracticable to directly apply these methods for some low-budget devices due to the superfluous computational overhead. To alleviate this problem, a novel lightweight SR network named progressive feature fusion network (PFFN) is developed to seek for better balance between performance and running efficiency. Specifically, to fully exploit the feature maps, a novel progressive attention block (PAB) is proposed as the main building block of PFFN. The proposed PAB adopts several parallel but connected paths with pixel attention, which could significantly increase the receptive field of each layer, distill useful information and finally learn more discriminative feature representations. In PAB, a powerful dual attention module (DAM) is further incorporated to provide the channel and spatial attention mechanism in fairly lightweight manner. Besides, we construct a pretty concise and effective upsampling module with the help of multi-scale pixel attention, named MPAU. All of the above modules ensure the network can benefit from attention mechanism while still being lightweight enough. Furthermore, a novel training strategy following the cosine annealing learning scheme is proposed to maximize the representation ability of the model. Comprehensive experiments show that our PFFN achieves the best performance against all existing lightweight state-of-the-art SR methods with less number of parameters and even performs comparably to computationally expensive networks.

8 October 2024
Verified
Conference Paper
Open access
YJYuezihan Jiang
Yuezihan Jiang
CLChangyu Li
Changyu Li
GCGaode Chen
Gaode Chen
PLPeiyi Li
Peiyi Li
QZQi Zhang
Qi Zhang
WZWentao Zhang
Wentao Zhang
Multi-view Graph Learning is popular in recommendations due to its ability to capture relationships and connections across multiple views. Existing multi-view graph learning methods generally involve constructing graphs of views and performing information aggregation on view representations. Despite their effectiveness, they face two data limitations: Multi-focal Multi-source data noise and multi-source Data Sparsity. The former arises from the combination of noise from individual views and conflicting edges between views when information from all views is combined. The latter occurs because multi-view learning exacerbate the negative influence of data sparsity because these methods require more model parameters to learn more view information. Motivated by these issues, we propose MMGCL, a meta knowledge-enhanced multi-view graph contrastive learning framework for recommendations. To tackle the data noise issue, MMGCL extract meta knowledge to preserve important information from all views to form a meta view representation. It then rectifies every view in multi-learning frameworks, thus simultaneously removing the view-private noisy edges and conflicting edges across different views. To address the data sparsity issue, MMGCL performs meta knowledge transfer contrastive learning optimization on all views to reduce the searching space for model parameters and add more supervised signal. Besides, we have deployed MMGCL in a real industrial recommender system in China, and we further evaluate it on three benchmark datasets and a practical industry online application. Extensive experiments on these datasets demonstrate the state-of-the-art recommendation performance of MMGCL.

12 June 2023
Verified
Conference Paper
Open access
KHKun He
Kun He
CLChangyu Li
Changyu Li
JSJie Shao
Jie Shao
Recently, super-resolution (SR) performance has been improved by the stereo images since the beneficial information could be provided by another view. Transformer has shown significant performance gains for computer vision tasks, while it needs huge computing resources and training time. To alleviate this problem, we introduce an efficient Transformer feature extraction block, which can efficiently capture long-range pixel interactions with lower resource consumption. There are many kinds of cross-view interaction modules for stereo image SR, and they all have limitations of SR performance in their own models. To address the aforementioned challenge, we first propose the strong-weak cross-view interaction mechanism, which consists of strong cross-view interaction module and weak cross-view interaction module. Benefiting from the proposed mechanism, the SR performance can be improved significantly with a negligible increment of computing cost. We integrate the efficient Transformer feature extraction module and the strong-weak cross-view interaction mechanism into a unified framework named strong-weak cross-view interaction network (SWCVIN), and extensive experiments on three benchmark datasets show the proposed model achieves state-of-the-art results.

3 November 2025 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
MWMeng Wang
Meng Wang
CLChangyu Li
Changyu Li
FCFeiyu Chen
Feiyu Chen
JSJie Shao
Jie Shao
KQKe Qin
Ke Qin
SLShuang Liang
Shuang Liang
Multimodal knowledge graphs (MMKGs) have gained widespread adoption across various domains. However, existing transformer-based methods for MMKG representation learning primarily focus on enhancing representation performance, while overlooking time and memory costs, which reduces model efficiency. To tackle these limitations, we introduce a multimodal lightweight transformer (MLFormer) model, which not only ensures robust representation capabilities but also considerably improves computational efficiency. We find that the self-attention mechanism in transformers leads to substantial performance overheads. As a result, we optimize the traditional MMKGE model in two aspects: modality processing and modality fusion, by incorporating a filter gate and Fourier transform. Our experimental results on real-world multimodal knowledge graph completion datasets demonstrate that MLFormer achieves significant improvements in computational efficiency while maintaining competitive performance.