25 August 2023 in IEEE Transactions on Industrial Electronics
Emerging multisource data provide a promising way to make breakthroughs in remaining useful life prediction. Due to the diversity in industrial sites and the complexity of the engineering systems, a large amount of degradation information of machinery is hidden in multitype data, which poses a challenge to adequately capture the complex features that jointly affect remaining useful life. To this end, we propose an interactive attention-based deep spatio-temporal network to effectively fuse vibration waveforms and time-varying operating signals. Specifically, the spatio-temporal structure in the proposed model has the ability to mine long-term dependence and local spatial information from raw multisource data simultaneously. An interactive attention mechanism is used to weight the extracted feature contributions from different source dynamically. Furthermore, a modified mean absolute percentage error criterion is designed in the training process for the inherent properties of the remaining useful prediction. For illustration, a case study of a rotating machinery in an oil refinery and a public dataset of an aircraft engine are investigated. The extensive experiments have demonstrated that, compared to relying solely on either vibrational or operating signals and different fusion strategies, the proposed model can effectively integrate multisource data to reduce prediction loss with an acceptable performance.
24 December 2025 in IEEE Transactions on Instrumentation and Measurement
Advanced intelligent fault diagnosis methods based on domain generalization leverage multi-source sensor data to overcome the limitations the limitations of domain adaptation-based models regarding target data demand in the training stage, which resolves domain shift problems under unseen conditions in industrial instrumentation. However, previous studies primarily focused on the closed-set diagnosis with same label space shared by the training and testing data, which struggle to address the problem of new fault identification under intricate industrial dynamics. To overcome this obstacle, a trustworthy Evidential Open-Set Domain Generalization Network (EOSDGN) is proposed for open-set fault diagnosis under unseen conditions. In the EOSDGN method, an evidential deep classifier is constructed to quantify the uncertainty of predicted results, an evidential domain discriminator is employed to integrate the data from diverse source domains, and an evidential uncertainty calibration is established to reconcile the misleading evidence and class-based evidence assignments. The EOSDGN model effectively addresses both domain and label shift challenges by integrating domain-invariant features extraction and uncertainty quantification of the predicted probabilities, which enables efficient classification of known faults while simultaneously facilitating the identification of unknown faults. The effectiveness of the EOSDGN model has been substantiated using public and practical datasets. Experimental findings demonstrate that the EOSDGN model surpasses the performance of the state-of-the-art models.
4 March 2026 in IEEE Transactions on Industrial Informatics
Meta-learning methods are an effective approach to tackling the challenges of few-shot learning. However, current meta-learning approaches based on artificial neural networks do not introduce brain-inspired learning mechanisms, thereby hindering these models from achieving few-shot learning efficiencies and flexibilities comparable to human performance. Furthermore, existing brain-inspired spiking neural network approaches for meta-learning fail to meet Dale’s law constraints on excitation–inhibition balance during synaptic plasticity-driven weight regulation. This limitation compromises both the biological plausibility and the learning capability of spiking meta-learning. This work introduces a Dale’s law-constrained neural excitation–inhibition balance mechanism for meta-learning the initialization of spiking neural networks, constructing internal representations broadly applicable to many few-shot tasks. Specifically, to ensure strict compliance with Dale’s law (neurotransmitter type invariance) during synaptic weight updates, we integrate a modified projected gradient descent method with synaptic plasticity, thereby maintaining the invariance of neural excitatory and inhibitory properties. Building upon this, we incorporate the Dale’s law-constrained excitation–inhibition balance mechanism into spiking meta-learning and propose the excitation–inhibition balance-based spiking meta-initialization (EI-SMI) algorithm. Next, to enhance the stability and generalization capability of spiking meta-initialization, we employ a multistep weighted loss strategy to guide the network’s meta-learning process. Extensive experiments on five benchmark datasets (Omniglot, Mini-ImageNet, CUB, CIFAR-FS, and CWRU) demonstrate that the proposed EI-SMI outperforms early artificial neural network-based meta-learning approaches on certain specialized tasks and surpasses Spiking MAML across all tasks. The experimental results indicate that our method serves as a solid empirical foundation for developing meta-learning algorithms that are both biologically plausible and mechanistically credible.
25 March 2026 in IEEE Transactions on Industrial Informatics
In modern industrial scenarios, federated learning (FL) has been widely adopted due to its advantages in privacy preservation and distributed modeling. However, existing FL approaches rely on a single update paradigm, which significantly hampers communication efficiency. Moreover, the server preserves historical aggregation states to model causal propagation across training rounds, instead of performing memoryless per-round aggregation. For this end, we propose a self-adapting federated continual learning with gradient causal constraint (GCC-SFCL). First, the selection of synchronous or asynchronous communication across FL rounds is reformulated as continual learning task, where an experience accumulation mechanism records historical aggregation states to model long-term temporal dependencies among client updates. Based on the aggregated context, we further design a self-adapting scheduling strategy driven by multidimensional client state information, enabling the server to dynamically select optimal aggregation. Furthermore, a causality-steering gradient constraint is introduced to explicitly regulate gradient updates, improving the interpretability of the causal model and allowing the capture of fault propagation paths. Experimental results of a simulation case and the real-world case demonstrate that GCC-SFCL significantly improves not only communication efficiency but also the accuracy of fault propagation path identification.
1 January 2026 in IEEE Transactions on Industrial Informatics