Shengze Li

Dr. Shengze Li


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
31 December 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
Haojie LianHaojie Lian
Haojie Lian
PSPengfei Sun
Pengfei Sun
ZMZhuxuan MENG
Zhuxuan MENG
SLShengze Li
Shengze Li
PWPeng Wang
Peng Wang
YQYilin Qu
Yilin Qu
LIDAR is central to the perception systems of autonomous vehicles, but its performance is sensitive to adverse weather. An object detector trained by deep learning with the LIDAR point clouds in clear weather is not able to achieve satisfactory accuracy in adverse weather. Considering the fact that collecting LIDAR data in adverse weather like dusty storms is a formidable task, we propose a novel data augmentation framework based on physical simulation. Our model takes into account finite laser pulse width and beam divergence. The discrete dusty particles are distributed randomly in the surrounding of LIDAR sensors. The attenuation effects of scatters are represented implicitly with extinction coefficients. The coincidentally returned echoes from multiple particles are evaluated by explicitly superimposing their power reflected from each particle. Based on the above model, the position and intensity of real point clouds collected from dusty weather can be modified. Numerical experiments are provided to demonstrate the effectiveness of the method.

22 February 2023 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
HJHao Jiang
Hao Jiang
SLShengze Li
Shengze Li
JZJieyuan Zhang
Jieyuan Zhang
YZYuqi Zhu
Yuqi Zhu
XXXinhai Xu
Xinhai Xu
DLDonghong Liu
Donghong Liu
In the complex tasks environment, efficient state feature learning is a key factor to improve the performance of the agent’s policy. When encountering a similar new environment, reinforcement learning agents usually need to learn from scratch. However, humans naturally have a common sense of the environment and are able to use prior knowledge to extract environmental state features. Although the prior knowledge may not be fully applicable to the new environment, it is able to speed up the learning process of the state feature. Taking this inspiration, we propose an artificial potential field-based reinforcement learning (APF-RL) method. The method consists of an artificial potential field state feature abstractor (APF-SA) and an artificial potential field intrinsic reward model (APF-IR). The APF-SA can introduce human knowledge to accelerate the learning process of the state feature. The APF-IR can generate an intrinsic reward to reduce the invalid exploration and guide the learning of the agent’s policy. We conduct experiments on PySC2 with different mini-games. The experimental results show that the APF-RL method achieves improvement in the learning efficiency compared to the benchmarks.

17 July 2024 in Neural Networks
Verified
Journal Article
Open access
SLShengze Li
Shengze Li
HJHao Jiang
Hao Jiang
YLYuntao Liu
Yuntao Liu
JZJieyuan Zhang
Jieyuan Zhang
XXXinhai Xu
Xinhai Xu
DLDonghong Liu
Donghong Liu
Multi-agent reinforcement learning (MARL) effectively improves the learning speed of agents in sparse reward tasks with the guide of subgoals. However, existing works sever the consistency of the learning objectives of the subgoal generation and subgoal reached stages, thereby significantly inhibiting the effectiveness of subgoal learning. To address this problem, we propose a novel Potential field Subgoal-based Multi-Agent reinforcement learning (PSMA) method, which introduces the potential field (PF) to unify the two-stage learning objectives. Specifically, we design a state-to-PF representation model that describes agents' states as potential fields, allowing easy measurement of the interaction effect for both allied and enemy agents. With the PF representation, a subgoal selector is designed to automatically generate multiple subgoals for each agent, drawn from the experience replay buffer that contains both individual and total PF values. Based on the determined subgoals, we define an intrinsic reward function to guide the agent to reach their respective subgoals while maximizing the joint action-value. Experimental results show that our method outperforms the state-of-the-art MARL method on both StarCraft II micro-management (SMAC) and Google Research Football (GRF) tasks with sparse reward settings.

19 April 2025 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
HJHao Jiang
Hao Jiang
GWGongju Wang
Gongju Wang
SLShengze Li
Shengze Li
JZJieyuan Zhang
Jieyuan Zhang
LYLong Yan
Long Yan
XXXinhai Xu
Xinhai Xu
The large action space is a key challenge in reinforcement learning. Although hierarchical methods have been proven to be effective in addressing this issue, they are not fully explored. This paper combines domain knowledge with hierarchical concepts to propose a novel Hierarchical Reinforcement Learning framework based on macro actions (HRL-MA). This framework includes a macro action mapping model that abstracts sequences of micro actions into macro actions, thereby simplifying the decision-making process. Macro actions are divided into two categories: combat macro actions (CMA) and non-combat macro actions (NO-CMA). NO-CMA are driven by decision tree-based logical rules and provide conditions for the execution of CMA. CMA form the action space of the reinforcement learning algorithm, which dynamically selects actions based on the current state. Comprehensive tests on the StarCraft II maps Simple64 and AbyssalReefLE demonstrate that the HRL-MA framework exhibits superior performance, achieving higher win rates compared to baseline algorithms. Furthermore, in mini-game scenarios, HRL-MA consistently outperforms baseline algorithms in terms of reward scores. The findings highlight the effectiveness of integrating hierarchical structures and macro actions in reinforcement learning to manage complex decision-making tasks in environments with large action spaces.

29 November 2025 in arXiv
Verified
Preprint
Open access
PDF file
GZGuangjie Zeng
Guangjie Zeng
HPHao Peng
Hao Peng
ALAngsheng Li
Angsheng Li
LSLi Sun
Li Sun
CLChunyang Liu
Chunyang Liu
PYPhilip S. Yu
Philip S. Yu
Hierarchical clustering is a fundamental machine-learning technique for grouping data points into dendrograms. However, existing hierarchical clustering methods encounter two primary challenges: 1) Most methods specify dendrograms without a global objective. 2) Graph-based methods often neglect the significance of graph structure, optimizing objectives on complete or static predefined graphs. In this work, we propose Hyperbolic Continuous Structural Entropy neural networks, namely HypCSE, for structure-enhanced continuous hierarchical clustering. Our key idea is to map data points in the hyperbolic space and minimize the relaxed continuous structural entropy (SE) on structure-enhanced graphs. Specifically, we encode graph vertices in hyperbolic space using hyperbolic graph neural networks and minimize approximate SE defined on graph embeddings. To make the SE objective differentiable for optimization, we reformulate it into a function using the lowest common ancestor (LCA) on trees and then relax it into continuous SE (CSE) by the analogy of hyperbolic graph embeddings and partitioning trees. To ensure a graph structure that effectively captures the hierarchy of data points for CSE calculation, we employ a graph structure learning (GSL) strategy that updates the graph structure during training. Extensive experiments on seven datasets demonstrate the superior performance of HypCSE.

24 April 2026 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
XLXin Liu
Xin Liu
GWGuanlin Wu
Guanlin Wu
SLShengze Li
Shengze Li
YLYu Liu
Yu Liu
YLYuan Li
Yuan Li
XLXiong Li
Xiong Li