acceptodds
Under review as a conference paper at ICLR 2027

Pressure–Vorticity–Reaction Graph Networks: Structured Topological Memory and Safe Learned Dynamics

Abstract

Learning constrained graph dynamics requires conservation, long-lived state, nonlinear response, and hard constraints. We introduce the Pressure–Vorticity–Reaction Graph Network (PVR-GN), which separates these roles. Pressure is a particular flow satisfying the current divergence; Vorticity is a persistent cycle-space state that stores topological memory without changing nodal conservation; and Reaction is a small causal proposal passed through a feasibility-preserving operator. We state the shared-budget allocation identity used by the cell, derive an allocation-free feasible set, and give fixed-active-set KKT sensitivities for the continuous projection branch. On a precommitted blind synthetic benchmark, PVR has zero observed rollout failures and favorable central comparisons with raw GNN/GRU baselines. A clustered reanalysis selects the 3,025-parameter PVR-Compact: its Blind-ID NMSE is lower than PVR-Strong by 0.001799 (95% CI [0.000526, 0.003124]); the pooled Blind-OOD difference is 0.000202 and its CI includes zero. In a separate control pilot, removing Vorticity or Reaction increases overloaded NMSE by 0.70706 or 0.02398; removing safe return yields 87.5% rollout failure under overload. A semantics-preserving same-A100 refactor reduces median paired Compact latency by 18.939%, although not uniformly. An independent static PGLib/MATPOWER DC-OPF study finds favorable held-out accuracy–compactness, numerically close scale transfer, and mixed rankings under severe congestion. In a separately frozen case57 test, a DC3-style DC-OPF adaptation (post-hoc) is natively feasible on both strata, while PVR-DC has lower dispatch MSE after common repair. PVR is a compact, auditable inductive bias for constrained graph dynamics, not a universal optimizer.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
Graph neural networks, constrained graph dynamics, topological memory, cycle-space representations, Hodge decomposition, differentiable optimization, safe learning, physics-informed machine learning

Reviews

Among:
Shape:
1234this paper, Bottom 1%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 1.00 over 3 reviews, above 0% of the others.
Reviewer_MF2dOpenReview ↗
Rating
1
Confidence
1
Informativeness
2
Presentation
1
Soundness
2
Read review
Paper summary

The manuscript investigated a study for learning constrained graph dynamics by introducing a decomposition into pressure, vorticity, and reaction roles. Therefore, several strategies are developed, such as divergence-free graph memory, and shared-capacity reaction. Various evaluations were conducted on synthetic benchmarks.

Critical strengths
  1. Attempting a challenge in learning constrained graph dynamics
  2. Undertaking a wide range of evaluation with good discussions
Critical weaknesses
  1. Very difficult to gain the context of the work. In particular, many terms appear suddenly, such KKT in Abstract, GNN (Graph Neural Network???), GRU (Gated Recurrent Unit???); PVR-Compact, PVR-Strong, Compact-Strong, …

  2. Unclear motivation. In line 044, several aspects of the graph systems were mentioned, such as nodal conservation, circulation, and capacity. It lacks transition into Line 049 “We propose”.

  3. The language presentation makes the thesis read more like an experimental report.

Questions for authors
  1. Clearly justify the motivation of the work and articulate the contributions. The current list of contributions read more like a list of system functions.

  2. The related Work reads like this manuscript is attempting many aspects or things all together.

  3. Provide clear formulation of the task. For example, it is challenging to understand Equations (1) and (2).

Reviewer_6zonOpenReview ↗
Rating
1
Confidence
2
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper proposes a new GNN architecture, Pressure–Vorticity–Reaction GNN, to learn constrained dynamics over graphs. PVR separates flow conservation, cycle-space memory, and learned reactions, while using a safety mechanism to enforce constraints. They evaluate the method on synthetic dynamic tasks and power grid optimization benchmarks.

Critical strengths
  1. The architecture separates flow conservation, cycle-space memory, and learned adaptation, making the model more interpretable and allowing it to satisfy physical constraints by design.

  2. PVR achieves competitive accuracy with much fewer parameters than the GNN and GRU baselines.

Critical weaknesses
  1. PVR is compared against standard GNN and GRU baselines only, but not more closely related physics-informed or Hodge-based GNN architectures. This makes it difficult to assess the benefits of PVR over existing structure-aware methods.

  2. The synthetic benchmark is well aligned with PVR's structure, while the power grid experiments do not use the Vorticity module, leaving its key memory mechanism insufficiently validated.

  3. PVR does not show significant accuracy improvements over safety-wrapped GNN and GRU baselines, raising questions about the practical benefits of its more complex architecture. Afterall, parameter efficiency is not the primary concern for these scenarios.

Questions for authors
  1. Why not compare PVR with physics-informed or Hodge-based GNNs?
  2. Could the authors provide evidence that PVR, especially, the proposed memory mechanism is effective on an independent real-world dynamic task?
  3. What are the practical advantages of PVR over these baselines, other than having fewer parameters?
Reviewer_L9hbOpenReview ↗
Rating
1
Confidence
3
Informativeness
1
Presentation
1
Soundness
1
Read review
Paper summary

The paper introduces the Pressure-Vorticity-Reaction Graph Network. The main idea seems to be that to learn constrained graph dynamics, we should rely on known structural concepts (pressure and vorticity), and only learn the reaction part that's not known analytically. The paper presents several hard-to-understand experiments.

Critical strengths

None

Critical weaknesses
  • The paper lacks any coherent context and motivation. It doesn't attempt to place itself in the current literature in any serious way.
  • The paper uses many unexplained terminologies and notations. This coupled with an arcane explanation style make even the main contribution section (Section 3) impossible to understand after repeated attempts to seriously read it.
  • Likewise, the experiment section is impossible to understand.
Questions for authors

Can you explain what the paper contributes in plain English?

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.