FULCRUM: A Preference-Conditioned Hierarchical Graph Reinforcement Learning for Sustainable Multi-Data-Center Control
Abstract
Geo-distributed data-center fleets must trade off electricity costs, carbon emissions, water use, and quality of service (QoS) across sites with varying prices, grids, and weather conditions. Learned controllers for this problem are trained for a single objective weighting and a single fleet size, so any change in operator priorities or footprint requires retraining. We present , a single preference-conditioned graph policy: a Graph Pattern Machine whose objective-aligned attention heads are feature-wise linear modulation (FiLM) conditioned on the operator preference \pref, followed by cross-attention from data-center nodes to preference-scaled objective tokens. All parameters are shared across nodes and edges, so the same weights act on any fleet. Under a budget-matched protocol with paired tests over 50 evaluation episodes, repeated across three training seeds, attains the best mean rank across five operator preferences among ten controllers (), matches or exceeds every preference-conditioned baseline across all seven held-out preferences never used in training ( practical wins, no losses against preference-conditioned baselines), and at one-hot preferences reaches the lowest cost, carbon, water, and QoS penalty of any baseline. It steers the fleet at inference time from water to cost relative to its balanced operating point and, trained once at data centers, outperforms a Green-DCC controller retrained from scratch at each of , , , and data centers by – reward, where preference-conditioned MLP and GNN baselines cannot be loaded at all. One training run replaces five per-preference specialists at lower compute for a reward cost. We also report where does not lead: at intermediate preference weights, conditioned baselines use – less water, one of three seeds emits more carbon at the carbon corner, and the cross-attention and FiLM components are not individually significant at this budget.
est. 32% chance this paper gets accepted at ICLR 2027.
What do you think this paper will get?
All positions stay anonymous.