pith. sign in

arxiv: 2605.26796 · v1 · pith:AOFQ2WTBnew · submitted 2026-05-26 · 📡 eess.SY · cs.SY

Incentive-Based Load Curtailment with Limited Information: A Bilevel Zeroth-Order Learning Approach

classification 📡 eess.SY cs.SY
keywords bilevelbi-zollearningzeroth-ordercurtailmenthypergradientincentive-basedinformation
0
0 comments X
read the original abstract

Incentive-based load curtailment unlocks critical demand-side flexibility but is hindered by the limited knowledge of private user parameters and the inherent nonsmoothness of responses due to physical device constraints. We address this via a constrained bilevel optimization framework and propose the Bi-ZOL (Bilevel Zeroth-Order Learning) algorithm. Unlike conventional black-box methods, Bi-ZOL exploits the bilevel structure to decompose the hypergradient, integrating the exact analytical information of the SO's objective with a zeroth-order estimate of the unknown response sensitivity. This structural decomposition-based learning method mathematically smoothes the nonsmooth response landscape and reduces hypergradient estimation error. We provide theoretical convergence guarantees to an approximate stationary point and demonstrate through simulations that Bi-ZOL achieves near-optimal performance.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.