Jian Hou

Dr. Jian Hou

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
9 October 2019 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
LXLin Xiao
Lin Xiao
JDJianhua Dai
Jianhua Dai
Long JinLong Jin
Long Jin
WLWeibin Li
Weibin Li
Shuai  LiShuai Li
Shuai Li
JHJian Hou
Jian Hou
This article focuses on the research of a general time-varying nonlinear optimization (TVNO) problem solving especially in a noise-disturbance environment. For addressing this problem more efficiently, a new noise-enduring and finite-time convergent design formula is suggested to establish a novel zeroing neural network (NZNN). In contrast to the initial zeroing neural network or the noising-enduring zeroing neural network, which either only achieves finite-time convergence or only suppresses external disturbances, the merit of the proposed NZNN model is able to find an error-free optimal solution in a finite time under various different types of external noises. In addition, the detailed mathematical analyses about finite-time convergence and noise endurance are given to prove the excellent characteristics of the NZNN model. Numerical comparative results are provided to demonstrate the accuracy, efficiency, and advantages of the NZNN model for TVNO under various types of external disturbances. Robotic tracking example further validates the applicability of the NZNN model especially in a noise-disturbance environment.


15 June 2022 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
JHJian Hou
Jian Hou
FWFangyuan Wang
Fangyuan Wang
CWChunling Wei
Chunling Wei
HHHongyun Huang
Hongyun Huang
YHYong Hu
Yong Hu
NGNing Gui
Ning Gui
Decentralized deep learning has made significant success since it avoids the single point of failure in centralized solutions. However, the system might deviate from the correct model due to Byzantine attacks. Existing Byzantine-resilient defense models are mainly of a one-step evaluation fashion, making them vulnerable to rigorous topology and sophisticated cyber-attacks due to lack of historical evaluations. This paper proposes a credibility assessment based parameter aggregation rule (CA-PAR) that evaluates each neighboring node by its long-term performance. For each node and its neighbors, two concepts, immediate reward and history information based credibility are firstly proposed to describe the immediate reliability at current iteration and the comprehensive assessment of the reliability respectively. Thereafter, all the received parameters are aggregated in linear combination, in which the adjacent weight is determined by credibility value. Finally, the influences of suspicious nodes can gradually be reduced and eliminated. Experimental results in MNIST and CIFAR-10 datasets indicate the algorithm’s tolerance for five state-of-the-art attack methods against an arbitrary number of faulty nodes. Compared with the previous defense models, the proposed algorithm in this paper outperforms in topology constraints, training accuracy and computation cost.

1 February 2024 in Applied Energy
Verified
Journal Article
Closed access
YLYutong Li
Yutong Li
JHJian Hou
Jian Hou
GYGangfeng Yan
Gangfeng Yan

3 November 2025 in Knowledge-Based Systems
Verified
Journal Article
Closed access
SZShangfei Zheng
Shangfei Zheng
XNXiaotong Nie
Xiaotong Nie
WYWei Yuan
Wei Yuan
LQLiang Qu
Liang Qu
XKXiangjie Kong
Xiangjie Kong
JHJian Hou
Jian Hou

9 May 2022 in Journal of the Franklin Institute
Verified
Journal Article
Closed access
JHJian Hou
Jian Hou
ZCZhiyong Chen
Zhiyong Chen
MZMingyue Zhang
Mingyue Zhang
XWXiaomin Wang
Xiaomin Wang