Liang Ran

Dr. Liang Ran


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
9 February 2024 in IEEE Transactions on Signal and Information Processing over Networks
Verified
Journal Article
Closed access
LRLiang Ran
Liang Ran
HLHuaqing Li
Huaqing Li
LZLifeng Zheng
Lifeng Zheng
JLJun Li
Jun Li
ZLZhe Li
Zhe Li
JHJinhui Hu
Jinhui Hu
This paper investigates the generalized Nash equilibria (GNE) seeking problem for noncooperative games, where all players dedicate to selfishly minimizing their own cost functions subject to local constraints and coupled constraints. To tackle the considered problem, we initially form an explicit local equilibrium condition for its variational formulation. By employing proximal splitting operators, a novel distributed primal-dual splitting algorithm with full-decision information (Dist_PDS_FuDeIn) is designed, eliminating the need for global step-sizes. Furthermore, to address scenarios where players lack access to all other players' decisions, a local estimation is introduced to approximate the decision information of other players, and a fully distributed primal-dual splitting algorithm with partial-decision information (Dist_PDS_PaDeIn) is then proposed. Both algorithms enable the derivation of new distributed forward-backward-like extensions. Theoretically, a new analytical approach for convergence is presented, demonstrating that the proposed algorithms converge to the variational GNE of games, and their convergence rates are also proven, provided that uncoordinated step-sizes are positive and less than explicit upper bounds. Moreover, the approach not only generalizes the forward-backward splitting technique but also improves convergence rates of several well-known algorithms. Finally, the advantages of Dist_PDS_FuDeIn and Dist_PDS_PaDeIn are illustrated through comparative simulations.

15 April 2025 in IEEE/CAA Journal of Automatica Sinica
Verified
Journal Article
Closed access
HLHuaqing Li
Huaqing Li
JLJun Li
Jun Li
LRLiang Ran
Liang Ran
LZLifeng Zheng
Lifeng Zheng
THTingwen Huang
Tingwen Huang
Game theory-based models and design tools have gained substantial prominence for controlling and optimizing behavior within distributed engineering systems due to the inherent distribution of decisions among individuals. In non-cooperative settings, aggregative games serve as a mathematical framework model for the interdependent optimal decision-making problem among a group of non-cooperative players. In such scenarios, each player's decision is influenced by an aggregation of all players' decisions. Nash equilibrium (NE) seeking in aggregative games has emerged as a vibrant topic driven by applications that harness the aggregation property. This paper presents a comprehensive overview of the current research on aggregative games with a focus on communication topology. A systematic classification is conducted on distributed algorithm research based on communication topologies such as undirected networks, directed networks, and time-varying networks. Furthermore, it sorts out the challenges and compares the algorithms' convergence performance. It also delves into real-world applications of distributed optimization techniques grounded in aggregative games. Finally, it proposes several challenges that can guide future research directions.

6 August 2024 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
HLHuaqing Li
Huaqing Li
LRLiang Ran
Liang Ran
LZLifeng Zheng
Lifeng Zheng
ZLZhe Li
Zhe Li
JHJinhui Hu
Jinhui Hu
THTingwen Huang
Tingwen Huang
This paper considers a class of noncooperative games in which the feasible decision sets of all players are coupled together by a coupled inequality constraint. Adopting the variational inequality formulation of the game, we first introduce a new local edge-based equilibrium condition with full information. Considering challenges when communication delays occur, we then devise an asynchronous distributed algorithm to seek a generalized Nash equilibrium. This asynchronous scheme arbitrarily activates one player to start new computations independently at different iteration instants, which means that the picked player can use the involved out-dated information from itself and its neighbors to perform new updates. In theoretical aspect, we provide explicit conditions on algorithm parameters, for instance, the step-sizes to establish a sublinear convergence rate for the synchronous version. Next, the asynchronous algorithm guarantees almost sure convergence in expectation under the same step-size conditions and some standard assumptions. Finally, the viability and performance of the proposed algorithm are demonstrated by numerical studies on the Cournot competition.

