Shenglin Yin

Shenglin Yin

Auto-generated profile, based on publicly available information

Shenglin Yin

School of Computer Science, Peking University, Beijing, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 October 2021 in Computer Networks
Verified
Journal Article
Closed access
SYSheng-Lin Yin
Sheng-Lin Yin
XZXing-Lan Zhang
Xing-Lan Zhang
SLShuo Liu
Shuo Liu

22 April 2025
Verified
Conference Paper
Open access
MSMingxuan Song
Mingxuan Song
PLPengze Li
Pengze Li
BZBohan Zhou
Bohan Zhou
SYShenglin Yin
Shenglin Yin
ZXZhen Xiao
Zhen Xiao
JLJieyi Long
Jieyi Long

4 August 2023
Verified
Conference Paper
Open access
MXMingzhe Xing
Mingzhe Xing
HMHangyu Mao
Hangyu Mao
SYShenglin Yin
Shenglin Yin
LPLichen Pan
Lichen Pan
ZZZhengchao Zhang
Zhengchao Zhang
JLJieyi Long
Jieyi Long
Public cloud GPU clusters are becoming emerging platforms for training distributed deep learning jobs. Under this training paradigm, the job scheduler is a crucial component to improve user experiences, i.e., reducing training fees and job completion time, which can also save power costs for service providers. However, the scheduling problem is known to be NP-hard. Most existing work divides it into two easier sub-tasks, i.e., ordering task and placement task, which are responsible for deciding the scheduling orders of jobs and placement orders of GPU machines, respectively. Due to the superior adaptation ability, learning-based policies can generally perform better than traditional heuristic-based methods. Nevertheless, there are still two main challenges that have not been well-solved. First, most learning-based methods only focus on ordering or placement policy independently, while ignoring their cooperation. Second, the unbalanced machine performances and resource contention impose huge overhead and uncertainty on job duration, but rarely be considered in existing work. To tackle these issues, this paper presents a dual-agent scheduler framework abstracted from the two sub-tasks to jointly learn the ordering and placement policies and make better-informed scheduling decisions. Specifically, we design an ordering agent with a scalable squeeze-and-communicate strategy for better cooperation; for the placement agent, we propose a novel Random Walk Gaussian Process to learn the performance similarities of GPU machines while being aware of the uncertain performance fluctuation. Finally, the dual-agent is jointly optimized with multi-agent reinforcement learning. Extensive experiments conducted on the real-world production cluster trace demonstrate the superiority of our model.

30 July 2021 in International Journal of Theoretical Physics
Verified
Journal Article
Closed access
PDF file
XZXing-Lan Zhang
Xing-Lan Zhang
LZLi-Yu Zuo
Li-Yu Zuo
SYSheng-Lin Yin
Sheng-Lin Yin

28 October 2024
Verified
Conference Paper
Open access
SYShenglin Yin
Shenglin Yin
KYKelu Yao
Kelu Yao
ZXZhen Xiao
Zhen Xiao
JLJieyi Long
Jieyi Long
Existing adversarial example defense methods are static, meaning they remain unchanged once training is completed, regardless of how attack methods change. Consequently, static defense methods are highly vulnerable to adaptive attacks. We argue that to counter more formidable attacks, models should continually adapt to various attack methods. We propose a novel dynamic defense approach. Initially, we use Gaussian Mixture Models (GMM) to obtain structural information of the data, which is combined with model prediction information to generate pseudo-labels for optimizing inputs. Subsequently, we employ information maximization and enhanced mean predictions as optimization objectives, utilizing a hierarchical optimization approach to refine the model. Meanwhile, we propose a sample-efficient optimization strategy that reduces the total number of samples in the test data stream for reverse updating and improves the efficiency. Notably, our method can be directly applied to pre-trained models without the need for accessing training data or retraining the model. Therefore, our approach is training-data-agnostic and model-agnostic, easily applicable to existing adversarially trained models, significantly enhancing the resilience of various models against white-box, black-box, and adaptive attacks across diverse datasets. We have conducted extensive experiments to validate the state-of-the-art of our proposed method. The pseudo-code can be found in the appendix.