Simin Li

Simin Li

Auto-generated profile, based on publicly available information

Simin Li

Beihang University, Beijing, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
21 June 2025 in Neural Networks
Verified
Journal Article
Closed access
SLSimin Li
Simin Li
JGJun Guo
Jun Guo
JXJingqiao Xiu
Jingqiao Xiu
YZYuwei Zheng
Yuwei Zheng
PFPu Feng
Pu Feng
Xianglong LiuXianglong Liu
Xianglong Liu

29 October 2024 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
PFPu Feng
Pu Feng
RSRongye Shi
Rongye Shi
SWSize Wang
Size Wang
JLJunkang Liang
Junkang Liang
XYXin Yu
Xin Yu
Wenjun WuWenjun Wu
Wenjun Wu
Reinforcement learning (RL) has shown great promise in addressing multi-agent collision avoidance challenges. However, existing RL-based methods often suffer from low training efficiency and poor action safety. To tackle these issues, we introduce a physics-informed reinforcement learning framework equipped with two modules: a Potential Field (PF) module and a Multi-Agent Multi-Level Safety (MAMLS) module. The PF module uses the Artificial Potential Field method to compute a regularization loss, adaptively integrating it into the critic's loss to enhance training efficiency. The MAMLS module formulates action safety as a constrained optimization problem, deriving safe actions by solving this optimization. Furthermore, to better address the characteristics of multi-agent collision avoidance tasks, multi-agent multi-level constraints are introduced. The results of simulations and real-world experiments showed that our physics-informed framework offers a significant improvement in terms of both the efficiency of training and safety-related metrics over advanced baseline methods.

13 June 2006 in Nonlinearity
Verified
Journal Article
Closed access
PDF file
SLSimin Li
Simin Li
WSWeixiao Shen
Weixiao Shen
It is proved that if two Cr (r ≥ 3) S-unimodal maps without periodic or Cantor attractors are conjugate, and the conjugacy preserves the multipliers of periodic points, then the conjugacy is Cr. This solves a conjecture of Martens and de Melo.

1 October 2025 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
SLSimin Li
Simin Li
RXRuixiao Xu
Ruixiao Xu
JXJingqiao Xiu
Jingqiao Xiu
YZYuwei Zheng
Yuwei Zheng
PFPu Feng
Pu Feng
Xianglong LiuXianglong Liu
Xianglong Liu
In cooperative multi-agent reinforcement learning (MARL), ensuring robustness against cooperative agents making unpredictable or worst-case adversarial actions is crucial for real-world deployment. In multi-agent settings, each agent may be perturbed or unperturbed, leading to an exponential increase in potential threat scenarios as the number of agents grows. Existing robust MARL methods either enumerate, or approximate all possible threat scenarios, leading to intense computation and insufficient robustness. In contrast, humans develop robust behaviors by maintaining a general level of caution rather than preparing for every possible threat. Inspired by human decision making, we frame robust MARL as a control-as-inference problem, and optimize worst-case robustness across all threat scenarios implicitly optimized through off-policy evaluation. Specifically, we introduce mutual information regularization as robust regularization (MIR3), which maximizes a lower bound on robustness during routine training, serving as a kind of caution for MARL without adversarial inputs. Further insights show that MIR3 acts as an information bottleneck, preventing agents from over-reacting to others and aligning policies with robust action priors. In the presence of worst-case adversaries, our MIR3 significantly surpasses baseline methods in robustness and training efficiency, and maintaining cooperative performance in StarCraft II, quadrotor swarm control, and robot swarm control. When deploying the robot swarm control algorithm in the real world, our method also outperforms the best baseline by 14.29% in reward. See code and demo videos at https://github.com/DIG-Beihang/MIR3.

1 April 2024 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
SLSimin Li
Simin Li
HXHuangxinxin Xu
Huangxinxin Xu
JWJiakai Wang
Jiakai Wang
RXRuixiao Xu
Ruixiao Xu
Aishan LiuAishan Liu
Aishan Liu
DTDacheng Tao
Dacheng Tao
Billions of people share images from their daily lives on social media every day. However, their biometric information ( e.g ., fingerprints) could be easily stolen from these images. The threat of fingerprint leakage from social media has created a strong desire to anonymize shared images while maintaining image quality, since fingerprints act as a lifelong individual biometric password. To guard the fingerprint leakage, adversarial attack that involves adding imperceptible perturbations to fingerprint images have emerged as a feasible solution. However, existing works of this kind are either weak in black-box transferability or cause the images to have an unnatural appearance. Motivated by the visual perception hierarchy ( i.e ., high-level perception exploits model-shared semantics that transfer well across models while low-level perception extracts primitive stimuli that result in high visual sensitivity when a suspicious stimulus is provided), we propose FingerSafe, a hierarchical perceptual protective noise injection framework to address the above mentioned problems. For black-box transferability, we inject protective noises into the fingerprint orientation field to perturb the model-shared high-level semantics ( i.e ., fingerprint ridges). Considering visual naturalness, we suppress the low-level local contrast stimulus by regularizing the response of the Lateral Geniculate Nucleus. Our proposed FingerSafe is the first to provide feasible fingerprint protection in both digital (up to 94.12%) and realistic scenarios (Twitter and Facebook, up to 68.75%). Our code can be found at https://github.com/nlsde-safety-team/FingerSafe.

13 October 2025
Verified
Conference Paper
Open access
SZShuning Zhang
Shuning Zhang
YMYing Ma
Ying Ma
JCJingruo Chen
Jingruo Chen
SLSimin Li
Simin Li
XYXin Yi
Xin Yi
HLHewu Li
Hewu Li