Backend
A Cherry-Picking Approach to Large Load Shaping for More Effective Carbon Reduction
arXiv stat.ML0 views
arXiv:2601.17990v2 Announce Type: replace Abstract: Shaping multi-megawatt flexible loads such as data centers alters generator dispatch on the electric grid, affecting system-wide CO2 emissions and wholesale electricity costs. However, evaluating prevalent load-shaping signals - such as grid-average carbon intensity, locational marginal price, renewable generation, or commercial marginal emission estimates - has remained difficult because full-scale market-clearing models and generator bid data are rarely accessible outside system operators. Here we conduct year-long causal dispatch counterfactuals using a calibrated, nearly 8,900-bus replica of ERCOT's day-ahead Security Constrained Unit Commitment and Security Constrained Economic Dispatch market-clearing process across renewable-rich and fossil-dominated zones. We find that while LMP-based shaping outperforms other static signals in annual grid CO2 reductions, no single signal performs best across all operating conditions. Motivated by these insights, we propose an interpretable daily "cherry-picking" strategy that selects among practicable day-ahead signals using observable grid net demand and nodal minimum LMP, with thresholds learnable directly from historical market data. Cherry-picking achieves 2-3 times greater annual grid CO2 savings than static LMP shaping without increasing wholesale electricity cost relative to flat operation. Extending this framework to coordinated spatial and temporal shifting across two grid nodes increases CO2 reductions by over 70% compared to temporal-only shifting. Finally, because shaping load against region-wide average carbon intensity can backfire and raise physical grid emissions in fossil-heavy zones, our findings highlight the need for Scope 2 carbon-accounting frameworks to incorporate locational, price-aware, and congestion-aware signals.
Source:https://arxiv.org/abs/2601.17990PreviousScalable Learning from Probability Measures with Mean Measure QuantizationNextSharp feature-learning transitions and Bayes-optimal neural scaling laws in extensive-width networks
Related posts
The night the queue ran dry at 1:40
0dev.to
WAFio v2, SafeLine and ModSecurity through three test tools
0dev.to
A review checklist for n8n workflows before you release them
0dev.to
Building a Gherkin editor and two-way Git sync on Atlassian Forge: eight things I learned
0dev.to
How to Own Email Verification — Magic Link Fallback for Student Signups
0dev.to

How to check your Rust port against the Python original (with five real bugs it caught)
0dev.to