Sampling Strategies for Static Powergrid Models
- URL: http://arxiv.org/abs/2204.09053v1
- Date: Tue, 19 Apr 2022 11:38:07 GMT
- Title: Sampling Strategies for Static Powergrid Models
- Authors: Stephan Balduin, Eric MSP Veith, Sebastian Lehnhoff
- Abstract summary: Power flow calculation is an iterative method to compute the voltage magnitudes of the power grid's buses from power values.
Machine learning and, especially, artificial neural networks were successfully used as surrogates for the power flow calculation.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Machine learning and computational intelligence technologies gain more and
more popularity as possible solution for issues related to the power grid. One
of these issues, the power flow calculation, is an iterative method to compute
the voltage magnitudes of the power grid's buses from power values. Machine
learning and, especially, artificial neural networks were successfully used as
surrogates for the power flow calculation. Artificial neural networks highly
rely on the quality and size of the training data, but this aspect of the
process is apparently often neglected in the works we found. However, since the
availability of high quality historical data for power grids is limited, we
propose the Correlation Sampling algorithm. We show that this approach is able
to cover a larger area of the sampling space compared to different random
sampling algorithms from the literature and a copula-based approach, while at
the same time inter-dependencies of the inputs are taken into account, which,
from the other algorithms, only the copula-based approach does.
Related papers
- Deep multitask neural networks for solving some stochastic optimal
control problems [0.0]
In this paper, we consider a class of optimal control problems and introduce an effective solution employing neural networks.
To train our multitask neural network, we introduce a novel scheme that dynamically balances the learning across tasks.
Through numerical experiments on real-world derivatives pricing problems, we prove that our method outperforms state-of-the-art approaches.
arXiv Detail & Related papers (2024-01-23T17:20:48Z) - On Statistical Learning of Branch and Bound for Vehicle Routing
Optimization [3.6922704509753084]
We train neural networks to emulate the decision-making process of the computationally expensive Strong Branching strategy.
We find that this approach can match or improve upon the performance of the branch and bound algorithm.
arXiv Detail & Related papers (2023-10-15T23:59:57Z) - Unsupervised Optimal Power Flow Using Graph Neural Networks [172.33624307594158]
We use a graph neural network to learn a nonlinear parametrization between the power demanded and the corresponding allocation.
We show through simulations that the use of GNNs in this unsupervised learning context leads to solutions comparable to standard solvers.
arXiv Detail & Related papers (2022-10-17T17:30:09Z) - Solving AC Power Flow with Graph Neural Networks under Realistic
Constraints [3.114162328765758]
We propose a graph neural network architecture to solve the AC power flow problem under realistic constraints.
In our approach, we demonstrate the development of a framework that uses graph neural networks to learn the physical constraints of the power flow.
arXiv Detail & Related papers (2022-04-14T14:49:34Z) - Convolutional generative adversarial imputation networks for
spatio-temporal missing data in storm surge simulations [86.5302150777089]
Generative Adversarial Imputation Nets (GANs) and GAN-based techniques have attracted attention as unsupervised machine learning methods.
We name our proposed method as Con Conval Generative Adversarial Imputation Nets (Conv-GAIN)
arXiv Detail & Related papers (2021-11-03T03:50:48Z) - SignalNet: A Low Resolution Sinusoid Decomposition and Estimation
Network [79.04274563889548]
We propose SignalNet, a neural network architecture that detects the number of sinusoids and estimates their parameters from quantized in-phase and quadrature samples.
We introduce a worst-case learning threshold for comparing the results of our network relative to the underlying data distributions.
In simulation, we find that our algorithm is always able to surpass the threshold for three-bit data but often cannot exceed the threshold for one-bit data.
arXiv Detail & Related papers (2021-06-10T04:21:20Z) - Reinforcement Learning for Datacenter Congestion Control [50.225885814524304]
Successful congestion control algorithms can dramatically improve latency and overall network throughput.
Until today, no such learning-based algorithms have shown practical potential in this domain.
We devise an RL-based algorithm with the aim of generalizing to different configurations of real-world datacenter networks.
We show that this scheme outperforms alternative popular RL approaches, and generalizes to scenarios that were not seen during training.
arXiv Detail & Related papers (2021-02-18T13:49:28Z) - Learning Centric Power Allocation for Edge Intelligence [84.16832516799289]
Edge intelligence has been proposed, which collects distributed data and performs machine learning at the edge.
This paper proposes a learning centric power allocation (LCPA) method, which allocates radio resources based on an empirical classification error model.
Experimental results show that the proposed LCPA algorithm significantly outperforms other power allocation algorithms.
arXiv Detail & Related papers (2020-07-21T07:02:07Z) - Identification of AC Networks via Online Learning [0.0]
This paper proposes an online learning procedure to estimate the network admittance matrix capturing topological information and line parameters.
Our approach improves on existing techniques, and its effectiveness is substantiated by numerical studies on realistic testbeds.
arXiv Detail & Related papers (2020-03-13T11:40:53Z) - Quantized Decentralized Stochastic Learning over Directed Graphs [52.94011236627326]
We consider a decentralized learning problem where data points are distributed among computing nodes communicating over a directed graph.
As the model size gets large, decentralized learning faces a major bottleneck that is the communication load due to each node transmitting messages (model updates) to its neighbors.
We propose the quantized decentralized learning algorithm over directed graphs that is based on the push-sum algorithm in decentralized consensus optimization.
arXiv Detail & Related papers (2020-02-23T18:25:39Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.