Gehui Xu

Gehui Xu

Auto-generated profile, based on publicly available information

Gehui Xu

Department of Electrical and Electronic Engineering, Imperial College London, London, U.K.

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
30 May 2022 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
GXGehui Xu
Gehui Xu
GCGuanpu Chen
Guanpu Chen
HQHongsheng Qi
Hongsheng Qi
Yiguang HongYiguang Hong
Yiguang Hong
In this article, we aim to design a distributed approximate algorithm for seeking Nash equilibria (NE) of an aggregative game. Due to the local set constraints of each player, projection-based algorithms have been widely employed for solving such problems actually. Since it may be quite hard to get the exact projection in practice, we utilize inscribed polyhedrons to approximate local set constraints, which yields a related approximate game model. We first prove that the NE of the approximate game is the $\epsilon $ -NE of the original game and then propose a distributed algorithm to seek the $\epsilon $ -NE, where the projection is then of a standard form in quadratic optimization with linear constraints. With the help of the existing developed methods for solving quadratic optimization, we show the convergence of the proposed algorithm and also discuss the computational cost issue related to the approximation. Furthermore, based on the exponential convergence of the algorithm, we estimate the approximation accuracy related to $\epsilon $ . In addition, we investigate the computational cost saved by approximation in numerical simulation.

14 February 2023 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
GCGuanpu Chen
Guanpu Chen
GXGehui Xu
Gehui Xu
WLWeijian Li
Weijian Li
Yiguang HongYiguang Hong
Yiguang Hong
To efficiently solve the nonsmooth distributed optimization with both local constraints and coupled constraints, we propose a distributed continuous-time algorithm based on the mirror descent (MD) method. In this article, we introduce the Bregman damping into distributed MD-based dynamics, which not only successfully applies the MD idea to the distributed primal-dual framework, but also ensures the boundedness of all variables and the convergence of the entire dynamics. Our approach generalizes the classic distributed projection-based dynamics, and establishes a connection between MD methods and distributed Euclidean-projected approaches. Also, we prove the convergence of the proposed distributed dynamics with an $ \mathcal {O}(1/t)$ rate. For practical implementation, we further give a discrete-time algorithm based on the proposed dynamics with an $ \mathcal {O}(1/\sqrt{k})$ convergence rate.

6 May 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
GXGehui Xu
Gehui Xu
GCGuanpu Chen
Guanpu Chen
ZCZhaoyang Cheng
Zhaoyang Cheng
Yiguang HongYiguang Hong
Yiguang Hong
HQHongsheng Qi
Hongsheng Qi
There has been significant recent interest in a class of three-player leader-follower game models in many important cybersecurity scenarios. In such a tri-level hierarchical structure, a defender usually serves as a leader, dominating the decision process by the Stackelberg equilibrium (SE) strategy. However, such a leader-follower scheme may not always work, and the Nash equilibrium (NE) strategy may provide an alternative choice. Thus, we need to reveal the consistency between SE and NE in the three-player model to help the leader evaluate its strategy impact and avoid a choice dilemma. To this end, we first provide a necessary and sufficient condition such that each SE is an NE, which not only provides access to seek a satisfactory SE but also makes a criterion for an obtained SE. Then, we apply the results for case studies with a unique SE or with at least one SE being an NE. Moreover, when the consistency condition falls short, we give an upper bound of the deviation between SE and NE to help the leader tolerably adopt an SE strategy. Finally, we apply our consistency analysis to practical scenarios, including secure wireless transmission and advanced persistent threat defense.

19 April 2023 in Journal of Systems Science and Complexity
Verified
Journal Article
Closed access
PDF file
GXGehui Xu
Gehui Xu
GCGuanpu Chen
Guanpu Chen
HQHongsheng Qi
Hongsheng Qi

19 August 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
GCGuanpu Chen
Guanpu Chen
GXGehui Xu
Gehui Xu
FHFengxiang He
Fengxiang He
Yiguang HongYiguang Hong
Yiguang Hong
Leszek RutkowskiLeszek Rutkowski
Leszek Rutkowski
DTDacheng Tao
Dacheng Tao
Many machine learning problems can be formulated as non-convex multi-player games. Due to non-convexity, it is challenging to obtain the existence condition of the global Nash equilibrium (NE) and design theoretically guaranteed algorithms. This paper studies a class of non-convex multi-player games, where players’ payoff functions consist of canonical functions and quadratic operators. We leverage conjugate properties to transform the complementary problem into a variational inequality (VI) problem using a continuous pseudo-gradient mapping. We prove the existence condition of the global NE as the solution to the VI problem satisfies a duality relation. We then design an ordinary differential equation to approach the global NE with an exponential convergence rate. For practical implementation, we derive a discretized algorithm and apply it to two scenarios: multi-player games with generalized monotonicity and multi-player potential games. In the two settings, step sizes are required to be $\mathcal {O}(1/k)$ and $\mathcal {O}(1/\sqrt{k})$ to yield the convergence rates of $\mathcal {O}(1/ k)$ and $\mathcal {O}(1/\sqrt{k})$ , respectively. Extensive experiments on robust neural network training and sensor network localization validate our theory. Our code is available at https://github.com/GuanpuChen/Global-NE .

16 July 2024 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
GXGehui Xu
Gehui Xu
YZYaoyu Zhang
Yaoyu Zhang
JSJian Sun
Jian Sun
GCGuanpu Chen
Guanpu Chen
CWChenye Wu
Chenye Wu
With the rising adoption of distributed and intermittent renewable energy sources, microgrids have emerged as a promising solution to the resulting challenges. Specifically, microgrids could rely on energy storage systems (ESSs) to balance power generation and varying loads. However, an increased number of ESSs, if not well coordinated, can lead to an increase in system operation costs. To overcome this issue, we adopt a graph-based aggregative game to regulate the charging and discharging strategies of multiple ESSs. We show the existence and uniqueness of the Nash equilibrium (NE) and propose the corresponding Graph-based Aggregative Charging Tracking (GACT) distributed algorithm to compute NE with a linear convergence rate. Our algorithm leverages existing communication resources efficiently and protects the private charging information of ESSs. Numerical experiments demonstrate the effectiveness of our proposed algorithm.