Adaptive Federated Learning to Optimize Integrated Flows in Cyber-Physical Data Centers
Junhong Liu, Lanxin Du, Yujia Li, Rong-Peng Liu, Yunfeng Li, Fei Teng, Francis Yunhe Hou
TL;DR
The work tackles energy management for hyperscale data centers by jointly optimizing electricity, heat, and data flows under privacy constraints. It introduces an adaptive federated learning-to-optimization framework with a privacy-preserving learning stage and a verifiable data-sharing scheme using double aggregation to ensure data integrity. The approach yields convergence-guaranteed training, near-optimal distributed optimization, and significant computational efficiency compared with centralized MILP. The results demonstrate robust performance under heterogeneity and privacy requirements, enabling scalable, privacy-preserving operation of large-scale data-center networks.
Abstract
Data centers play an increasingly critical role in societal digitalization, yet their rapidly growing energy demand poses significant challenges for sustainable operation. To enhance the energy efficiency of geographically distributed data centers, this paper formulates a multi-period optimization model that captures the interdependence of electricity, heat, and data flows. The optimization of such integrated multi-domain flows inherently involves mixed-integer formulations and the access to proprietary or sensitive datasets, which correspondingly exacerbate computational complexity and raise data-privacy concerns. To address these challenges, an adaptive federated learning-to-optimization approach is proposed, accounting for the heterogeneity of datasets across distributed data centers. To safeguard privacy, cryptography techniques are leveraged in both the learning and optimization processes. A model acceptance criterion with convergence guarantee is developed to improve learning performance and filter out potentially contaminated data, while a verifiable double aggregation mechanism is further proposed to simultaneously ensure privacy and integrity of shared data during optimization. Theoretical analysis and numerical simulations demonstrate that the proposed approach preserves the privacy and integrity of shared data, achieves near-optimal performance, and exhibits high computational efficiency, making it suitable for large-scale data center optimization under privacy constraints.
