Jiao Tian

Jiao Tian

Auto-generated profile, based on publicly available information

Jiao Tian

School of Computer Science Xinjiang University Xinjiang Uygur Autonomous Region China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
8 March 2023 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
JTJiao Tian
Jiao Tian
PTPei-Wei Tsai
Pei-Wei Tsai
KZKai Zhang
Kai Zhang
XCXinyi Cai
Xinyi Cai
HXHongwang Xiao
Hongwang Xiao
JCJinjun Chen
Jinjun Chen
Applying sparsity- and overfitting-aware eXtreme Gradient Boosting (XGBoost) for classification in federated learning allows many participants to train a series of trees collaboratively. Since various local multiclass distributions and global aggregation diversity, model performance plummets as convergence slowly and accuracy decreases. Worse still, neither the participants nor the server can detect this problem and make timely adjustments. In this paper, we provide a new local-global class imbalance inconsistency quantification and utilize softmax as the activation and focal loss, a dynamically scaled cross-entropy loss, in federated XGBoost to mitigate local class imbalance. Moreover, we propose a simple but effective hyperparameter determination strategy based on local data distribution to adjust the sample weights among non-communicating participants, synergetic focal loss, to solve the inconsistency of local and global class imbalance, a unique characteristic of federated learning. This strategy is perfectly integrated into the original classification algorithm. It requires no additional detectors or information transmission. Furthermore, a dynamical for loop is designed to capture an optimum hyperparameter combination. Finally, we conduct comprehensive tabular- and image-based experiments to show that synergetic focal loss used in federated XGBoost achieves faster convergency and significant accuracy improvement. Simulation results prove the effectiveness of the proposed principle of configuring sample weights.

1 September 2021
Verified
Conference Paper
Closed access
KYKe Yu
Ke Yu
HXHongwang Xiao
Hongwang Xiao
YZYing Zhao
Ying Zhao
JTJiao Tian
Jiao Tian
JCJinjun Chen
Jinjun Chen
In real-time systems, energy consumption is one of the most critical challenges. Dynamic voltage and frequency scaling (DVFS) algorithms have been widely applied to balance the trade-off between performance and power consumption. We first review some classic DVFS methods, e.g., LA-EDF and CCEDF, and then a hybrid DVFS algorithm (Soft-LA2) that we proposed recently. Soft-LA2 needs domain knowledge to set the trade-off parameter manually to achieve energy saving compared with classic methods. Motivated by recent deep learning technologies applied in DVFS, in this paper, we propose a new framework for Soft-LA2. Our method automatically optimizes parameters for Soft-LA2, which leads to more power saving compared with random parameter setting in Soft-LA2. Simulation results show that under certain neural network architecture setting, our method can find the best parameters automatically to achieve power saving performance. Furthermore, with test data, our proposed method saves 4.9% and 9.6% power consumption compared with relevant learning method DQL-EES and random setting Soft-LA2, respectively.

15 June 2026
Verified
Conference Paper
Open access
LZLonglong Zhai
Longlong Zhai
JTJiao Tian
Jiao Tian
FYFeng Yan
Feng Yan
LSLei Su
Lei Su
YQYanjun Qin
Yanjun Qin
PZPanpan Zheng
Panpan Zheng
Continual learning (CL) aims to enable networks to learn continuously from sequentially arriving task streams while avoiding catastrophic forgetting (CF) of previously learned tasks. In recent years, Orthogonal gradient projection (OGP)-based CL methods have garnered significant attention from the research community due to their remarkable performance. However, existing OGP approaches overlook two critical issues: (1) representation matrices are typically constructed via random sampling, which introduces misclassified and class-imbalanced samples into the projection basis, contaminating important gradient directions and degrading stability; and (2) task-specific output scale variations induce domain drift, resulting in projection bias that weakens orthogonal constraints across tasks. To address these limitations, we propose Stable Gradient Projection for Continual Learning (STEP), a plug-and-play enhancement framework for OGP-based CL that integrates Correctness-aware Balanced Sampling (CBS) to construct purified and class-balanced projection subspaces using only correctly classified samples, and Sigmoid Attention Constraint (SAC) to enforce consistent output scaling via a sigmoid-based gating mechanism, thereby mitigating scale-induced projection bias. Extensive experiments on Split CIFAR-100, CIFAR-100 Superclass, and 5-Datasets demonstrate that STEP consistently improves state-of-the-art OGP methods, achieving up to +1.4% average accuracy (ACC) gains on Split CIFAR-100, improving backward transfer (BWT) from − 0.37 to − 0.09 for GPM and from − 1.06 to − 0.73 for SGP, and attaining 93.28% ACC with positive BWT (0.17) on 5-Datasets. These results validate STEP as a simple yet effective strategy for enhancing stability–plasticity balance in OGP-based CL.

28 June 2026 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
HWHaojie Wang
Haojie Wang
JTJiao Tian
Jiao Tian
LWLiejun Wang
Liejun Wang

Verified
Journal Article
Open access
PDF file
JTJiao Tian
Jiao Tian
JHJinlin He
Jinlin He
LWLiejun Wang
Liejun Wang
Client selection is a critical mechanism for ensuring robust convergence in Federated Learning (FL) systems, yet it remains vulnerable to Non-IID data distributions and Byzantine attacks. Deep Reinforcement Learning (DRL) has shown promise for automated client selection, yet existing methods suffer from three structural deficiencies: observation ambiguity, where scalar states cannot distinguish malicious updates from benign heterogeneity; reward fragility, whereby attackers exploit unbounded feedback to hijack policy updates; and risk blindness, as risk-neutral agents overlook the inherent variance in client contributions. To address these deficiencies, we propose InfRA-FL, a robust adaptive framework. A mutual-information-based state construction extracts high-utility features, resolving observation ambiguity. A Saturation-Aware Robust Reward (SARR) mechanism applies soft-clipping to bound each client’s influence on the policy gradient, provably neutralizing reward poisoning. URA-PPO, an uncertainty-aware algorithm with a dual-head Critic, optimizes a risk-penalized objective that shifts the agent from risk-neutral to risk-averse decision-making. Experiments on MNIST and CIFAR-10 under 20% Byzantine adversaries show that InfRA-FL outperforms state-of-the-art baselines by 5–10% in accuracy while accelerating convergence, establishing that principled information-theoretic observation and robust reward design suffice to secure RL-driven federated learning against targeted poisoning.