On the Data-Driven Modeling of Price-Responsive Flexible Loads: Formulation and Algorithm
Mingji Chen, Shuai Lu, Wei Gu, Zhaoyang Dong, Yijun Xu, Jiayi Ding
TL;DR
This paper addresses the challenge of accurately identifying price-responsive flexible loads (PRFLs) by developing a data-driven, noise-aware inverse-optimization framework. It formulates forward static and dynamic response models for PRFL aggregates, extends them with inner costs, and embeds them into a bilevel inverse problem to estimate the aggregate-model parameters under noisy observations. A Bayesian optimization-based algorithm with a Gaussian-process surrogate and a block-Cholesky acceleration is proposed, delivering scalability to large samples and providing posterior identifiability certificates. Theoretical noise analysis (Theorem 1) and numerical results demonstrate improved accuracy over Newton-based methods and highlight the importance of price signaling and data diversity for robust identifiability. The approach holds promise for more reliable integration of PRFLs into power-system operations and market mechanisms, enabling better demand flexibility management under uncertainty.
Abstract
The flexible loads in power systems, such as interruptible and transferable loads, are critical flexibility resources for mitigating power imbalances. Despite their potential, accurate modeling of these loads is a challenging work and has not received enough attention, limiting their integration into operational frameworks. To bridge this gap, this paper develops a data-driven identification theory and algorithm for price-responsive flexible loads (PRFLs). First, we introduce PRFL models that capture both static and dynamic decision mechanisms governing their response to electricity price variations. Second, We develop a data-driven identification framework that explicitly incorporates forecast and measurement errors. Particularly, we give a theoretical analysis to quantify the statistical impact of such noise on parameter estimation. Third, leveraging the bilevel structure of the identification problem, we propose a Bayesian optimization-based algorithm that features the scalability to large sample sizes and the ability to offer posterior differentiability certificates as byproducts. Numerical tests demonstrate the effectiveness and superiority of the proposed approach.
