Jinke Ren

Prof. Jinke Ren

orcid

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
1 August 2024
Verified
Conference Paper
Open access
PDF file
YLYijing Lin
Yijing Lin
ZGZhipeng Gao
Zhipeng Gao
HDHongyang Du
Hongyang Du
DNDusit Niyato
Dusit Niyato
GGGui Gui
Gui Gui
JRJinke Ren
Jinke Ren
In group decisions or deliberations, stakeholders are often confronted with conflicting opinions. We investigate a logic-based way of expressing such opinions and a formal general notion of a middle ground between stakeholders. Inspired by the literature on preferences with hierarchical and lexicographic models, we instantiate our general framework to the case where stakeholders express their opinions using preference statements of the form ‘I prefer ‘a’ to ‘b’’, where ‘a’ and ‘b’ are alternatives expressed over some attributes, e.g., in a trolley problem, one can express I prefer to save 1 adult and 1 child to 2 adults (and 0 children). We prove theoretical results on the existence and uniqueness of middle grounds. In particular, we show that, for preference statements, middle grounds may not exist and may not be unique. We provide algorithms for deciding the existence and finding middle grounds.

30 December 2024 in arXiv
Verified
Preprint
Open access
PDF file
RRRuntao Ren
Runtao Ren
YWYinyu Wu
Yinyu Wu
XZXuhui Zhang
Xuhui Zhang
JRJinke Ren
Jinke Ren
YSYanyan Shen
Yanyan Shen
Kim Fung TsangKim Fung Tsang
Kim Fung Tsang
The rapid evolution of mobile edge computing (MEC) has introduced significant challenges in optimizing resource allocation in highly dynamic wireless communication systems, in which task offloading decisions should be made in real-time. However, existing resource allocation strategies cannot well adapt to the dynamic and heterogeneous characteristics of MEC systems, since they are short of scalability, context-awareness, and interpretability. To address these issues, this paper proposes a novel retrieval-augmented generation (RAG) method to improve the performance of MEC systems. Specifically, a latency minimization problem is first proposed to jointly optimize the data offloading ratio, transmit power allocation, and computing resource allocation. Then, an LLM-enabled information-retrieval mechanism is proposed to solve the problem efficiently. Extensive experiments across multi-user, multi-task, and highly dynamic offloading scenarios show that the proposed method consistently reduces latency compared to several DL-based approaches, achieving 57% improvement under varying user computing ability, 86% with different servers, 30% under distinct transmit powers, and 42% for varying data volumes. These results show the effectiveness of LLM-driven solutions to solve the resource allocation problems in MEC systems.

1 June 2025 in SCIENTIA SINICA Informationis
Verified
Journal Article
Open access
PDF file
YLYijing Lin
Yijing Lin
JRJinke Ren
Jinke Ren
WANG JIACHENGWANG JIACHENG
WANG JIACHENG
NMNan Ma
Nan Ma
YZYe Zhang
Ye Zhang
SCShuguang Cui
Shuguang Cui
语义通信通过发送方和接收方共享语义知识库,从原始数据中提取核心语义信息,并传输编码后的语义信息,从而减少传输数据量,提高传输效率。在多用户语义通信中,语义知识库依赖多用户数据训练以实现精准的语义理解和传输。为保护用户隐私,联邦学习允许多用户在不共享原始数据的前提下协作训练语义知识库。然而,在协同训练过程中可能引入过时、不相关、有害等无效数据,影响多用户语义知识库的可靠性和整体通信性能。为消除无效数据的影响并维持语义知识库的可用性,需要消耗大量通信和计算资源重新协同训练语义知识库。为解决该问题,本文创新地提出一种面向多用户语义知识库的高效可信联邦遗忘方案,考虑单层多用户语义通信和多层多用户语义通信的不同层次需求,设计基于梯度上升和可信执行环境的联邦遗忘方法,在有效移除无效数据影响的同时确保语义知识库的可靠性。实验结果表明,在单层和多层的语义通信场景下,提出方案大幅减少计算开销,且在遗忘数据的识别准确率和遗忘后语义知识库的准确率上与重训练方法相当。

