Yinong Li

Yinong Li

Auto-generated profile, based on publicly available information

Yinong Li

School of Computer Science and Technology, Beijing Jiaotong University, Beijing, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
28 February 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
YLYinong Li
Yinong Li
JLJianbo Li
Jianbo Li
ZLZhiqiang Lv
Zhiqiang Lv
HLHaoran Li
Haoran Li
YWYue Wang
Yue Wang
Zhihao XuZhihao Xu
Zhihao Xu
Mobile edge computing (MEC) has become a research trend that solves effectively computationally intensive and latency-sensitive tasks. MEC environments in the real world are dynamic and uncertain and then the changes of the environments bring challenges to the generalization and robustness of offloading algorithms. In order to solve the above problem, we propose a meta-reinforcement learning task offloading algorithm GASTO based on Graph Neural Network and seq2seq network. Meta-learning can learn the optimal initialization parameter through several gradient descent steps and samples to adapt to new environments more quickly. The task generated in the user equipment is composed of multiple subtasks rather than a single task, and there are dependencies between the subtasks. Therefore, the task on the user equipment is modeled as a Directed Acyclic Graph (DAG). The connection relationship between the subtasks in DAG plays an important role. Drawing on the idea of message passing, Graph Neural Network is applied in DAG to extract the intrinsic correlation between subtasks in GASTO. In addition, Seq2Seq network can reduce the dimension of action space effectively, and the scheduling decisions of all subtasks can be generated simultaneously. Besides, in order to enhance the sampling efficiency of tasks and the robustness of GASTO, the priority of sampling tasks is adjusted dynamically during the training process. The experimental results of four algorithms in different environments show that the proposed algorithm GASTO can quickly adapt to the new environment.

24 April 2022 in Electronics
Verified
Journal Article
Open access
PDF file
YLYinong Li
Yinong Li
JLJianbo Li
Jianbo Li
JPJunjie Pang
Junjie Pang
Multi-access edge computing (MEC) enables end devices with limited computing power to provide effective solutions while dealing with tasks that are computationally challenging. When each end device in an MEC scenario generates multiple tasks, how to reasonably and effectively schedule these tasks is a large-scale discrete action space problem. In addition, how to exploit the objectively existing spatial structure relationships in the given scenario is also an important factor to be considered in task-scheduling algorithms. In this work, we consider indivisible, time-sensitive tasks under this scenario and formalize the task-scheduling problem to minimize the long-term losses. We propose a multiagent collaborative deep reinforcement learning (DRL)-based distributed scheduling algorithm based on graph attention neural networks (GATs) to solve task-scheduling problems in the MEC scenario. Each end device creates a graph representation agent to extract potential spatial features in the scenario and a scheduling agent to extract the timing-related features of the tasks and make scheduling decisions using a gated recurrent unit (GRU). The simulation results show that, compared with several baseline algorithms, our proposed algorithm can take advantage of the spatial positional relationship of devices in the environment, significantly reduce the average delay and drop rate, and improve link utilization.

24 April 2023
Verified
Book Chapter
Closed access
PDF file
YLYinong Li
Yinong Li
SFShizhen Fan
Shizhen Fan
JLJianbo Li
Jianbo Li
CDChuanhao Dong
Chuanhao Dong

4 December 2025 in IEEE Transactions on Networking
Verified
Journal Article
Closed access
YLYinong Li
Yinong Li
DDDing Ding
Ding Ding
Huamao XieHuamao Xie
Huamao Xie
LZLihong Zhao
Lihong Zhao
YJYaqing Jin
Yaqing Jin
ZFZiyun Fang
Ziyun Fang
Multi-agent reinforcement learning provides promising prospect for task scheduling in cloud-edge computing environment in recent years. However, there remains a formidable challenge due to partial observation and the rigid coupling between action spaces and schedulable devices. These limit the ability of agent to perceive global communication patterns and adapt to dynamic environments, resulting in unsatisfactory scheduling decisions. To address these issues, this work proposes SPAD, a novel spatial perception and action decoupling empowered distributed multi-agent AI task scheduling framework. By constructing a global spatial feature distillation mechanism, SPAD can approximate the implicit heterogeneous connection patterns and communication dynamics between devices and tasks under constrained observability, enhancing its ability to make robust decisions in dynamic environments with limited observations. Additionally, SPAD employs a Lyapunov-based action decoupling module to alleviate scalability challenges from rigid action-device coupling, while a novel intrinsic penalty mechanism augments the agent’s advantage function with the instantaneous Lyapunov cost, thereby aligning the policy optimization process with the decoupling module’s underlying stability constraints. Through a comprehensive empirical evaluation spanning synthetic, bursty, and real-world trace-driven workloads, we show that SPAD consistently outperforms state-of-the-art benchmarks in reducing task completion latency and improving resource utilization, while maintaining remarkable resilience and scalability across diverse network topologies and under non-stationary load conditions.