Machine Learning Systems Tuned by Bayesian Optimization to Forecast Electricity Demand and Production
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Given the critical importance of accurate energy demand and production forecasting in managing power grids and integrating renewable energy sources, this study explores the application of advanced machine learning techniques to forecast electricity load and wind generation data in Austria, Germany, and the Netherlands at different sampling frequencies: 15 min and 60 min. Specifically, we assess the performance of the convolutional neural networks (CNNs), temporal CNN (TCNN), Long Short-Term Memory (LSTM), bidirectional LSTM (BiLSTM), Gated Recurrent Unit (GRU), bidirectional GRU (BiGRU), and the deep neural network (DNN). In addition, the standard machine learning models, namely the k-nearest neighbors (kNN) algorithm and decision trees (DTs), are adopted as baseline predictive models. Bayesian optimization is applied for hyperparameter tuning across multiple models. In total, 54 experimental tasks were performed. For the electricity load at 15 min intervals, the DT shows exceptional performance, while for the electricity load at 60 min intervals, DNN performs the best, in general. For wind generation at 15 min intervals, DT is the best performer, while for wind generation at 60 min intervals, both DT and TCNN provide good results, in general. The insights derived from this study not only advance the field of energy forecasting but also offer practical implications for energy policymakers and stakeholders in optimizing grid performance and renewable energy integration.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it