Privacy-preserving, Lightweight, and Decentralized Load Forecasting in Smart Grid AMI Networks
Bibliographic record
Abstract
Load forecasting (LF) in smart grids is beneficial not only in mitigating equipment failures and power outages but also in facilitating effective power dispatching and infrastructure planning. To predict future loads accurately, the consumers' fine-grained energy consumption readings are fed into machine-learning (ML) models. However, revealing these readings enables adversaries to deduce confidential information about consumers, including details about their lifestyle, and hence their privacy is violated. To address this privacy issue, the existing works only focus on using federated learning (FL)-based approaches to train and obtain an accurate global LF model. Nevertheless, addressing the privacy violation problem during the LF process (in the deployment phase) after obtaining the global model for AMI networks has not been well investigated yet. Therefore, this paper proposes a novel, efficient, and decentralized approach that enhances the precision of LF while safeguarding the privacy of consumers. The proposed scheme incorporates inner product functional encryption (IPFE) to allow smart meters (SMs) to encrypt their readings with no need for a trusted key distribution center (KDC) while allowing LF without divulging or acquiring knowledge of the consumers' readings to protect their privacy. In addition, a hybrid deep learning approach is developed to construct an LF model that can yield precise forecasts. To show the feasibility of the proposed scheme, the performance of our scheme was assessed on a real energy consumption readings dataset, and the results demonstrate proficiency in LF while providing robustness and privacy preservation with reasonable communication efficiency.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".