Jiarui Jin

Jiarui Jin

Auto-generated profile, based on publicly available information

Jiarui Jin

Xiaohongshu Inc., Shanghai, 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
21 October 2024
Verified
Conference Paper
Open access
YLYifan Liu
Yifan Liu
KZKangning Zhang
Kangning Zhang
XRXiangyuan Ren
Xiangyuan Ren
YHYanhua Huang
Yanhua Huang
JJJiarui Jin
Jiarui Jin
WZWeinan Zhang
Weinan Zhang
With the development of multimedia systems, multimodal recommendations are playing an essential role, as they can leverage rich contexts beyond interactions. Existing methods mainly regard multimodal information as an auxiliary, using them to help learn ID features; However, there exist semantic gaps among multimodal content features and ID-based features, for which directly using multimodal information as an auxiliary would lead to misalignment in representations of users and items. In this paper, we first systematically investigate the misalignment issue in multimodal recommendations, and propose a solution named AlignRec. In AlignRec, the recommendation objective is decomposed into three alignments, namely alignment within contents, alignment between content and categorical ID, and alignment between users and items. Each alignment is characterized by a specific objective function and is integrated into our multimodal recommendation framework. To effectively train AlignRec, we propose starting from pre-training the first alignment to obtain unified multimodal features and subsequently training the following two alignments together with these features as input. As it is essential to analyze whether each multimodal feature helps in training and accelerate the iteration cycle of recommendation models, we design three new classes of metrics to evaluate intermediate performance. Our extensive experiments on three real-world datasets consistently verify the superiority of AlignRec compared to nine baselines. We also find that the multimodal features generated by AlignRec are better than currently used ones, which are to be open-sourced in our repository https://github.com/sjtulyf123/AlignRec_CIKM24.

21 April 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
MYMengyue Yang
Mengyue Yang
GCGuohao Cai
Guohao Cai
FLFurui Liu
Furui Liu
JJJiarui Jin
Jiarui Jin
ZDZhenhua Dong
Zhenhua Dong
XCXu Chen
Xu Chen
Debiased recommendation has recently attracted increasing attention from both industry and academic communities. Traditional models mostly rely on the inverse propensity score (IPS), which can be hard to estimate and may suffer from the high variance issue. To alleviate these problems, in this article, we propose a novel debiased recommendation framework based on user feature balancing. The general idea is to introduce a projection function to adjust user feature distributions, such that the ideal unbiased learning objective can be upper bounded by a solvable objective purely based on the offline dataset. In the upper bound, the projected user distributions are expected to be equal given different items. From the causal inference perspective, this requirement aims to remove the causal relation from the user to the item, which enables us to achieve unbiased recommendation, bypassing the computation of IPS. To efficiently balance the user distributions upon each item pair, we propose three strategies, including clipping, sampling, and adversarial learning to improve the training process. For more robust optimization, we deploy an explicit model to capture the potential latent confounders in recommendation systems. To the best of our knowledge, this article is the first work on debiased recommendation based on confounder balancing. In the experiments, we compare our framework with many state-of-the-art methods based on synthetic, semi-synthetic, and real-world datasets. Extensive experiments demonstrate that our model is effective in promoting the recommendation performance.

