SDP Relaxation with Randomized Rounding for Energy Disaggregation
Published in
Neural Information Processing Systems(2016)External Links:
TL
TL;DR
A scalable, computationally efficient method is developed for the task of energy disaggregation for home appliance monitoring by combining convex semidefinite relaxations with randomized rounding, as well as with a scalable ADMM method that exploits the special structure of the resulting semideFinite program.
Abstract
We develop a scalable, computationally efficient method for the task of energy disaggregation for home appliance monitoring. In this problem the goal is to estimate the energy consumption of each appliance based on the total energy-consumption signal of a household. The current state of the art models the problem as inference in factorial HMMs, and finds an approximate solution to the resulting quadratic integer program via quadratic programming. Here we take a more principled approach, better suited to integer programming problems, and find an approximate optimum by combining convex semidefinite relaxations with randomized rounding, as well as with a scalable ADMM method that exploits the special structure of the resulting semidefinite program. Simulation results demonstrate the superiority of our methods both in synthetic and real-world datasets.
References31 items
1
Neural NILM: Deep Neural Networks Applied to Energy Disaggregation
2
A semidefinite programming method for integer convex quadratic minimization
3
PALDi: Online Load Disaggregation via Particle Filtering
4
Signal Aggregate Constraints in Additive Factorial HMMs, with Application to Energy Disaggregation
5