MétaCan
Menu
Back to cohort

DCML: Boosting Applying Experience of NILM with Dilated Convolution and Multi-Task Learning

2024· article· en· W4402812082 on OpenAlexaff
ZhangMengru Zhao, Fan Wu, Huaqing Wu, Tong Liu, Conghao Zhou, Jun Ma, Yongmin Zhang, Feng Lyu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicText and Document Classification Technologies
Canadian institutionsUniversity of WaterlooUniversity of Calgary
FundersResearch and DevelopmentCentral South UniversityNational Natural Science Foundation of China
KeywordsBoosting (machine learning)Computer scienceConvolution (computer science)Task (project management)Artificial intelligenceEngineering

Abstract

fetched live from OpenAlex

Non-intrusive load monitoring (NILM) is a promising approach for recognizing various electrical equipment energy usage patterns from aggregate load data. In this paper, we investigate the development of an NILM model to achieve high recognition accuracy, ensure a small model size for lightweight implementation, and enhance its adaptability to a wide range of appliance types. Specifically, we propose a framework named DCML, which employs dilated convolution to precisely control the receptive field, allowing efficient adjustments in feature extraction granularity to meet the specific requirements of different appliances. In addition, multi-task learning techniques are incorporated to allow simultaneous recognition of multiple appliances from a single model, saving model space while ensuring high recognition accuracy. Compared to the benchmark, our model reduces the recognition mean absolute error (MAE) by $36.8 \%, 16.8 \%$, and $43.8 \%$ for fridges, microwaves, and washing machines, respectively. Furthermore, the proposed DCML can significantly save the storage space of convolutional layers when simultaneously recognizing multiple appliances.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.002
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.021
GPT teacher head0.262
Teacher spread0.241 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicText and Document Classification TechnologiesFrench-language works237,207