Goto

Collaborating Authors

 energy disaggregation


SDP Relaxation with Randomized Rounding for Energy Disaggregation

Neural Information Processing Systems

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.




Signal Aggregate Constraints in Additive Factorial HMMs, with Application to Energy Disaggregation

Neural Information Processing Systems

Blind source separation problems are difficult because they are inherently unidentifiable, yet the entire goal is to identify meaningful sources. We introduce a way of incorporating domain knowledge into this problem, called signal aggregate constraints (SACs). SACs encourage the total signal for each of the unknown sources to be close to a specified value. This is based on the observation that the total signal often varies widely across the unknown sources, and we often have a good idea of what total values to expect. We incorporate SACs into an additive factorial hidden Markov model (AFHMM) to formulate the energy disaggregation problems where only one mixture signal is assumed to be observed. A convex quadratic program for approximate inference is employed for recovering those source signals. On a real-world energy disaggregation data set, we show that the use of SACs dramatically improves the original AFHMM, and significantly improves over a recent state-of-the art approach.


Industrial Energy Disaggregation with Digital Twin-generated Dataset and Efficient Data Augmentation

Internò, Christian, Castellani, Andrea, Schmitt, Sebastian, Stella, Fabio, Hammer, Barbara

arXiv.org Artificial Intelligence

Abstract--Industrial Non-Intrusive Load Monitoring (NILM) is limited by the scarcity of high-quality datasets and the complex variability of industrial energy consumption patterns. T o address data scarcity and privacy issues, we introduce the Synthetic Industrial Dataset for Energy Disaggregation (SIDED), an open-source dataset generated using Digital Twin simulations. SIDED includes three types of industrial facilities across three different geographic locations, capturing diverse appliance behaviors, weather conditions, and load profiles. We also propose the Appliance-Modulated Data Augmentation (AMDA) method, a computationally efficient technique that enhances NILM model generalization by intelligently scaling appliance power contributions based on their relative impact. We show in experiments that NILM models trained with AMDA-augmented data significantly improve the disaggregation of energy consumption of complex industrial appliances like combined heat and power systems. Specifically, in our out-of-sample scenarios, models trained with AMDA achieved a Normalized Disaggregation Error of 0.167, outperforming models trained without data augmentation (0.451) and those trained with state-of-the-art data augmentation methods (0.290). Data distribution analyses confirm that AMDA effectively aligns training and test data distributions, enhancing model generalization. NERGY management has become increasingly important due to the undeniable reality of climate change and the rising global energy demand [1]. The industrial sector plays a significant role in international energy optimization [2], [3], necessitating heightened awareness of energy consumption to enhance efficiency and sustainability. C. Intern ` o and B. Hammer are with the Machine Learning Group, Center for Cognitive Interaction Technology (CITEC), University of Bielefeld, Bielefeld, Germany. C. Intern ` o, A. Castellani and S. Schmitt are with the Honda Research Institute EU, Offenbach am Main, Germany. F. Stella is with the Models and Algorithms for Data and Text Mining Laboratory (MADLab), Department of Informatics, Systems and Communication (DISCo), University of Milano - Bicocca, Milan, Italy.


Signal Aggregate Constraints in Additive Factorial HMMs, with Application to Energy Disaggregation

Mingjun Zhong, Nigel Goddard, Charles Sutton

Neural Information Processing Systems

Blind source separation problems are difficult because they are inherently unidentifiable, yet the entire goal is to identify meaningful sources. We introduce a way of incorporating domain knowledge into this problem, called signal aggregate constraints (SACs). SACs encourage the total signal for each of the unknown sources to be close to a specified value. This is based on the observation that the total signal often varies widely across the unknown sources, and we often have a good idea of what total values to expect. We incorporate SACs into an additive factorial hidden Markov model (AFHMM) to formulate the energy disaggregation problems where only one mixture signal is assumed to be observed. A convex quadratic program for approximate inference is employed for recovering those source signals. On a real-world energy disaggregation data set, we show that the use of SACs dramatically improves the original AFHMM, and significantly improves over a recent state-of-the-art approach.