26 September 2025 in arXiv
Verified
Preprint
Open access
PDF file
XZXuhui Zhang
Xuhui Zhang
WLWenchao Liu
Wenchao Liu
CWChunjie Wang
Chunjie Wang
JRJinke Ren
Jinke Ren
HXHuijun Xing
Huijun Xing
YSYanyan Shen
Yanyan Shen
Fluid antenna system (FAS) is emerging as a key technology for enhancing spatial flexibility and sensing accuracy in future wireless systems. This paper investigates an unmanned aerial vehicle (UAV)-enabled FAS for multi-target wireless sensing in low-altitude wireless consumer networks (LAWCNs) for achieving the low-altitude economy (LAE) missions. We formulate an optimization problem aimed at minimizing the average Cramér-Rao bound (CRB) for multiple target estimations. To tackle this non-convex problem, an efficient alternating optimization (AO) algorithm is proposed, which jointly optimizes the UAV trajectory, the antenna position of the transmit fluid antennas (FAs) and the receive FAs, and the transmit beamforming at the UAV. Simulation results demonstrate significant performance improvements in estimation accuracy and sensing reliability compared to conventional schemes, e.g., the fixed position antenna scheme. The proposed system achieves enhanced sensing performance through adaptive trajectory design and beamforming, alongside effective interference suppression via the flexible FAS antenna repositioning, underscoring its practical potential for precision sensing in the UAV-enabled LAWCNs.

29 January 2024 in arXiv
Verified
Preprint
Open access
PDF file
YLYijing Lin
Yijing Lin
ZGZhipeng Gao
Zhipeng Gao
HDHongyang Du
Hongyang Du
DNDusit Niyato
Dusit Niyato
GGGui Gui
Gui Gui
JRJinke Ren
Jinke Ren
Federated unlearning has emerged as a promising paradigm to erase the client-level data effect without affecting the performance of collaborative learning models. However, the federated unlearning process often introduces extensive storage overhead and consumes substantial computational resources, thus hindering its implementation in practice. To address this issue, this paper proposes a scalable federated unlearning framework based on isolated sharding and coded computing. We first divide distributed clients into multiple isolated shards across stages to reduce the number of clients being affected. Then, to reduce the storage overhead of the central server, we develop a coded computing mechanism by compressing the model parameters across different shards. In addition, we provide the theoretical analysis of time efficiency and storage effectiveness for the isolated and coded sharding. Finally, extensive experiments on two typical learning tasks, i.e., classification and generation, demonstrate that our proposed framework can achieve better performance than three state-of-the-art frameworks in terms of accuracy, retraining time, storage overhead, and F1 scores for resisting membership inference attacks.

28 November 2023 in arXiv
Verified
Preprint
Open access
PDF file
RSRui Sun
Rui Sun
AZAndi Zhang
Andi Zhang
HZHaiming Zhang
Haiming Zhang
JRJinke Ren
Jinke Ren
YZYao Zhu
Yao Zhu
ZLZhen Li
Zhen Li
Out-of-distribution (OOD) detection is a crucial task for ensuring the reliability and robustness of machine learning models. Recent works have shown that generative models often assign high confidence scores to OOD samples, indicating that they fail to capture the semantic information of the data. To tackle this problem, we take advantage of sample repairing and propose a novel OOD detection framework, namely SR-OOD. Our framework leverages the idea that repairing an OOD sample can reveal its semantic inconsistency with the in-distribution data. Specifically, our framework consists of two components: a sample repairing module and a detection module. The sample repairing module applies erosion to an input sample and uses a generative adversarial network to repair it. The detection module then determines whether the input sample is OOD using a distance metric. Our framework does not require any additional data or label information for detection, making it applicable to various scenarios. We conduct extensive experiments on three image datasets: CIFAR-10, CelebA, and Pokemon. The results demonstrate that our approach achieves superior performance over the state-of-the-art generative methods in OOD detection.