Ruoyu Chen

Dr. Ruoyu Chen

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
24 March 2024 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
YMYing Mo
Ying Mo
JYJian Yang
Jian Yang
JLJiahao Liu
Jiahao Liu
QWQifan Wang
Qifan Wang
RCRuoyu Chen
Ruoyu Chen
ZLZhoujun Li
Zhoujun Li
Cross-lingual named entity recognition (CrossNER) faces challenges stemming from uneven performance due to the scarcity of multilingual corpora, especially for non-English data. While prior efforts mainly focus on data-driven transfer methods, a significant aspect that has not been fully explored is aligning both semantic and token-level representations across diverse languages. In this paper, we propose Multi-view Contrastive Learning for Cross-lingual Named Entity Recognition (MCL-NER). Specifically, we reframe the CrossNER task into a problem of recognizing relationships between pairs of tokens. This approach taps into the inherent contextual nuances of token-to-token connections within entities, allowing us to align representations across different languages. A multi-view contrastive learning framework is introduced to encompass semantic contrasts between source, codeswitched, and target sentences, as well as contrasts among token-to-token relations. By enforcing agreement within both semantic and relational spaces, we minimize the gap between source sentences and their counterparts of both codeswitched and target sentences. This alignment extends to the relationships between diverse tokens, enhancing the projection of entities across languages. We further augment CrossNER by combining self-training with labeled source data and unlabeled target data. Our experiments on the XTREME benchmark, spanning 40 languages, demonstrate the superiority of MCL-NER over prior data-driven and model-based approaches. It achieves a substantial increase of nearly +2.0 F1 scores across a broad spectrum and establishes itself as the new state-of-the-art performer.

9 May 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
RCRuoyu Chen
Ruoyu Chen
YFYanfang Fan
Yanfang Fan
SYShuang Yuan
Shuang Yuan
YHYanbo Hao
Yanbo Hao
Vehicular Edge Computing (VEC) is a crucial application of Mobile Edge Computing (MEC) in vehicular networks. In VEC networks, the computation tasks of vehicle terminals (VTs) can be offloaded to nearby MEC servers, overcoming the limitations of VTs’ processing power and reducing latency caused by distant cloud communication. However, a mismatch between VTs’ demanding tasks and MEC servers’ limited resources can overload MEC servers, impacting Quality of Service (QoS) for computationally intensive tasks. Additionally, vehicle mobility can disrupt communication with static MEC servers, further affecting VTs’ QoS. To address these challenges, this paper proposes a vehicle collaborative partial computation offloading model. This model allows VTs to offload tasks to two types of service nodes: collaborative vehicles and MEC servers. Factors like a vehicle’s mobility, remaining battery power, and available computational power are also considered when evaluating its suitability for collaborative offloading. Furthermore, we design a deep reinforcement learning-based strategy for collaborative partial computation offloading that minimizes overall task delay while meeting individual latency constraints. Experimental results demonstrate that compared to traditional approaches without vehicle collaboration, this scheme significantly reduces latency and achieves a significant reduction (around 2%) in the failure rate under tighter latency constraints.

21 March 2023 in Electronics
Verified
Journal Article
Open access
PDF file
LWliangguo wang
liangguo wang
RCRuoyu Chen
Ruoyu Chen
LLLi Li
Li Li
Recently, prompt-based learning has shown impressive performance on various natural language processing tasks in few-shot scenarios. The previous study of knowledge probing showed that the success of prompt learning contributes to the implicit knowledge stored in pre-trained language models. However, how this implicit knowledge helps solve downstream tasks remains unclear. In this work, we propose a knowledge-guided prompt learning method that can reveal relevant knowledge for text classification. Specifically, a knowledge prompting template and two multi-task frameworks were designed, respectively. The experiments demonstrated the superiority of combining knowledge and prompt learning in few-shot text classification.

24 August 2022 in Scientific Programming
Verified
Journal Article
Open access
PDF file
RCRuoyu Chen
Ruoyu Chen
YFYanfang Fan
Yanfang Fan
MJMengxin Jia
Mengxin Jia
SYShuang Yuan
Shuang Yuan
By offloading computation tasks, multi-access edge computing (MEC) supports diverse services and reduces delay and energy consumption of mobile devices (MDs). However, limited resources of edge servers may be the bottleneck for task computing in high-density scenarios. To address this challenge, by leveraging the underutilized resources of parked vehicles to execute tasks, we propose a parked vehicle-assisted multi-access edge computing (PV-assisted MEC) architecture, which enables MEC servers to expand their capability flexibly. To achieve efficient offloading, we propose a PV-assisted MEC offloading scheme in a multi-MD environment. We design a game-based distributed algorithm to minimize the overhead of MDs and further reduce the burden on the MEC server. Simulation results show that compared with the common MEC system, our scheme can reduce the burden on the MEC server by 5% and the offloading overhead by 17%.

15 August 2024 in Electronics
Verified
Journal Article
Open access
PDF file
RCRuoyu Chen
Ruoyu Chen
YLYan Li
Yan Li
YJYuru Jiang
Yuru Jiang
BSBochen Sun
Bochen Sun
JWJingqi Wang
Jingqi Wang
ZLZhen Li
Zhen Li
Generative text summaries often suffer from factual inconsistencies, where the summary deviates from the original text. This significantly reduces their usefulness. To address this issue, we propose a novel method for improving the factual accuracy of Chinese summaries by leveraging dependency graphs. Our approach involves analyzing the input text to build a dependency graph. This graph, along with the original text, is then processed by separate models: a Relational Graph Attention Neural Network for the dependency graph and a Transformer model for the text itself. Finally, a Transformer decoder generates the summary. We evaluate the factual consistency of the generated summaries using various methods. Experiments demonstrate that our approach improves about 7.79 points compared to the baseline Transformer model on the Chinese LCSTS dataset using ROUGE-1 metric, and 4.48 points in the factual consistency assessment model StructBERT.

5 November 2021 in Computing
Verified
Journal Article
Closed access
PDF file
XLXiulei Liu
Xiulei Liu
RCRuoyu Chen
Ruoyu Chen
QTQiang Tong
Qiang Tong
ZQZhihui Qin
Zhihui Qin
QSQinfu Shi
Qinfu Shi
Li DuanLi Duan
Li Duan