Gao huimin

Mrs. Gao huimin

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
29 June 2023 in Sensors
Verified
Journal Article
Open access
PDF file
GHGao huimin
Gao huimin
QWQingtao Wu
Qingtao Wu
XZXuhui Zhao
Xuhui Zhao
JZJunlong Zhu
Junlong Zhu
MZMingchuan Zhang
Mingchuan Zhang
Federated learning is served as a novel distributed training framework that enables multiple clients of the internet of things to collaboratively train a global model while the data remains local. However, the implement of federated learning faces many problems in practice, such as the large number of training for convergence due to the size of model and the lack of adaptivity by the stochastic gradient-based update at the client side. Meanwhile, it is sensitive to noise during the optimization process that can affect the performance of the final model. For these reasons, we propose Federated Adaptive learning based on Derivative Term, called FedADT in this paper, which incorporates adaptive step size and difference of gradient in the update of local model. To further reduce the influence of noise on the derivative term that is estimated by difference of gradient, we use moving average decay on the derivative term. Moreover, we analyze the convergence performance of the proposed algorithm for non-convex objective function, i.e., the convergence rate of 1/nT can be achieved by choosing appropriate hyper-parameters, where n is the number of clients and T is the number of iterations, respectively. Finally, various experiments for the image classification task are conducted by training widely used convolutional neural network on MNIST and Fashion MNIST datasets to verify the effectiveness of FedADT. In addition, the receiver operating characteristic curve is used to display the result of the proposed algorithm by predicting the categories of clothing on the Fashion MNIST dataset.

4 August 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
GHGao huimin
Gao huimin
QWQingtao Wu
Qingtao Wu
HCHongyan Cao
Hongyan Cao
XZXuhui Zhao
Xuhui Zhao
JZJunlong Zhu
Junlong Zhu
MZMingchuan Zhang
Mingchuan Zhang
As a new machine learning technique, federated learning has received more attention in recent years, which enables decentralized model training across data silos or edge intelligent devices in the Internet of Things without exchanging local raw data. All kinds of algorithms are proposed to solve the challenges in federated learning. However, most of these methods are based on stochastic gradient descent, which undergoes slow convergence and unstable performance during the training stage. In this paper, we propose a differential adaptive federated optimization method, which incorporates an adaptive learning rate and the gradient difference into the iteration rule of the global model. We further adopt the first-order moment estimation to compute the approximate value of the differential term so as to avoid amplifying the random noise from the input data sample. The theoretical convergence guarantee is established for our proposed method in a stochastic non-convex setting under full client participation and partial client participation cases. Experiments for the image classification task are performed on two standard datasets by training a neural network model, and experiment results on different baselines demonstrate the effectiveness of our proposed method.

14 March 2025 in Cognitive Computation
Verified
Journal Article
Closed access
PDF file
GHGao huimin
Gao huimin
Muhua LiuMuhua Liu
Muhua Liu
ZJZhihang Ji
Zhihang Ji
RZRuijuan Zheng
Ruijuan Zheng
QWQingtao Wu
Qingtao Wu

9 June 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
JFJiamei Feng
Jiamei Feng
GCGaofeng Chen
Gaofeng Chen
MYMeiyi Yang
Meiyi Yang
GHGao huimin
Gao huimin
XZXuhui Zhao
Xuhui Zhao
QWQingtao Wu
Qingtao Wu

16 July 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
JSJunru Shi
Junru Shi
GHGao huimin
Gao huimin
QWQingtao Wu
Qingtao Wu
The distributed policy gradient (PG) method has become a mainstream technique for finding optimal policies in multi-agent reinforcement learning. However, global convergence guarantees, which are the most basic measures of theoretical convergence performance, are rarely used in existing distributed policy gradient methods. Moreover, the convergence behaviors of existing methods are sensitive to the selection of learning rates, which leads to limited convergence speeds. To tackle this challenge, we present a new distributed adaptive softmax policy gradient algorithm called DASPG by incorporating Adam-type updates and variance reductions into a vanilla distributed policy gradient method. Moreover, we establish global convergence guarantees for DASPG, i.e., an ϵ-optimal policy can be found with a sample complexity of O˜(ϵ−4.5), which is on par with leading centralized PG methods in terms of sample efficiency. Finally, we present experimental results to demonstrate the efficacy of the proposed algorithm.

10 March 2026 in Pattern Analysis and Applications
Verified
Journal Article
Closed access
PDF file
YQYuan Qu
Yuan Qu
QWQingtao Wu
Qingtao Wu
JLJia Liu
Jia Liu
MLMeiwen Li
Meiwen Li
GHGao huimin
Gao huimin
MYMeiyi Yang
Meiyi Yang