Xifeng Li

Xifeng Li


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
10 August 2020 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
LPLibiao Peng
Libiao Peng
XLXifeng Li
Xifeng Li
DBDONGJIE BI
DONGJIE BI
XXXuan Xie
Xuan Xie
YXYONGLE XIE
YONGLE XIE
In this article, the multisynchronization issue of coupled memristive neural networks (CMNNs) with unbounded time delays is investigated. To begin with, a class of generalized Gaussian-wavelet-type activation functions is adopted to extend the number of stable equilibrium states. On this basis, a distributed impulsive controller is constructed to realize the multiple synchronization of the delayed CMNNs. Under the concepts of $\mu $ -stability, Filippov solution, and differential inclusion, some sufficient conditions are derived such that the addressed system can possess $(2r + 1)^{n}\,\,\mu $ -stable synchronization manifolds. The convergence performance of solutions is determined by the time delays. As the time delays increase, the stability of synchronization manifolds will transform from exponential stability to power-stability, log-stability, or log–log-stability as special cases. Moreover, considering the modeling error and external disturbance, we further investigated the multisynchronization of delayed CMNNs with parametric uncertainties and stochastic perturbations, and some robust multisynchronization criteria are obtained. Finally, the effectiveness of the obtained results is verified by numerical simulations.

4 March 2020 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
YZYiming Zhang
Yiming Zhang
LPLibiao Peng
Libiao Peng
XLXifeng Li
Xifeng Li
YXYONGLE XIE
YONGLE XIE
In this letter, a novel kernel function named $q$ -Rényi kernel is proposed. Based on it, a new online adaptive learning algorithm is presented, which is derived based on the recursive adaptive filtering paradigm under the reproducing kernel Hilbert space. The proposed learning algorithm is different from the conventional kernel-based learning paradigm in two senses: first, the reproducing kernel so-called $\boldsymbol {q}$ -Rényi kernel is firstly derived and employed; and second, a sparsity constraint is utilized to generate a small size of neural networks while maintaining a high learning performance. The effectiveness of the proposed algorithm is demonstrated via numerical simulations.

23 May 2024 in Mechanical Systems and Signal Processing
Verified
Journal Article
Closed access
TZTingsen Zhang
Tingsen Zhang
MYMing Ye
Ming Ye
XLXifeng Li
Xifeng Li
DBDONGJIE BI
DONGJIE BI
LPLibiao Peng
Libiao Peng
YXYONGLE XIE
YONGLE XIE

21 April 2021 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
HWHaojie Wang
Haojie Wang
XLXifeng Li
Xifeng Li
DBDONGJIE BI
DONGJIE BI
XXXuan Xie
Xuan Xie
YXYONGLE XIE
YONGLE XIE
In this brief, a kernel adaptive filter based on the Student’s ${t}$ distribution in the reproducing kernel Hilbert space (RKHS) is presented, which is distinct from the traditional kernel adaptive filtering algorithms as follows: first, a Student’s ${t}$ reproducing kernel function is proposed to fight against the abrupt noise together with Gaussian noise depicted by the impulsive-Gaussian mixed noise model; and second, a Strengthened Surprise Criterion (SSC) is devised to reduce the size of the neural networks, which is utilized to implement the proposed Student’s ${t}$ -based kernel filter. The proposed algorithms are compared with the widely used KLMS and recently proposed KRLS-type filters in terms of the accuracy error under both Gaussian and abrupt noise. Experimental results show that the proposed Student’s ${t}$ -based kernel adaptive filter can improve the estimation accuracy at least by 20% while having more compact size of neural networks compared with the existed kernel adaptive algorithms.

1 May 2019 in IEEE Access
Verified
Journal Article
Open access
XLXifeng Li
Xifeng Li
LPLibiao Peng
Libiao Peng
LGLe Gao
Le Gao
DBDongjie Bi
Dongjie Bi
XXXuan Xie
Xuan Xie
YXYongle Xie
Yongle Xie
Accurate remaining useful life (RUL) prediction under the noisy environment is a big challenge for the health management of modern industrial systems since the extraction of the accurate data structure from heavily corrupted data is difficult. In recent years, the kernel adaptive filter (KAF) has been widely adopted to solve the robust regression problem due to its low-complexity and high-approximation capability and robustness while the applications in battery RUL prediction are still few and far between. Thus, this paper is concerned with long-term RUL prediction using the KAF method. At first, concretely speaking, a robust KAF algorithm is derived based on the double-Gaussian-mixture (DGM) cost function, which is used to learn the capacity degradation mechanism from contaminated capacity data and so as to build the long-term prediction model. Second, a robust unscented Kalman filter (UKF) algorithm employing the DGM-based cost function is developed, which is then combined with the KAF-based prediction model to realize a more accurate and reliable prediction. Under the hybrid prognostic framework, the proposed UKF algorithm is applied to filter the noisy observations. When the observation data are inaccessible, the predicted data from the off-line trained KAF-based prediction model are adopted as the approximated value of the real observations for the UKF algorithm to optimize the prediction results and to provide the uncertainty representation. The experimental results reveal that the proposed method has great robustness when the measurements contain noise and large outliers, which makes it possible to get satisfactory prediction performance without preprocessing the data manually.

14 January 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
XLXifeng Li
Xifeng Li
DBDONGJIE BI
DONGJIE BI
LPLibiao Peng
Libiao Peng
YXYONGLE XIE
YONGLE XIE