Chen Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chen Wang has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Philip S. Yu
University of Illinois Chicago
14 shared publications - Zhiwei Liu
Salesforce AI Research, Palo Alto, CA, USA
14 shared publications - Liangwei Yang
University of Illinois Chicago, Chicago, IL, USA
11 shared publications - Mingdai Yang
University of Illinois Chicago, USA
11 shared publications - Xiaolong Liu
University of Illinois Chicago, Chicago, IL, USA
9 shared publications - Hao Peng
Beihang University, Beijing, China
8 shared publications
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 6211-6222
AMOS: Active Mining with Observable Steps for Agenda-Driven Review Knowledge Discovery
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 6211-6222
Open AccessAMOS: Active Mining with Observable Steps for Agenda-Driven Review Knowledge Discovery
- Open Access
- 22 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 154-158
AGP: Auto-Guided Prompt Refinement for Personalized Reranking in Recommender Systems
Reranking plays a critical role in recommendation systems by refining initial predictions to better reflect user preferences. While large language models (LLMs) have shown promise in enhancing reranking through contextual reasoning, they still rely heavily on manually crafted prompts—an approach that is both labor-intensive and difficult to scale. Although prompt optimization has been studied in domains like question answering and news recommendation, its adaptation to general item recommendation remains limited due to the unstructured and inconsistent nature of item metadata. To address these challenges, we propose Auto-Guided Prompt Refinement (AGP), a novel framework that automatically refines user profile generation prompts instead of reranking prompts directly. AGP leverages position-based feedback, which encodes item-level ranking misalignments, and introduces batched training with aggregated feedback to ensure robust and generalizable prompt updates. Experimental results on Amazon Movies & TV, Yelp, and Goodreads demonstrate AGP's effectiveness. With only 100 training users, AGP improves NDCG@10 by 5.61%, 2.46%, and 6.18% when reranking SASRec, and by 9.36%, 7.98%, and 20.68% when reranking LightGCN. These results highlight AGP's potential as a scalable, automated solution for LLM-based personalized reranking. Code: https://github.com/ChenMetanoia/AGP
- 22 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 154-158
Open AccessAGP: Auto-Guided Prompt Refinement for Personalized Reranking in Recommender Systems
Reranking plays a critical role in recommendation systems by refining initial predictions to better reflect user preferences. While large language models (LLMs) have shown promise in enhancing reranking through contextual reasoning, they still rely heavily on manually crafted prompts—an approach that is both labor-intensive and difficult to scale. Although prompt optimization has been studied in domains like question answering and news recommendation, its adaptation to general item recommendation remains limited due to the unstructured and inconsistent nature of item metadata. To address these challenges, we propose Auto-Guided Prompt Refinement (AGP), a novel framework that automatically refines user profile generation prompts instead of reranking prompts directly. AGP leverages position-based feedback, which encodes item-level ranking misalignments, and introduces batched training with aggregated feedback to ensure robust and generalizable prompt updates. Experimental results on Amazon Movies & TV, Yelp, and Goodreads demonstrate AGP's effectiveness. With only 100 training users, AGP improves NDCG@10 by 5.61%, 2.46%, and 6.18% when reranking SASRec, and by 9.36%, 7.98%, and 20.68% when reranking LightGCN. These results highlight AGP's potential as a scalable, automated solution for LLM-based personalized reranking. Code: https://github.com/ChenMetanoia/AGP
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 888-892
Graph-Sequential Alignment and Uniformity: Toward Enhanced Recommendation Systems
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 888-892
Open AccessGraph-Sequential Alignment and Uniformity: Toward Enhanced Recommendation Systems
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1470-1474
Training Large Recommendation Models via Graph-Language Tokens Alignment
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1470-1474
Open AccessTraining Large Recommendation Models via Graph-Language Tokens Alignment
- Open Access
Automating Personalization: Prompt Optimization for Recommendation Reranking
Modern recommender systems increasingly leverage large language models (LLMs) for reranking to improve personalization. However, existing approaches face two key limitations: (1) heavy reliance on manually crafted prompts that are difficult to scale, and (2) inadequate handling of unstructured item metadata that complicates preference inference. We present AGP (Auto-Guided Prompt Refinement), a novel framework that automatically optimizes user profile generation prompts for personalized reranking. AGP introduces two key innovations: (1) position-aware feedback mechanisms for precise ranking correction, and (2) batched training with aggregated feedback to enhance generalization.
Open AccessAutomating Personalization: Prompt Optimization for Recommendation Reranking
Modern recommender systems increasingly leverage large language models (LLMs) for reranking to improve personalization. However, existing approaches face two key limitations: (1) heavy reliance on manually crafted prompts that are difficult to scale, and (2) inadequate handling of unstructured item metadata that complicates preference inference. We present AGP (Auto-Guided Prompt Refinement), a novel framework that automatically optimizes user profile generation prompts for personalized reranking. AGP introduces two key innovations: (1) position-aware feedback mechanisms for precise ranking correction, and (2) batched training with aggregated feedback to enhance generalization.
- Open Access
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 2315-2325
Collaborative Alignment for Recommendation
Traditional recommender systems have primarily relied on identity representations (IDs) to model users and items. Recently, the integration of pre-trained language models (PLMs) has enhanced the capability to capture semantic descriptions of items. However, while PLMs excel in few-shot, zero-shot, and unified modeling scenarios, they often overlook the crucial signals from collaborative filtering (CF), resulting in suboptimal performance when sufficient training data is available. To effectively combine semantic representations with the CF signal and enhance recommender system performance in both warm and cold settings, two major challenges must be addressed: (1) bridging the gap between semantic and collaborative representation spaces, and (2) refining while preserving the integrity of semantic representations. In this paper, we introduce CARec, a novel model that adeptly integrates collaborative filtering signals with semantic representations, ensuring alignment within the semantic space while maintaining essential semantics. We present experimental results from four real-world datasets, which demonstrate significant improvements. By leveraging collaborative alignment, CARec also shows remarkable effectiveness in cold-start scenarios, achieving notable enhancements in recommendation performance. The code is available at https://github.com/ChenMetanoia/CARec **REMOVE 2nd URL**://github.com/ChenMetanoia/CARec.
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 2315-2325
Open AccessCollaborative Alignment for Recommendation
Traditional recommender systems have primarily relied on identity representations (IDs) to model users and items. Recently, the integration of pre-trained language models (PLMs) has enhanced the capability to capture semantic descriptions of items. However, while PLMs excel in few-shot, zero-shot, and unified modeling scenarios, they often overlook the crucial signals from collaborative filtering (CF), resulting in suboptimal performance when sufficient training data is available. To effectively combine semantic representations with the CF signal and enhance recommender system performance in both warm and cold settings, two major challenges must be addressed: (1) bridging the gap between semantic and collaborative representation spaces, and (2) refining while preserving the integrity of semantic representations. In this paper, we introduce CARec, a novel model that adeptly integrates collaborative filtering signals with semantic representations, ensuring alignment within the semantic space while maintaining essential semantics. We present experimental results from four real-world datasets, which demonstrate significant improvements. By leveraging collaborative alignment, CARec also shows remarkable effectiveness in cold-start scenarios, achieving notable enhancements in recommendation performance. The code is available at https://github.com/ChenMetanoia/CARec **REMOVE 2nd URL**://github.com/ChenMetanoia/CARec.
- Open Access
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 2970-2979
Pre-Training with Transferable Attention for Addressing Market Shifts in Cross-Market Sequential Recommendation
Cross-market recommendation (CMR) involves selling the same set of items across multiple nations or regions within a transfer learning framework. However, CMR's distinctive characteristics, including limited data sharing due to privacy policies, absence of user overlap, and a shared item set between markets present challenges for traditional recommendation methods. Moreover, CMR experiences market shifts, leading to differences in item popularity and user preferences among different markets. This study focuses on cross-market sequential recommendation (CMSR) and proposes the Cross-market Attention Transferring with Sequential Recommendation (CAT-SR) framework to address these challenges and market shifts. CAT-SR incorporates a pre-training strategy emphasizing item-item correlation, selective self-attention transferring for effective transfer learning, and query and key adapters for market-specific user preferences. Experimental results on real-world cross-market datasets demonstrate the superiority of CAT-SR, and ablation studies validate the benefits of its components across different geographical continents. CAT-SR offers a robust and adaptable solution for cross-market sequential recommendation. The code is available at https://github.com/ChenMetanoia/CATSR-KDD/.
- 24 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 2970-2979
Open AccessPre-Training with Transferable Attention for Addressing Market Shifts in Cross-Market Sequential Recommendation
Cross-market recommendation (CMR) involves selling the same set of items across multiple nations or regions within a transfer learning framework. However, CMR's distinctive characteristics, including limited data sharing due to privacy policies, absence of user overlap, and a shared item set between markets present challenges for traditional recommendation methods. Moreover, CMR experiences market shifts, leading to differences in item popularity and user preferences among different markets. This study focuses on cross-market sequential recommendation (CMSR) and proposes the Cross-market Attention Transferring with Sequential Recommendation (CAT-SR) framework to address these challenges and market shifts. CAT-SR incorporates a pre-training strategy emphasizing item-item correlation, selective self-attention transferring for effective transfer learning, and query and key adapters for market-specific user preferences. Experimental results on real-world cross-market datasets demonstrate the superiority of CAT-SR, and ablation studies validate the benefits of its components across different geographical continents. CAT-SR offers a robust and adaptable solution for cross-market sequential recommendation. The code is available at https://github.com/ChenMetanoia/CATSR-KDD/.
- Open Access
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 501-511
Instruction-based Hypergraph Pretraining
Pretraining has been widely explored to augment the adaptability of graph learning models to transfer knowledge from large datasets to a downstream task, such as link prediction or classification. However, the gap between training objectives and the discrepancy between data distributions in pretraining and downstream tasks hinders the transfer of the pre-trained knowledge. Inspired by instruction-based prompts widely used in pre-trained language models, we introduce instructions into graph pertaining. In this paper, we propose a novel pretraining framework named Instruction-based Hypergraph Pretraining. To overcome the discrepancy between pretraining and downstream tasks, text-based instructions provide explicit guidance on specific tasks for representation learning. Compared to learnable prompts, whose effectiveness depends on the quality and diversity of training data, text-based instructions intrinsically encapsulate task information and support the model's generalization beyond the structure seen during pretraining. To capture high-order relations with task information in a context-aware manner, a novel prompting hypergraph convolution layer is devised to integrate instructions into information propagation in hypergraphs. Extensive experiments conducted on three public datasets verify the superiority of IHP in various scenarios.
- 10 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 501-511
Open AccessInstruction-based Hypergraph Pretraining
Pretraining has been widely explored to augment the adaptability of graph learning models to transfer knowledge from large datasets to a downstream task, such as link prediction or classification. However, the gap between training objectives and the discrepancy between data distributions in pretraining and downstream tasks hinders the transfer of the pre-trained knowledge. Inspired by instruction-based prompts widely used in pre-trained language models, we introduce instructions into graph pertaining. In this paper, we propose a novel pretraining framework named Instruction-based Hypergraph Pretraining. To overcome the discrepancy between pretraining and downstream tasks, text-based instructions provide explicit guidance on specific tasks for representation learning. Compared to learnable prompts, whose effectiveness depends on the quality and diversity of training data, text-based instructions intrinsically encapsulate task information and support the model's generalization beyond the structure seen during pretraining. To capture high-order relations with task information in a context-aware manner, a novel prompting hypergraph convolution layer is devised to integrate instructions into information propagation in hypergraphs. Extensive experiments conducted on three public datasets verify the superiority of IHP in various scenarios.
- Open Access
- 4 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 891-900
Unified Pretraining for Recommendation via Task Hypergraphs
Although pretraining has garnered significant attention and popularity in recent years, its application in graph-based recommender systems is relatively limited. It is challenging to exploit prior knowledge by pretraining in widely used ID-dependent datasets. On the one hand, user-item interaction history in one dataset can hardly be transferred to other datasets through pretraining, where IDs are different. On the other hand, pretraining and finetuning on the same dataset leads to a high risk of overfitting. In this paper, we propose a novel multitask pretraining framework named Unified Pretraining for Recommendation via Task Hypergraphs. For a unified learning pattern to handle diverse requirements and nuances of various pretext tasks, we design task hypergraphs to generalize pretext tasks to hyperedge prediction. A novel transitional attention layer is devised to discriminatively learn the relevance between each pretext task and recommendation. Experimental results on three benchmark datasets verify the superiority of UPRTH. Additional detailed investigations are conducted to demonstrate the effectiveness of the proposed framework.
- 4 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 891-900
Open AccessUnified Pretraining for Recommendation via Task Hypergraphs
Although pretraining has garnered significant attention and popularity in recent years, its application in graph-based recommender systems is relatively limited. It is challenging to exploit prior knowledge by pretraining in widely used ID-dependent datasets. On the one hand, user-item interaction history in one dataset can hardly be transferred to other datasets through pretraining, where IDs are different. On the other hand, pretraining and finetuning on the same dataset leads to a high risk of overfitting. In this paper, we propose a novel multitask pretraining framework named Unified Pretraining for Recommendation via Task Hypergraphs. For a unified learning pattern to handle diverse requirements and nuances of various pretext tasks, we design task hypergraphs to generalize pretext tasks to hyperedge prediction. A novel transitional attention layer is devised to discriminatively learn the relevance between each pretext task and recommendation. Experimental results on three benchmark datasets verify the superiority of UPRTH. Additional detailed investigations are conducted to demonstrate the effectiveness of the proposed framework.
- Open Access
- 4 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 462-471
Knowledge Graph Context-Enhanced Diversified Recommendation
The field of Recommender Systems (RecSys) has been extensively studied to enhance accuracy by leveraging users' historical interactions. Nonetheless, this persistent pursuit of accuracy frequently engenders diminished diversity, culminating in the well-recognized "echo chamber" phenomenon. Diversified RecSys has emerged as a countermeasure, placing diversity on par with accuracy and garnering noteworthy attention from academic circles and industry practitioners. This research explores the diversified RecSys within the intricate context of knowledge graphs (KG). These KGs act as repositories of interconnected information concerning entities and items, offering a propitious avenue to amplify recommendation diversity through the incorporation of insightful contextual information. Our contributions include introducing an innovative metric, Entity Coverage, and Relation Coverage, which effectively quantifies diversity within the KG domain. Additionally, we introduce the Diversified Embedding Learning (DEL) module, meticulously designed to formulate user representations that possess an innate awareness of diversity. In tandem with this, we introduce a novel technique named Conditional Alignment and Uniformity (CAU). It adeptly encodes KG item embeddings while preserving contextual integrity. Collectively, our contributions signify a substantial stride towards augmenting the panorama of recommendation diversity within the KG-informed RecSys paradigms.
- 4 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 462-471
Open AccessKnowledge Graph Context-Enhanced Diversified Recommendation
The field of Recommender Systems (RecSys) has been extensively studied to enhance accuracy by leveraging users' historical interactions. Nonetheless, this persistent pursuit of accuracy frequently engenders diminished diversity, culminating in the well-recognized "echo chamber" phenomenon. Diversified RecSys has emerged as a countermeasure, placing diversity on par with accuracy and garnering noteworthy attention from academic circles and industry practitioners. This research explores the diversified RecSys within the intricate context of knowledge graphs (KG). These KGs act as repositories of interconnected information concerning entities and items, offering a propitious avenue to amplify recommendation diversity through the incorporation of insightful contextual information. Our contributions include introducing an innovative metric, Entity Coverage, and Relation Coverage, which effectively quantifies diversity within the KG domain. Additionally, we introduce the Diversified Embedding Learning (DEL) module, meticulously designed to formulate user representations that possess an innate awareness of diversity. In tandem with this, we introduce a novel technique named Conditional Alignment and Uniformity (CAU). It adeptly encodes KG item embeddings while preserving contextual integrity. Collectively, our contributions signify a substantial stride towards augmenting the panorama of recommendation diversity within the KG-informed RecSys paradigms.