15 May 2025 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
JHJinhui Hu
Jinhui Hu
GCGuo Chen
Guo Chen
HLHuaqing Li
Huaqing Li
XGXiaoyu Guo
Xiaoyu Guo
LRLiang Ran
Liang Ran
THTingwen Huang
Tingwen Huang
Decentralized stochastic gradient algorithms efficiently solve large-scale finite-sum optimization problems when all agents in the network are reliable. However, most of these algorithms are not resilient to adverse conditions, such as malfunctioning agents, software bugs, and cyber attacks. This article aims to handle a class of general composite optimization problems over multiagent systems (MASs) in the presence of an unknown number of Byzantine agents. Building on a resilient aggregation mechanism and the proximal-gradient mapping method, a Byzantine-resilient decentralized stochastic proximal-gradient algorithmic framework is proposed, dubbed Prox-DBRO-VR, which achieves an optimization and control goal using only local computations and communications. To asymptotically reduce the noise variance arising from local gradient estimation and accelerate the convergence, we incorporate two localized variance-reduced (VR) techniques (SAGA and LSVRG) into Prox-DBRO-VR to design Prox-DBRO-SAGA and Prox-DBRO-LSVRG. By analyzing the contraction relationships among the gradient-learning error, resilient consensus condition, and convergence error in a unified theoretical framework, it is proved that both Prox-DBRO-SAGA and Prox-DBRO-LSVRG, with a well-designed constant (resp., decaying) step-size, converge linearly (resp., sublinearly) inside an error ball around the optimal solution to the original problem under standard assumptions. A tradeoff between convergence accuracy and Byzantine resilience in both linear and sublinear cases is also characterized. In numerical experiments, the effectiveness and practicability of the proposed algorithms are manifested via resolving a decentralized sparse machine learning problem under various Byzantine attacks.

9 August 2024 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
LRLiang Ran
Liang Ran
HLHuaqing Li
Huaqing Li
LZLifeng Zheng
Lifeng Zheng
JLJun Li
Jun Li
This paper focuses on a distributed nonsmooth composite optimization problem over a multiagent networked system, in which each agent is equipped with a local Lipschitz-differentiable function and two possibly nonsmooth functions, one of which incorporates a linear mapping. To address this problem, we introduce a synchronous distributed algorithm featuring uncoordinated relaxed factors. It serves as a generalized relaxed version of the recent method TriPD-Dist. Notably, the considered problem in the presence of asynchrony and delays remains relatively unexplored. In response, a new asynchronous distributed primal-dual proximal algorithm is first proposed, rooted in a comprehensive asynchronous model. It is operated under the assumption that agents utilize possibly outdated information from their neighbors, while considering arbitrary, time-varying, yet bounded delays. With some special adjustments, new asynchronous distributed extensions of existing centralized methods are obtained via the proposed asynchronous algorithm. Theoretically, a new convergence analysis technique of the proposed algorithms is provided. Specifically, a sublinear convergence rate is explicitly derived by showcasing that the iteration behaves as a nonexpansive operator. In addition, the proposed asynchronous algorithm converges the optimal solution in expectation under the same step-size conditions as its synchronous counterpart. Finally, numerical studies substantiate the efficacy of the proposed algorithms and validate their performance in practical scenarios.

13 June 2023 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
LRLiang Ran
Liang Ran
HLHuaqing Li
Huaqing Li
JHJinhui Hu
Jinhui Hu
Qingguo LüQingguo Lü
Qingguo Lü
Zheng WangZheng Wang
Zheng Wang
GCGuo Chen
Guo Chen
This paper develops a novel distributed primal-dual proximal algorithm (PDPA-Dist) and its corresponding random- ized version (Rand-PDPA-Dist) for solving convex optimization problems. The local objective consists of a smooth function and two possibly non-smooth ones, with one involving a linear map- ping. At each iteration, PDPA-Dist allows each agent to perform local computations by communicating with its neighbors, while Rand-PDPA-Dist is executed with a randomly and independently activated subset of agents. The proposed algorithms recover new distributed extensions of known centralized algorithms and existing distributed schemes, depending on certain special setups. Both PDPA-Dist and Rand-PDPA-Dist achieve exact linear convergence rates provided that local objective functions satisfy piecewise linear-quadratic or certain quadratic growth conditions. Finally, the performance and effectiveness of the proposed algorithms are demonstrated by resolving a distributed model predictive control (DMPC) problem.