Learning to Optimize Power Distribution Grids using Sensitivity-Informed Deep Neural Networks

Deep learning for distribution grid optimization can be advocated as a promising solution for near-optimal yet timely inverter dispatch. The principle is to train a deep neural network (DNN) to predict the solutions of an optimal power flow (OPF), thus shifting the computational effort from real-time to offline. Nonetheless, before training this DNN, one has to solve a large number of OPFs to create a labeled dataset. Granted the latter step can still be prohibitive in time-critical applications, this work puts forth an original technique for improving the prediction accuracy of DNNs by taking into account the sensitivities of the OPF minimizers with respect to the OPF parameters. By expanding on multiparametric programming, it is shown that although inverter control problems may exhibit dual degeneracy, the required sensitivities do exist in general and can be computed readily using the output of any standard quadratic program (QP) solver. Numerical tests showcase that sensitivity-informed deep learning can enhance prediction accuracy in terms of mean square error (MSE) by 2-3 orders of magnitude at minimal computational overhead. Improvements are more significant in the small-data regime, where a DNN has to learn to optimize using a few examples. Beyond multiparametric QPs, the approach is currently being generalized to parametric (non)-convex opti-mization problems.