From Graph Theory to Graph Neural Networks (GNNs): The Opportunities of GNNs in Power Electronics
Bibliographic record
Abstract
Graph theory within power electronics, developed over a 50-year span, is continually evolving, necessitating ongoing research endeavors. Facing with the never-been-seen explosion of graph-structured data, the state-of-the-art deep learning technique-Graph Neural Networks (GNNs), becomes the leading trend in machine learning within just recent five years and demonstrated surprisingly broad and prominent benefits covering from new drug discovery to better IC design. However, its promising applications in Power Electronics are still rarely discussed and its full potential remains unexplored. Addressing this gap, this review paper is the first to outline GNNs’ general workflow in power electronics, laying the groundwork and examining current GNN methodologies within the field. To bridge the gap in the sparse GNN literature within this domain, we also provide extended discussions on leveraging insights from GNN-aided circuit design to enrich power electronics research. Our work includes in-depth GNN-based case studies that demonstrate promising applications from converters to system-level power electronics, showcasing GNNs’ unique benefits and untapped possibilities (e.g., accurate component design, voltage predictions on IEEE-13 bus and 118 bus systems). Additionally, we provide a comprehensive survey of GNNs’ latest and successful applications, emphasizing their impact on energy-centric sectors, such as transportation electrification, smart grids. Considering the interdisciplinary nature of power electronics in modern energy systems, our review highlights the potential of GNNs emerge as a promising tool to decode the intricate behavior and dynamics of power electronics systems, and we hope such synergies between advanced AI methodologies like GNNs with the ever-evolving graph theory can lead to more powerful tools, novel methodologies, and advancements in the power electronics community.
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.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".