Kaiyu Wang
Research Subjects
Kaiyu Wang has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Guangsheng Feng
2 shared publicationsHongwu Lv
2 shared publicationsKaiqi Zhang
2 shared publicationsWenqi Zheng
2 shared publications- Zhenzhou Ji
Harbin Institute of Technology, Harbin, China
2 shared publications Zihui Wang
2 shared publications
Latest Publications
- Open Access
- 16 July 2026
- Published by Elsevier in SSRN Electronic Journal
Rethinking Self-balancing Federated Learning under Non-uniformParameter Influence Density
Federated Learning (FL), as a distributed machine learning paradigm, has been persistentlychallenged by data heterogeneity. Most existing studies attempt to mitigate client drift byenforcing model similarity in parameter space. However, non-uniform parameter influence onthe loss function induces an ease-seeking behavior in model optimization, resulting in aninconsistency between model similarity and actual performance. To address this issue, wepropose FedPID, a PID-aware self-balancing framework based on Parameter Influence Density (PID), to optimize model performance under data heterogeneity. In local training, we propose an Adaptive Compensation Loss (ACL), which combines count-based class compensation with batch-level PID modulation to prevent overly aggressive updates along high-influence parameter directions. In global aggregation, we introduce a Calibrated Aggregation Mechanism (CAM) to recalibrate aggregation weights according to PID-weighted update fluctuation and reduce the contribution of unstable clients. Extensive experiments demonstrate that FedPID achieves an average improvement of 2.29 percentage points over state-of-the-art methods across five commonly used visual and text datasets under varying levels of statistical heterogeneity
- 16 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessRethinking Self-balancing Federated Learning under Non-uniformParameter Influence Density
Federated Learning (FL), as a distributed machine learning paradigm, has been persistentlychallenged by data heterogeneity. Most existing studies attempt to mitigate client drift byenforcing model similarity in parameter space. However, non-uniform parameter influence onthe loss function induces an ease-seeking behavior in model optimization, resulting in aninconsistency between model similarity and actual performance. To address this issue, wepropose FedPID, a PID-aware self-balancing framework based on Parameter Influence Density (PID), to optimize model performance under data heterogeneity. In local training, we propose an Adaptive Compensation Loss (ACL), which combines count-based class compensation with batch-level PID modulation to prevent overly aggressive updates along high-influence parameter directions. In global aggregation, we introduce a Calibrated Aggregation Mechanism (CAM) to recalibrate aggregation weights according to PID-weighted update fluctuation and reduce the contribution of unstable clients. Extensive experiments demonstrate that FedPID achieves an average improvement of 2.29 percentage points over state-of-the-art methods across five commonly used visual and text datasets under varying levels of statistical heterogeneity
- 9 July 2026
- Published by Elsevier in Pattern Recognition
- Vol. 180
Expansion and constriction: A unified objective perspective for heterogeneous federated learning
- 9 July 2026
- Published by Elsevier in Pattern Recognition
- Vol. 180
Expansion and constriction: A unified objective perspective for heterogeneous federated learning
- 4 April 2024
- Published by Elsevier in Computer Networks
- Vol. 245
SP-PoR: Improve blockchain performance by semi-parallel processing transactions
- 4 April 2024
- Published by Elsevier in Computer Networks
- Vol. 245
SP-PoR: Improve blockchain performance by semi-parallel processing transactions
- Open Access
- 8 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 113847-113859
Defending Blockchain Forking Attack by Delaying MTC Confirmation
In terms of security, blockchain technology faces the potential risks of enormous attacks, among which forking attack is the most common one. Because of the decentralized structure of a blockchain, the trust degree directly relies on the length of the blockchain, which makes the longest chain on the current network the most trusted chain (MTC). The forking attack is the kind of hazard behavior that aims to replace the MTC by launching an alternative chain to gain benefits. Blockchain plays a vital role in multiple applications, such as cryptocurrency, and hence such forking attack leads to huge financial loss if it succeeds. In this paper, we propose a novel MTC confirmation mechanism to defend the forking attack. First, we theoretically analyze the success probability distribution of the forking attack and propose an estimation model of the attack's expected profit. Then, we propose an arbitration mechanism to enforce branches from a fork to have competition. With the arbitration mechanism, we delay the confirmation of the MTC until the end of the competition. We set up an end threshold as the termination condition of the competition process to help the MTC become the winner. Finally, we define two dynamic difficulty factors and apply them for changing the difficulty of mining to reduce the value of the end threshold, which can improve the performance of the mechanism. The experiments demonstrate our proposed MTC confirmation mechanism can enhance the blockchain security by enforcing the expected profit of an attack to be negative. In the meantime, the mechanism balances well in both effectiveness and efficiency.
- 8 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 113847-113859
Open AccessDefending Blockchain Forking Attack by Delaying MTC Confirmation
In terms of security, blockchain technology faces the potential risks of enormous attacks, among which forking attack is the most common one. Because of the decentralized structure of a blockchain, the trust degree directly relies on the length of the blockchain, which makes the longest chain on the current network the most trusted chain (MTC). The forking attack is the kind of hazard behavior that aims to replace the MTC by launching an alternative chain to gain benefits. Blockchain plays a vital role in multiple applications, such as cryptocurrency, and hence such forking attack leads to huge financial loss if it succeeds. In this paper, we propose a novel MTC confirmation mechanism to defend the forking attack. First, we theoretically analyze the success probability distribution of the forking attack and propose an estimation model of the attack's expected profit. Then, we propose an arbitration mechanism to enforce branches from a fork to have competition. With the arbitration mechanism, we delay the confirmation of the MTC until the end of the competition. We set up an end threshold as the termination condition of the competition process to help the MTC become the winner. Finally, we define two dynamic difficulty factors and apply them for changing the difficulty of mining to reduce the value of the end threshold, which can improve the performance of the mechanism. The experiments demonstrate our proposed MTC confirmation mechanism can enhance the blockchain security by enforcing the expected profit of an attack to be negative. In the meantime, the mechanism balances well in both effectiveness and efficiency.