The energy distance for ensemble and scenario reduction
arXiv:2005.14670 · doi:10.1098/rsta.2019.0431
Abstract
Scenario reduction techniques are widely applied for solving sophisticated dynamic and stochastic programs, especially in energy and power systems, but also used in probabilistic forecasting, clustering and estimating generative adversarial networks (GANs). We propose a new method for ensemble and scenario reduction based on the energy distance which is a special case of the maximum mean discrepancy (MMD). We discuss the choice of energy distance in detail, especially in comparison to the popular Wasserstein distance which is dominating the scenario reduction literature. The energy distance is a metric between probability measures that allows for powerful tests for equality of arbitrary multivariate distributions or independence. Thanks to the latter, it is a suitable candidate for ensemble and scenario reduction problems. The theoretical properties and considered examples indicate clearly that the reduced scenario sets tend to exhibit better statistical properties for the energy distance than a corresponding reduction with respect to the Wasserstein distance. We show applications to a Bernoulli random walk and two real data based examples for electricity demand profiles and day-ahead electricity prices.
arXiv commentAccepted for publication in Philosophical Transactions A
References in corpus (6)
- Equivalence of distance-based and RKHS-based statistics in hypothesis testing
- MMD GAN: Towards Deeper Understanding of Moment Matching Network
- Probabilistic Mid- and Long-Term Electricity Price Forecasting
- The Shortlist Method for Fast Computation of the Earth Mover's Distance and Finding Optimal Solutions to Transportation Problems
- On parameter estimation with the Wasserstein distance
- Fast Scenario Reduction for Power Systems by Deep Learning