Zhenyuan Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zhenyuan Huang has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Haijun Yang
School of Economics and Management, Beihang University, Beijing 100191, China
4 shared publications - Harris Wu
Strome College of Business, Old Dominion University, Norfolk, Virginia 23529
3 shared publications - Chutong Yang
Department of Computer Science, Stanford University, Stanford, California 94305
2 shared publications Chengqian Hao
1 shared publication- Haohang Sun1 shared publication
Hui Zhang
1 shared publication
Latest Publications
- 14 July 2026
- Published by Springer Nature
- p. 493-502
Learning Invariant and Discriminative Representations for Cross-Domain Deepfake Detection
- 14 July 2026
- Published by Springer Nature
- p. 493-502
Learning Invariant and Discriminative Representations for Cross-Domain Deepfake Detection
- 31 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 321
PrivTabRAG: A data-model co-design framework for privacy-preserving retrieval-augmented generation on tabular data
- 31 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 321
PrivTabRAG: A data-model co-design framework for privacy-preserving retrieval-augmented generation on tabular data
- 2 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
An Adaptive Federated Learning Algorithm with Attenuated Memory on Non-IID and Long-Tail Data
Data sharing and privacy protection in the business sector present dual challenges, especially in the financial and medical fields. We propose an adaptive federated learning algorithm with attenuated memory (AFLAM) to address three critical problems in federated learning: nonindependently and nonidentically distributed (non-IID), long-tail distribution, and privacy. AFLAM dynamically recalculates each client’s weight with attenuated memory of the gradient history to mitigate bias from non-IID data, enhancing the modeling ability of tail data. AFLAM protects privacy by transmitting scaled instead of true gradient information. Two AFLAM algorithms, client-based and parameter-based, are proposed. AFLAM performs better with non-IID and long-tail distribution than existing state-of-the-art methods, improving accuracy by up to 5.71%. Our algorithm provides a novel approach to data sharing and privacy protection challenges. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: H. Yang is grateful for financial support from the National Natural Science Foundation of China [Grant 71771006] and the Beijing Jianlong Heavy Industry Program [Grant 20251202]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0765 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0765 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 2 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
An Adaptive Federated Learning Algorithm with Attenuated Memory on Non-IID and Long-Tail Data
Data sharing and privacy protection in the business sector present dual challenges, especially in the financial and medical fields. We propose an adaptive federated learning algorithm with attenuated memory (AFLAM) to address three critical problems in federated learning: nonindependently and nonidentically distributed (non-IID), long-tail distribution, and privacy. AFLAM dynamically recalculates each client’s weight with attenuated memory of the gradient history to mitigate bias from non-IID data, enhancing the modeling ability of tail data. AFLAM protects privacy by transmitting scaled instead of true gradient information. Two AFLAM algorithms, client-based and parameter-based, are proposed. AFLAM performs better with non-IID and long-tail distribution than existing state-of-the-art methods, improving accuracy by up to 5.71%. Our algorithm provides a novel approach to data sharing and privacy protection challenges. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: H. Yang is grateful for financial support from the National Natural Science Foundation of China [Grant 71771006] and the Beijing Jianlong Heavy Industry Program [Grant 20251202]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0765 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0765 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 10 February 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for An Adaptive Federated Learning Algorithm with Attenuated Memory on Non-IID and Long-tail Data
Addressing the dual challenges of privacy protection and data sharing in sectors such as finance and healthcare, this repository proposes AFLAM (Adaptive Federated Learning Algorithm with Attenuated Memory). By leveraging the decaying mechanism of gradient history to dynamically adjust client weights, this method effectively tackles data heterogeneity and significantly enhances the overall performance of the federated learning model.
- 10 February 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for An Adaptive Federated Learning Algorithm with Attenuated Memory on Non-IID and Long-tail Data
Addressing the dual challenges of privacy protection and data sharing in sectors such as finance and healthcare, this repository proposes AFLAM (Adaptive Federated Learning Algorithm with Attenuated Memory). By leveraging the decaying mechanism of gradient history to dynamically adjust client weights, this method effectively tackles data heterogeneity and significantly enhances the overall performance of the federated learning model.
- 18 October 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 305
A cross-domain transfer learning model for author name disambiguation on heterogeneous graph with pretrained language model
- 18 October 2024
- Published by Elsevier in Knowledge-Based Systems
- Vol. 305
A cross-domain transfer learning model for author name disambiguation on heterogeneous graph with pretrained language model