Jiexing Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jiexing Li has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Long Jin
Lanzhou University
4 shared publications - Yulin Cao
Qinghai Normal University
3 shared publications - Yongji Guan
School of Information Science and Engineering, Lanzhou University, Lanzhou, China
2 shared publications Jicheng Li
Department of Nuclear Medicine The Second Hospital & Clinical Medical School Lanzhou China
1 shared publicationLongbang Wang
School of Information Science and Engineering Lanzhou University Lanzhou China
1 shared publication- Shuai Li
University of Oulu
1 shared publication
Latest Publications
- Open Access
- 20 September 2026
- Published by Institution of Engineering and Technology (IET) in CAAI Transactions on Intelligence Technology
- Vol. 11 (5) , 1333-1344
A Competitive Model via k WTA Network for Multi‐Agent Systems Considering Noise and Communication Disturbances
The ‐winners‐take‐all (WTA) problem, as a competitive selection strategy, is crucial in multi‐agent systems. However, existing noise‐robust WTA networks mainly address noise while overlooking communication disturbances. The coexistence of both factors significantly degrades solution accuracy and hinders distributed consensus estimation. To address these issues, this paper first proposes an accelerated‐convergence and noise‐tolerant WTA (ACNT‐WTA) network by introducing a nonlinear activation function and an error‐integral term. Second, a robust consensus estimator is developed and integrated with the proposed ACNT‐WTA network to construct an enhanced‐robustness competitive coordination (ERCC) model, which simultaneously suppresses noise and communication disturbances. Theoretical analyses demonstrate the global convergence of the proposed ACNT‐WTA network and the robust consensus estimator. Ultimately, the effectiveness and superiority of the proposed model are demonstrated through comparative numerical simulations and physical experiments.
- 20 September 2026
- Published by Institution of Engineering and Technology (IET) in CAAI Transactions on Intelligence Technology
- Vol. 11 (5) , 1333-1344
Open AccessA Competitive Model via k WTA Network for Multi‐Agent Systems Considering Noise and Communication Disturbances
The ‐winners‐take‐all (WTA) problem, as a competitive selection strategy, is crucial in multi‐agent systems. However, existing noise‐robust WTA networks mainly address noise while overlooking communication disturbances. The coexistence of both factors significantly degrades solution accuracy and hinders distributed consensus estimation. To address these issues, this paper first proposes an accelerated‐convergence and noise‐tolerant WTA (ACNT‐WTA) network by introducing a nonlinear activation function and an error‐integral term. Second, a robust consensus estimator is developed and integrated with the proposed ACNT‐WTA network to construct an enhanced‐robustness competitive coordination (ERCC) model, which simultaneously suppresses noise and communication disturbances. Theoretical analyses demonstrate the global convergence of the proposed ACNT‐WTA network and the robust consensus estimator. Ultimately, the effectiveness and superiority of the proposed model are demonstrated through comparative numerical simulations and physical experiments.
- Open Access
- 24 March 2026
- Published by Institution of Engineering and Technology (IET) in CAAI Transactions on Intelligence Technology
Double‐Integration‐Enhanced Stochastic Gradient Descent Based on Neural Dynamics for Improving Generalisation
Generalisation is a crucial aspect of deep learning, enabling models to perform well on unseen data. Currently, most optimisers that improve generalisation typically suffer from efficiency bottlenecks. This paper proposes a double‐integration‐enhanced stochastic gradient descent (DIESGD) optimiser, which treats the negative gradient as an error term and the parameter's rate of change as a noise term. The generalisation superiority of DIESGD originates from its parameter update mechanism, which inherently favours flat minima. The convergence of DIESGD is proven, and extensive experiments are conducted on a variety of datasets and models, demonstrating the superior performance of DIESGD compared to existing optimisers. Furthermore, DIESGD exhibits reduced sensitivity to the initial learning rate, which enhances its robustness and ease of use in practical applications. The proposed DIESGD optimiser connects the distinct fields of optimisers in deep learning and neural dynamics, which is a typical form of dynamic neural networks. The source code is available at https://github.com/LongJin‐lab/DIESGD .
- 24 March 2026
- Published by Institution of Engineering and Technology (IET) in CAAI Transactions on Intelligence Technology
Open AccessDouble‐Integration‐Enhanced Stochastic Gradient Descent Based on Neural Dynamics for Improving Generalisation
Generalisation is a crucial aspect of deep learning, enabling models to perform well on unseen data. Currently, most optimisers that improve generalisation typically suffer from efficiency bottlenecks. This paper proposes a double‐integration‐enhanced stochastic gradient descent (DIESGD) optimiser, which treats the negative gradient as an error term and the parameter's rate of change as a noise term. The generalisation superiority of DIESGD originates from its parameter update mechanism, which inherently favours flat minima. The convergence of DIESGD is proven, and extensive experiments are conducted on a variety of datasets and models, demonstrating the superior performance of DIESGD compared to existing optimisers. Furthermore, DIESGD exhibits reduced sensitivity to the initial learning rate, which enhances its robustness and ease of use in practical applications. The proposed DIESGD optimiser connects the distinct fields of optimisers in deep learning and neural dynamics, which is a typical form of dynamic neural networks. The source code is available at https://github.com/LongJin‐lab/DIESGD .
- 19 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (4) , 5873-5883
Primal-Dual-Based Differential $k$-WTA Network for Competitive Coordination in Multi-Robot Systems
In multi-robot systems, the $\boldsymbol{k}$-winners-take-all ($\boldsymbol{k}$-WTA) problem serves as a competitive selection mechanism to identify the $\boldsymbol{k}$ most suitable robots from a group of $\boldsymbol{n}$ ($\boldsymbol{n} > \boldsymbol{k}$) ones for a given task. Existing $\boldsymbol{k}$-WTA networks either fail to eliminate lagging errors or involve a complex modeling process due to the introduction of additional Lagrangian variables to deal with bounded constraints. To address these challenges, a primal-dual-based differential $\boldsymbol{k}$-WTA (PDD-$\boldsymbol{k}$WTA) network is proposed in this article. This network incorporates time-derivative information to mitigate lagging errors and leverages linear variational inequalities (LVIs) to streamline the network structure. Theoretical analyses and comparative simulations validate the effectiveness and superiority of the PDD-$\boldsymbol{k}$WTA network. Furthermore, a multi-robot competitive coordination (MCC) model, which integrates the PDD-$\boldsymbol{k}$WTA network, a consensus estimator, and a robot control law, is developed to achieve the tracking of a mobile target.
- 19 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (4) , 5873-5883
Primal-Dual-Based Differential $k$-WTA Network for Competitive Coordination in Multi-Robot Systems
In multi-robot systems, the $\boldsymbol{k}$-winners-take-all ($\boldsymbol{k}$-WTA) problem serves as a competitive selection mechanism to identify the $\boldsymbol{k}$ most suitable robots from a group of $\boldsymbol{n}$ ($\boldsymbol{n} > \boldsymbol{k}$) ones for a given task. Existing $\boldsymbol{k}$-WTA networks either fail to eliminate lagging errors or involve a complex modeling process due to the introduction of additional Lagrangian variables to deal with bounded constraints. To address these challenges, a primal-dual-based differential $\boldsymbol{k}$-WTA (PDD-$\boldsymbol{k}$WTA) network is proposed in this article. This network incorporates time-derivative information to mitigate lagging errors and leverages linear variational inequalities (LVIs) to streamline the network structure. Theoretical analyses and comparative simulations validate the effectiveness and superiority of the PDD-$\boldsymbol{k}$WTA network. Furthermore, a multi-robot competitive coordination (MCC) model, which integrates the PDD-$\boldsymbol{k}$WTA network, a consensus estimator, and a robot control law, is developed to achieve the tracking of a mobile target.
- 8 July 2025
- Published by Elsevier in Neural Networks
- Vol. 191, 107839
Periodic-noise-tolerant neurodynamic approach for kWTA operation applied to opinions evolution
- 8 July 2025
- Published by Elsevier in Neural Networks
- Vol. 191, 107839
Periodic-noise-tolerant neurodynamic approach for kWTA operation applied to opinions evolution
- 31 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 12 (4) , 734-744
A $k$-Winners-Take-All $(k\text{WTA})$ Network with Noise Characteristics CapturedCompetition-based $k-\mathbf{winners}-\mathbf{take}-\mathbf{all}\ \ (k \mathbf{WTA})$ networks play a crucial role in multi-agent systems. However, existing $k \mathbf{WTA}$ networks either neglect the impact of noise or only consider simple forms, such as constant noise. In practice, noises often exhibit time-varying and nonlinear characteristics, which can be modeled using nonlinear functions and approximated by high-order polynomials. Such noises pose significant challenges for current $k \mathbf{WTA}$ networks, limiting their practical applications. To address this, a $k \mathbf{WTA}$. network with noise characteristics captured $(k \mathbf{WTA}-\mathbf{NCC})$ is proposed in this article. Theoretical analyses demonstrate that the residual error of the proposed $k\mathbf{WTA}- \mathbf{NCC}$ network converges to zero globally, while simulation results confirm its robustness against polynomial noises. Additionally, a $k \mathbf{WTA}$ coordination model is constructed by integrating the proposed network with a consensus estimator to achieve multi-agent tracking tasks. Finally, simulations and physical experiments are conducted further to demonstrate the validity and practicality of the $k$ WTA coordination model.- 31 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 12 (4) , 734-744
A $k$-Winners-Take-All $(k\text{WTA})$ Network with Noise Characteristics CapturedCompetition-based $k-\mathbf{winners}-\mathbf{take}-\mathbf{all}\ \ (k \mathbf{WTA})$ networks play a crucial role in multi-agent systems. However, existing $k \mathbf{WTA}$ networks either neglect the impact of noise or only consider simple forms, such as constant noise. In practice, noises often exhibit time-varying and nonlinear characteristics, which can be modeled using nonlinear functions and approximated by high-order polynomials. Such noises pose significant challenges for current $k \mathbf{WTA}$ networks, limiting their practical applications. To address this, a $k \mathbf{WTA}$. network with noise characteristics captured $(k \mathbf{WTA}-\mathbf{NCC})$ is proposed in this article. Theoretical analyses demonstrate that the residual error of the proposed $k\mathbf{WTA}- \mathbf{NCC}$ network converges to zero globally, while simulation results confirm its robustness against polynomial noises. Additionally, a $k \mathbf{WTA}$ coordination model is constructed by integrating the proposed network with a consensus estimator to achieve multi-agent tracking tasks. Finally, simulations and physical experiments are conducted further to demonstrate the validity and practicality of the $k$ WTA coordination model.