A Wasserstein Metric Based Distributionally Robust Synthesis Sparse Coding for NILM

Non-Intrusive Load Monitoring (NILM) is a pivotal technology in energy management and conservation. It involves disaggregating the total electrical consumption of a household into individual appliances without the need for dedicated sensors on each appliance. Sparse coding, a powerful technique in machine learning and signal processing, has gained attention in recent years for its potential to enhance the accuracy and robustness of NILM algorithms. This paper constructs an ambiguity set by using Wasserstein distance, and furtherly proposes a distributionally robust Synthesis Sparse Coding for the NILM problem. An approximation, which is a semi-infinite optimization problem, of the proposed model is given and solved by using constraints generating method. The dataset UK-DALE is used in our experiments to verify the effectiveness and robustness of our model. The simulation results show that the proposed model is effective and suitable for applying in NILM.

Authors

Institutions

Publication Details

Published
2024-09-20
DOI
https://doi.org/10.1109/icbase63199.2024.10762268
Primary Topic
Advanced Data Compression Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Wasserstein Metric Based Distributionally Robust Synthesis Sparse Coding for NILM

Shifei Chen, Linfeng Yang, Jie Li, Yong Tang
Advanced Data Compression Techniques
article

A Wasserstein Metric Based Distributionally Robust Synthesis Sparse Coding for NILM

Shifei Chen, Linfeng Yang, Jie Li, Yong Tang
article en

Abstract

Non-Intrusive Load Monitoring (NILM) is a pivotal technology in energy management and conservation. It involves disaggregating the total electrical consumption of a household into individual appliances without the need for dedicated sensors on each appliance. Sparse coding, a powerful technique in machine learning and signal processing, has gained attention in recent years for its potential to enhance the accuracy and robustness of NILM algorithms. This paper constructs an ambiguity set by using Wasserstein distance, and furtherly proposes a distributionally robust Synthesis Sparse Coding for the NILM problem. An approximation, which is a semi-infinite optimization problem, of the proposed model is given and solved by using constraints generating method. The dataset UK-DALE is used in our experiments to verify the effectiveness and robustness of our model. The simulation results show that the proposed model is effective and suitable for applying in NILM.

Guangxi University (CN)
Research and Development
Openalex Percentile: Top 79%
Advanced Data Compression Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.