24 August 2024
Verified
Conference Paper
Open access
QLQingyao Li
Qingyao Li
WXWei Xia
Wei Xia
LYLi'ANg Yin
Li'ANg Yin
JJJiarui Jin
Jiarui Jin
YYYong Yu
Yong Yu
Educational recommendation seeks to suggest knowledge concepts that match a learner's ability, thus facilitating a personalized learning experience. In recent years, reinforcement learning (RL) methods have achieved considerable results by taking the encoding of the learner's exercise log as the state and employing an RL-based agent to make suitable recommendations. However, these approaches suffer from handling the diverse and dynamic learner's knowledge states. In this paper, we introduce the privileged feature distillation technique and propose the P rivileged K nowledge S tate D istillation (PKSD ) framework, allowing the RL agent to leverage the "actual'' knowledge state as privileged information in the state encoding to help tailor recommendations to meet individual needs. Concretely, our PKSD takes the privileged knowledge states together with the representations of the exercise log for the state representations during training. And through distillation, we transfer the ability to adapt to learners to aknowledge state adapter. During inference, theknowledge state adapter would serve as the estimated privileged knowledge states instead of the real one since it is not accessible. Considering that there are strong connections among the knowledge concepts in education, we further propose to collaborate the graph structure learning for concepts into our PKSD framework. This new approach is termed GEPKSD (Graph-Enhanced PKSD). As our method is model-agnostic, we evaluate PKSD and GEPKSD by integrating them with five different RL bases on four public simulators, respectively. Our results verify that PKSD can consistently improve the recommendation performance with various RL methods, and our GEPKSD could further enhance the effectiveness of PKSD in all the simulations.

12 April 2026
Verified
Conference Paper
Open access
XLXiaoxi Li
Xiaoxi Li
WJWenxiang Jiao
Wenxiang Jiao
JJJiarui Jin
Jiarui Jin
GDGuanting Dong
Guanting Dong
JJJiajie Jin
Jiajie Jin
ZDZhicheng Dou
Zhicheng Dou

31 July 2024 in ACM Transactions on Recommender Systems
Verified
Journal Article
Open access
LZLei Zheng
Lei Zheng
HCHuacan Chai
Huacan Chai
XCXianyu Chen
Xianyu Chen
JJJiarui Jin
Jiarui Jin
WZWeinan Zhang
Weinan Zhang
ZFZiming Feng
Ziming Feng
Extending from sequential recommendation models, in this article, we present a novel framework named Search-based Time-Aware Recommendation (STARec), which first retrieves the historical behaviors of the given user through a search-based retriever and then captures the user’s evolving demands over time through a time-aware sequential network. We notice that the key insight of STARec is to use the feature and labels to augment the representations, and thus the effectiveness of STARec relies on the acquisition of rich browsing records of the target user and powerful representation of each browsed item and thus its performance could heavily drop regarding long-tail users and items. To this end, we extend STARec by constructing a graph upon the user–item interactions and leveraging the graph structure to enhance the representation learning. We call this extended version Search-based Time-Aware Graph-Enhanced Recommendation (STAGE). We conduct extensive experiments on three real-world datasets and STARec achieves consistent superiority. We further compare STAGE against STARec long-tail users and our results demonstrate that STAGE could outperform STARec at most cases. Results of online A/B tests show that STARec and STAGE achieve an average click-through rate improvement of around 6% and 1.5% in the two main item recommendation scenarios, respectively. 1

13 May 2024
Verified
Conference Paper
Open access
JJJiarui Jin
Jiarui Jin
ZHZexue He
Zexue He
MYMengyue Yang
Mengyue Yang
WZWeinan Zhang
Weinan Zhang
YYYong Yu
Yong Yu
JMJulian J. McAuley
Julian J. McAuley
Ranking items regarding individual user interests is a core technique of multiple downstream tasks such as recommender systems. Learning such a personalized ranker typically relies on the implicit feedback from users' past click-through behaviors. However, collected feedback is biased toward previously highly-ranked items and directly learning from it would result in "rich-get-richer" phenomena. In this paper, we propose a simple yet sufficient unbiased learning-to-rank paradigm named InfoRank that aims to simultaneously address both position and popularity biases. We begin by consolidating the impacts of those biases into a single observation factor, thereby providing a unified approach to addressing bias-related issues. Subsequently, we minimize the mutual information between the observation estimation and the relevance estimation conditioned on the input features. By doing so, our relevance estimation can be proved to be free of bias. To implement InfoRank, we first incorporate an attention mechanism to capture latent correlations within user-item features, thereby generating estimations of observation and relevance. We then introduce a regularization term, grounded in conditional mutual information, to promote conditional independence between relevance estimation and observation estimation. Experimental evaluations conducted across three extensive recommendation and search datasets reveal that InfoRank learns more precise and unbiased ranking strategies.