COLD: Concurrent Loads Disaggregator for Non-Intrusive Load Monitoring

Kamyshev, Ilia, Hoosh, Sahar Moghimian, Kriukov, Dmitrii, Gryazina, Elena, Ouerdane, Henni

arXiv.org Artificial Intelligence

The global effort toward renewable energy and the electrification of energy-intensive sectors have significantly increased the demand for electricity, making energy efficiency a critical focus. Non-intrusive load monitoring (NILM) enables detailed analyses of household electricity usage by disaggregating the total power consumption into individual appliance-level data. In this paper, we propose COLD (Concurrent Loads Disaggregator), a transformer-based model specifically designed to address the challenges of disaggregating high-frequency data with multiple simultaneously working devices. COLD supports up to 42 devices and accurately handles scenarios with up to 11 concurrent loads, achieving 95% load identification accuracy and 82% disaggregation performance on the test data. In addition, we introduce a new fully labeled high-frequency NILM dataset for load disaggregation derived from the UK-DALE 16 kHz dataset. Finally, we analyze the decline in NILM model performance as the number of concurrent loads increases.


Scaled and Inter-token Relation Enhanced Transformer for Sample-restricted Residential NILM

Rahman, Minhajur, Arafat, Yasir

arXiv.org Artificial Intelligence

Transformers have demonstrated exceptional performance across various domains due to their self-attention mechanism, which captures complex relationships in data. However, training on smaller datasets poses challenges, as standard attention mechanisms can over-smooth attention scores and overly prioritize intra-token relationships, reducing the capture of meaningful inter-token dependencies critical for tasks like Non-Intrusive Load Monitoring (NILM). To address this, we propose a novel transformer architecture with two key innovations: inter-token relation enhancement and dynamic temperature tuning. The inter-token relation enhancement mechanism removes diagonal entries in the similarity matrix to improve attention focus on inter-token relations. The dynamic temperature tuning mechanism, a learnable parameter, adapts attention sharpness during training, preventing over-smoothing and enhancing sensitivity to token relationships. We validate our method on the REDD dataset and show that it outperforms the original transformer and state-of-the-art models by 10-15\% in F1 score across various appliance types, demonstrating its efficacy for training on smaller datasets.


Signal Aggregate Constraints in Additive Factorial HMMs, with Application to Energy Disaggregation

Neural Information Processing Systems

Blind source separation problems are difficult because they are inherently unidentifiable, yet the entire goal is to identify meaningful sources. We introduce a way of incorporating domain knowledge into this problem, called signal aggregate constraints (SACs). SACs encourage the total signal for each of the unknown sources to be close to a specified value. This is based on the observation that the total signal often varies widely across the unknown sources, and we often have a good idea of what total values to expect. We incorporate SACs into an additive factorial hidden Markov model (AFHMM) to formulate the energy disaggregation problems where only one mixture signal is assumed to be observed. A convex quadratic program for approximate inference is employed for recovering those source signals. On a real-world energy disaggregation data set, we show that the use of SACs dramatically improves the original AFHMM, and significantly improves over a recent state-of-the-art approach.


SDP Relaxation with Randomized Rounding for Energy Disaggregation

Neural Information Processing Systems

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 over time based on the total energy-consumption signal of a household. The current state of the art is to model the problem as inference in factorial HMMs, and use quadratic programming to find an approximate solution to the resulting quadratic integer program. Here we take a more principled approach, better suited to integer programming problems, and find an approximate optimum by combining convex semidefinite relaxations randomized rounding, as well as a scalable ADMM method that exploits the special structure of the resulting semidefinite program. Simulation results both in synthetic and real-world datasets demonstrate the superiority of our method.