Papers › Sequence-to-point learning with neural networks for nonintrusive load monitoring

Sequence-to-point learning with neural networks for nonintrusive load monitoring

29 Dec 2016arXiv:1612.09106archive 2025-07-28

Chaoyun Zhang, Mingjun Zhong, Zongzuo Wang, Nigel Goddard, Charles Sutton

Energy disaggregation (a.k.a nonintrusive load monitoring, NILM), a single-channel blind source separation problem, aims to decompose the mains which records the whole house electricity consumption into appliance-wise readings. This problem is difficult because it is inherently unidentifiable. Recent approaches have shown that the identifiability problem could be reduced by introducing domain knowledge into the model. Deep neural networks have been shown to be a promising approach for these problems, but sliding windows are necessary to handle the long sequences which arise in signal processing problems, which raises issues about how to combine predictions from different sliding windows. In this paper, we propose sequence-to-point learning, where the input is a window of the mains and the output is a single point of the target appliance. We use convolutional neural networks to train the model. Interestingly, we systematically show that the convolutional neural networks can inherently learn the signatures of the target appliances, which are automatically added into the model to reduce the identifiability problem. We applied the proposed neural network approaches to real-world household energy data, and show that the methods achieve state-of-the-art performance, improving two standard error measures by 84% and 92%.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 7 code samples harvested from 1 repository linked to this paper: 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: community (archive-listed): 7 samples from 1 repository, 6 ran (6 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

JackBarber98/pruned-nilm mentioned on GitHubtfSyntology: not harvested report
JackBarber98/prunedNILM mentioned on GitHubtfSyntology: not harvested report
OdysseasKr/online-nilm mentioned on GitHubtfSyntology: not harvested report
SergiBragos/DLAI-2021-project mentioned on GitHubpytorchnot reachable when probed 2026-09-17 — repositories for recent papers often appear after camera-readySyntology: not harvested report
inesylla/energy-disaggregation-DL mentioned on GitHubpytorchSyntology: not harvested report
mahnoor-shahid/seq2point mentioned on GitHubpytorchSyntology: not harvested report
pawan47/nilmtk_readings mentioned on GitHubSyntology: not harvested report
redefik/ConvNILM mentioned on GitHubtfMITSyntology: 7 samples, 6 ran (0 instrument-failed) · 1 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested: 6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

6ran
1unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from redefik/ConvNILM. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

redefik/ConvNILM community (archive-listed) 7 samples, 6 ran (0 instrument-failed) · 1 unverified
build_dishwasher_cnn data_model.py ran MIT (permissive) · 2b80bdb60f2ac7e2 · report fixture: signature window_size:int/0/int, evaluation_metric:callable/0/? · returned Sequential · level recorded 2026-09-26
compute_F1_score metrics.py ran fingerprinted MIT (permissive) · 506bf71f8c3d91a6 · report fixture: signature predicted_values:ndarray/1/float, ground_truth:ndarray/1/float · returned float32 · level recorded 2026-09-26
normalize_data in 32 papers
census: 7 implementations from 7 papers, 7 distinct outputs across 3 buckets, one shared input per bucket
data_preprocessing.py ran fingerprinted MIT (permissive) · a53d60ecd9334fa2 · report fixture: signature data:ndarray/2/float, min_value:float/0/float, max_value:float/0/float · returned ndarray · level recorded 2026-09-26
read_csv_data in 6 papers data_loading.py ran MIT (permissive) · 473e83322a8f9bf0 · report fixture: signature path_to_dataset:str/0/str · returned Series · level recorded 2026-09-26
train_test_split in 23 papers data_preprocessing.py ran MIT (permissive) · 4c2734292602ee09 · report fixture: signature time_series:Series/1/float, train_end_timestamp:str/0/str · returned tuple · level recorded 2026-09-26
train_val_test_split in 15 papers data_preprocessing.py ran MIT (permissive) · fc452ed44ce06dea · report fixture: signature time_series:Series/1/float, train_start_timestamp:str/0/str, train_end_timestamp:str/0/str, val_end_timestamp:str/0/str · returned tuple · level recorded 2026-09-26
build_fridge_cnn data_model.py unverified MIT (permissive) · abb3295c5a862230 · report

Tasks

blind source separation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections