Ruichen Yao

Ruichen Yao

Auto-generated profile, based on publicly available information

Ruichen Yao

University of Illinois Urbana-Champaign, Champaign, USA

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
22 April 2025
Verified
Conference Paper
Open access
YLYifan Liu
Yifan Liu
YLYaokun Liu
Yaokun Liu
ZLZelin Li
Zelin Li
RYRuichen Yao
Ruichen Yao
YZYang Zhang
Yang Zhang
DWDong Wang
Dong Wang

27 September 2026
Verified
Conference Paper
Open access
RYRuichen Yao
Ruichen Yao
TDTejna Dasari
Tejna Dasari
GBGulshat Baispay
Gulshat Baispay
AZAizhan Zaurbek
Aizhan Zaurbek
YLYifan Liu
Yifan Liu
DWDong Wang
Dong Wang
False information spreads rapidly on social media during disasters and can undermine emergency response efforts, public trust, and crisis communication. Existing research primarily focuses on determining whether social media posts contain false information, but provides limited insight into the specific false claims embedded within posts and the severity of individual false claims. To address the limitations, we propose a two-stage framework to assess the severity of false claims during disasters. In the first stage, we develop a false claim extraction agent that identifies false claims from multimodal social media posts containing text, images, videos, and links. A subsequent verification step validates extracted claims with supporting evidence. In the second stage, we define false claim severity as the combination of two complementary dimensions: believability, which determines the likelihood that a claim will be believed, and harmfulness, which captures the potential consequences if it is believed. Human annotators assess both dimensions to construct a claim-level severity benchmark using false claims extracted from Reddit posts related to hurricanes and wildfires. Building upon this benchmark, we investigate false claim severity assessment as a human-AI alignment problem, evaluating whether models can reproduce human judgments under a shared evaluation rubric rather than merely predicting severity labels. Experiments on the benchmark show that traditional supervised models exhibit limited alignment with human judgments, whereas Large Language Models (LLMs) achieve substantially stronger performance. Among the evaluated strategies, in-context learning consistently achieves the strongest alignment with human judgments, highlighting the importance of human examples and shared decision criteria for severity assessment.



27 September 2026
Verified
Conference Paper
Open access
YLYaokun Liu
Yaokun Liu
YLYifan Liu
Yifan Liu
ZYZhenrui Yue
Zhenrui Yue
GLGyuseok Lee
Gyuseok Lee
ZLZelin Li
Zelin Li
DWDong Wang
Dong Wang

28 October 2026 in ACM Transactions on Recommender Systems
Verified
Journal Article
Open access
YLYaokun Liu
Yaokun Liu
YLYifan Liu
Yifan Liu
RYRuichen Yao
Ruichen Yao
ZLZelin Li
Zelin Li
DWDong Wang
Dong Wang
Sequential recommendation (SR) aims to predict users’ next interactions by modeling contextual patterns in their historical behavior sequences. Recent advancements in SR introduce multi-interest models that use multiple vectors to represent users’ diverse interests. However, existing methods predefine the number of interest vectors as a hyperparameter, limiting their adaptability to real-world scenarios where the number of interests varies across users. Our experiments show that this fixed-number interest representation suffers from a critical limitation: overfitting for users with simple interests, underfitting for users with complex interests, and a lack of interest prioritization. To address these limitations, we propose A daptive i nterest r epresentation learning for multi-interest Rec ommendation (AirRec), a two-stage framework that adaptively adjusts the number of interest representations for each user’s behavior sequence. Specifically, the first stage focuses on interest foundation construction: to compensate for the lack of auxiliary information, we decompose item co-occurrence data to extract atomic interests, which act as the basic units for interest representation modeling. In the second stage, we conduct user-adaptive interest modeling, retaining only atomic interests relevant to the user’s interaction history to filter out noise and infer the actual number of underlying interests. The selected atomic interests are then aggregated into personalized, adaptively sized interest representations for each user sequence. The entire process is designed for parallel computation, guaranteeing efficiency in both training and inference. Experiments on three benchmark datasets demonstrate that AirRec improves NDCG@20 by an average of 14.94% and NDCG@50 by 24.73% compared to state-of-the-art methods. The source code is available at https://github.com/yaokunliu/AirRec.git.