Papers › Closing the Loop: A Framework for Trustworthy Machine Learning in Power Systems

Closing the Loop: A Framework for Trustworthy Machine Learning in Power Systems

14 Mar 2022arXiv:2203.07505archive 2025-07-28

Jochen Stiasny, Samuel Chevalier, Rahul Nellikkath, Brynjar Sævarsson, Spyros Chatzivasileiadis

Deep decarbonization of the energy sector will require massive penetration of stochastic renewable energy resources and an enormous amount of grid asset coordination; this represents a challenging paradigm for the power system operators who are tasked with maintaining grid stability and security in the face of such changes. With its ability to learn from complex datasets and provide predictive solutions on fast timescales, machine learning (ML) is well-posed to help overcome these challenges as power systems transform in the coming decades. In this work, we outline five key challenges (dataset generation, data pre-processing, model training, model assessment, and model embedding) associated with building trustworthy ML models which learn from physics-based simulation data. We then demonstrate how linking together individual modules, each of which overcomes a respective challenge, at sequential stages in the machine learning pipeline can help enhance the overall performance of the training process. In particular, we implement methods that connect different elements of the learning pipeline through feedback, thus "closing the loop" between model training, performance assessments, and re-training. We demonstrate the effectiveness of this framework, its constituent modules, and its feedback connections by learning the N-1 small-signal stability margin associated with a detailed model of a proposed North Sea Wind Power Hub system.

PaperPDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2203.07505")

Code

Syntology Ran 0 of 11 code samples harvested from 1 repository linked to this paper; 11 have no recorded run.

By repository: official repository: 11 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

jbesty/irep_2022_closing_the_loop officialmentioned in papermentioned on GitHubpytorchMIT 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

11 samples harvested; 0 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

11unverified

Licence: 0 of the 11 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 jbesty/irep_2022_closing_the_loop. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

NSWPH_Eigen_Decomposition jbesty/irep_2022_closing_the_loop/dataset_creation/NSWPH_functions.py official repository unverified MIT (permissive) · ccf88b72a2929c90 · report
build_optimiser jbesty/irep_2022_closing_the_loop/neural_network_training/neural_network_functions.py official repository unverified MIT (permissive) · b6fa16ee0e0a2518 · report
c_linear0 jbesty/irep_2022_closing_the_loop/dataset_creation/NSWPH_models_linear.py official repository unverified MIT (permissive) · b1003ed049c69112 · report
compute_damping_ratio jbesty/irep_2022_closing_the_loop/dataset_creation/NSWPH_models_linear.py official repository unverified MIT (permissive) · 0272d8ebc3be8d0f · report
compute_eig_damping jbesty/irep_2022_closing_the_loop/dataset_creation/NSWPH_functions.py official repository unverified MIT (permissive) · b3722c24436190ad · report
converter_linear jbesty/irep_2022_closing_the_loop/dataset_creation/NSWPH_models_linear.py official repository unverified MIT (permissive) · 8930d6e8add2de1c · report
d_dcline_dt jbesty/irep_2022_closing_the_loop/dataset_creation/NSWPH_models.py official repository unverified MIT (permissive) · 1e2693880edf539a · report
d_vs_dt jbesty/irep_2022_closing_the_loop/dataset_creation/NSWPH_models.py official repository unverified MIT (permissive) · 26a7aae17270bc89 · report
d_vsc_dt jbesty/irep_2022_closing_the_loop/dataset_creation/NSWPH_models.py official repository unverified MIT (permissive) · 5b23ef710990c7f4 · report
min_and_max_output_layer jbesty/irep_2022_closing_the_loop/verification/verification_model.py official repository unverified MIT (permissive) · 2cd42440e6a22c4f · report
standardise_network jbesty/irep_2022_closing_the_loop/neural_network_training/neural_network_functions.py official repository unverified MIT (permissive) · 4d823ac378ab5e50 · report

Tasks

BIG-bench Machine LearningDataset Generation

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