yunshan lv

Dr. yunshan lv

orcid

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
3 March 2025 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
YLyunshan lv
yunshan lv
HXHaiLing Xiong
HaiLing Xiong
FZFuqing Zhang
Fuqing Zhang
SDShengying Dong
Shengying Dong
XDXiangguang Dai
Xiangguang Dai
In this work, we consider the decentralized non-convex online optimization problem over an undirected network. To solve the problem over a communication-efficient manner, we propose a novel quantized decentralized adaptive momentum gradient descent algorithm based on the adaptive momentum estimation methods, where quantified information is exchanged between agents. The proposed algorithm not only can effectively reduce the data transmission volume but also contribute to improved convergence. Theoretical analysis proves that the proposed algorithm can achieve sublinear dynamic regret under appropriate step-size and quantization level, which matches the convergence of the decentralized online algorithm with exact-communication. Extensive simulations are given to demonstrate the efficacy of the algorithm.

25 January 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
YLyunshan lv
yunshan lv
HXHaiLing Xiong
HaiLing Xiong
HZHao Zhou
Hao Zhou
XGXin Guan
Xin Guan
In recent years, significant progress has been made in the field of distributed optimization algorithms. This study focused on the distributed convex optimization problem over an undirected network. The target was to minimize the average of all local objective functions known by each agent while each agent communicates necessary information only with its neighbors. Based on the state-of-the-art algorithm, we proposed a novel distributed optimization algorithm, when the objective function of each agent satisfies smoothness and strong convexity. Faster convergence can be attained by utilizing Nesterov and Heavy-ball accelerated methods simultaneously, making the algorithm widely applicable to many large-scale distributed tasks. Meanwhile, the step-sizes and accelerated momentum coefficients are designed as uncoordinate, time-varying, and nonidentical, which can make the algorithm adapt to a wide range of application scenarios. Under some necessary assumptions and conditions, through rigorous theoretical analysis, a linear convergence rate was achieved. Finally, the numerical experiments over a real dataset demonstrate the superiority and efficacy of the novel algorithm compared to similar algorithms.

3 March 2025 in Journal of the Franklin Institute
Verified
Journal Article
Closed access
YLyunshan lv
yunshan lv
HXHailing Xiong
Hailing Xiong
FZFuqing Zhang
Fuqing Zhang
SDShengying Dong
Shengying Dong