Towards sustainable energy use: Reinforcement learning for demand response in commercial buildings
Bibliographic record
Abstract
Demand response (DR) is a crucial strategy for balancing electricity demand and reducing environmental impact, especially as power consumption continues to rise. Small and medium-sized commercial buildings hold significant potential for DR implementation due to their widespread presence and substantial contribution to overall energy use. This study proposes a novel framework to optimize energy management in these buildings by considering three types of loads: non-controllable, controllable with discrete action spaces (HVAC), and controllable with continuous action spaces (lighting). The objective is to minimize costs, reduce CO 2 emissions, improve occupant comfort, and shave peak loads as a unified goal. State-of-the-art reinforcement learning (RL) algorithms are employed and compared against traditional heuristic methods using real-world data. Results show that RL-based approaches can significantly lower energy costs and environmental impacts while maintaining occupant comfort, even under varying outdoor temperature conditions. By incorporating risk assessments through Value at Risk (VaR) and Conditional Value at Risk (CVaR) metrics, this study offers a robust solution for sustainable energy management, providing insights for policymakers and industry practitioners aiming for a more resilient energy future.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".