acceptodds
Withdrawn from ICLR 2027

Graph Logic Flows: Global Constrained Transport for Dynamic Graph Prediction

Withdrawn from ICLR 2027, so left out of the paper lists and the map.

Abstract

Temporal graph models typically hide each state transition inside memory, attention, or neighbourhood operations, making the transition difficult to inspect as a single computational object. Graph Logic Flows (GLF) takes a different view: each snapshot transition is defined by one global constrained transport problem on a learned graph geometry. GLF transports a node belief distribution over learned positive edge weights; temporal total variation acts directly on the state update, while Bellman consistency shapes the learned graph potential during training. Solving the transport problem produces the next belief state and edge transport variable together with numerical and structural diagnostics of the same transition. We derive a finite-step bound for the state-coupled residual penalty and specialise standard Wasserstein stability results to the learned geometry. On the JODIE Wikipedia, Reddit, and LastFM benchmarks under a 100-negative full-node protocol, GLF has mean MRR close to TGN on Wikipedia and LastFM and higher than TGN on Reddit. Residual ablations show that the structural terms materially affect prediction, while fixed-probe rankings recover the temporal smoothness induced by TV. On Wikipedia, GLF trains substantially faster than TGAT and DyGFormer, and the matched single-file implementation processes the tested snapshots faster than all three baseline reproductions. Together, these results suggest a different design principle for temporal graph learning: make the state transition an explicit, solved object so that prediction and evidence about how the state changed arise from the same update.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
Temporal graph learning, dynamic graphs, optimal transport, dynamic link prediction

Reviews

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

This paper proposes Graph Logic Flows (GLF), which reformulates temporal graph state transitions as a global constrained optimal transport problem. GLF maintains a belief distribution μt∈Δn\mu_t \in \Delta^n over nodes and computes each new state by solving a JKO proximal step with learned edge conductances, a graph-dependent energy, and structural residual penalties (Bellman consistency and temporal total variation). The paper argues that this makes state transitions an explicit, inspectable object — prediction and diagnostic evidence arise from the same solve. The method is evaluated on three JODIE benchmarks for dynamic link prediction.

Critical strengths
  1. Casting temporal graph transitions as explicit optimal transport problems is genuinely original. The connection between JKO schemes, Wasserstein gradient flows, and temporal graph learning is intellectually compelling and opens an interesting research direction.

  2. Once one accepts the belief-state formalism, the framework does produce a rich set of diagnostic quantities (KKT residuals, transport action, energy change, TV) as natural byproducts. The discovery of three operational regimes (active transport, zero transport, collapse) in the history-window experiment is an empirical finding that would be invisible in conventional architectures.

  3. GLF is significantly faster than attention-based methods (TGAT, DyGFormer).

Critical weaknesses

The paper's core selling point is that GLF makes state transitions interpretable — "prediction and evidence about how the state changed arise from the same update." However, this interpretability is procedural rather than semantic. The belief distribution μt(i)\mu_t(i) is called "belief mass," but the paper never defines what this quantity actually means. It is not a posterior probability over node labels, not a population distribution, not a PageRank-style stationary measure, not a likelihood. It is simply a non-negative vector constrained to sum to one — a mathematical vessel chosen to enable optimal transport machinery. This creates a fundamental contradiction: GLF offers a fully transparent account of how an undefined quantity is optimally transported. The transport cost, edge flows, KKT residuals, and energy changes are all precisely characterized, but they describe the movement of something whose meaning is unspecified. Telling a practitioner that "0.03 units of belief mass moved from node ii to node jj at cost 0.7" is not interpretable if neither "belief mass" nor the cost have grounded meaning.

The scoring function further exposes this issue: score(u,v)=αlog⁡μt(v)+β(zu⊤zv+bv)\text{score}(u,v) = \alpha \log \mu_t(v) + \beta(z_u^\top z_v + b_v) Here log⁡μt(v)\log \mu_t(v) functions as a destination popularity bias, while the actual source-destination matching comes from a standard shallow embedding zu⊤zvz_u^\top z_v that is entirely disconnected from the transport framework. The paper does not ablate these two components, leaving open the possibility that the transport-derived belief contributes little beyond what a simple node-level score would provide.

Questions for authors
  1. Can you provide a concrete, domain-grounded interpretation of what μt(i)=0.03\mu_t(i) = 0.03 means for a specific node in, say, the Wikipedia dataset? How should a practitioner interpret the transport of this quantity?

  2. What happens when you ablate α=0\alpha = 0 (no belief term) vs. β=0\beta = 0 (no embedding term) in the scoring function? How much does the transport-derived belief actually contribute to link prediction?

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

The paper proposes Graph Logic Flows (GLF), which keeps one belief distribution over nodes and updates it once per snapshot by solving a convex transport problem: the new belief trades off a learned energy against the cost of moving mass along the current edges (a Jordan–Kinderlehrer–Otto, or JKO, step). Learned edge weights set how cheaply belief moves along the current edges, and a learned potential sets the preferred states. A temporal total-variation (TV) penalty, switched on and off by a rule-based controller, limits change, while a "Bellman" term regularises the potential during training. For link prediction, each candidate edge (u, v) is ranked by a score combining the belief at v with static embeddings of u and v.

The paper's main claim is interpretability: because each graph update is an explicit optimisation, the solver's own outputs (residuals, energy change, transport effort) are meant to show how the state changed. The paper supports the method with stability theory and reports mean reciprocal rank (MRR) on the Wikipedia, Reddit and LastFM interaction datasets released with JODIE (Kumar et al., 2019). In terms of MRR, GLF is close to TGN (Rossi et al., 2020), and above it on Reddit; TGAT (Xu et al., 2020) and DyGFormer (Yu et al., 2023) are compared on Wikipedia only, where both outperform GLF (TGAT by a wide margin).

The overall story requires some effort to follow, and the method is difficult to reconstruct from the text alone.

  • Several abbreviations are never introduced (MRR, JKO, KKT, TV), and several terms are never defined (hysteresis, dwell time, graph drift, K_max, the "persistence heuristic").
  • Several symbols are never defined (X_t, R_{r,t}, w_base), and line 165 writes D_A = diag(A(e)) with a free index e.
  • Key details are missing: the training loss and its negatives, the input features, the initial belief, and which edges form G_t when a bin is scored.
  • The text has internal inconsistencies: the solver is called primal–dual hybrid gradient (PDHG) but listed with ADMM (alternating direction method of multipliers) iterations in Table 6, Table 10 reports 17/20 runs at MRR ≥ 0.70 where its own values give 16/20, and CAW (causal anonymous walks) is attributed to Xu et al. (2020), the TGAT paper, while the CAW paper itself (Wang et al., ICLR 2021) is not cited.

An explicit convex transition that reports how it was obtained is an interesting idea, but the paper does not yet show what it offers. The solve's contribution is not isolated, the diagnostics mainly detect the model's own failed runs, and the theory largely restates standard results.

  • GLF is only slightly above simple floors and below the persistence heuristic on Reddit, so the predictive value of the transport solve is not established.
  • The baselines appear considerably weaker than published results and are incomplete, and training appears unstable.
  • The theory's Wasserstein framing does not hold, the derivations contain errors, and the results do not cover the implemented method.
Critical strengths
  1. The design is distinctive and cheap: one convex problem per snapshot, shared by all queries, is under-explored for temporal graph models, and its solver quantities flag the "zero-transport" failure regime that validation MRR misses (App. C.3).
  2. The reporting is transparent: seed-level results, labelled failure regimes, run provenance, and failed runs kept in the averages make the paper easy to audit, with its own appendix documenting most of the weaknesses below.
Critical weaknesses
  1. The experiments do not yet show that the transport solve helps prediction. Each test edge is ranked against 100 negatives (non-interacting candidate destinations) drawn from all nodes, but only items can be destinations, so simple floors are high (top two rows computed by us from the JODIE node counts):

    MRRWikipediaRedditLastFM
    Random ranking of the 101 candidates0.050.050.05
    Node type only: items above users, random order within0.270.310.09
    Persistence heuristic (Sec. 6.1, App. C.3)0.305≈0.755–
    GLF with zero transport (App. C.3)0.310–0.315––
    GLF (Table 1)0.3190.6930.116
    TGN reproduction (Table 1)0.3260.5480.125
    DyGFormer reproduction (Table 1)0.371––
    TGAT reproduction (Table 1)0.572––
    • GLF is close to these floors, and its baselines appear weak or are missing. On Wikipedia and LastFM, GLF (like TGN) is only slightly above a node-type-only ranker, and with zero transport it already matches its headline Wikipedia score. A persistence heuristic, absent from Table 1, matches or beats GLF. On Reddit, the only dataset where GLF outperforms TGN, the gain is not significant with matched seed counts and is not tested against TGAT or DyGFormer. The reimplemented baselines appear considerably weaker than published results: TGAT, for instance, ranks far above DyGFormer and TGN, contrary to the literature.
    • The ablation does not support the chosen configuration: in Table 3, the full model scores below both single-residual variants, and this is not discussed.
    • Training appears unstable: half of the history-window runs collapse or never transport, and repeated executions of the same protocol differ by more than most reported gaps.
  2. The theory does not match the implemented method, and the diagnostic claims are not yet demonstrated.

    • The transport geometry is not Wasserstein: the cost in Eq. (1) ignores how much belief sits on an edge, so W is a fixed quadratic (negative-Sobolev, H^{-1}) norm of µ_1 − µ_0 rather than the discrete Wasserstein metric of Maas (2011), which is not cited. Rancati, Maas & Locatello (ICML 2026) would also be worth discussing.
    • The theory largely builds on standard results, contains errors, relies on strong assumptions that are not verified, and concerns exact solves whereas the method runs a fixed-budget solver. Regarding the errors, the evolution variational inequality (EVI) derivation in App. B.1 does not hold as written: Eqs. (10) and (12) reverse their inequalities, so that combined they give the opposite of Eq. (9), and the stated EVI has κ where the standard result gives κ/2 (for E(x) = κx^2/2 and ν = 0, Eq. (6) reads 0 ≤ −κx^2/2). See also Questions 5 and 6 below.
    • The value of the diagnostics is not yet demonstrated: so far they are used to flag GLF's own failed runs.
Questions for authors

Clarifications that could change my assessment:

  1. Which edges define the graph G_t used to compute the state that scores the test edges of bin t: bin t itself, bin t−1, or all earlier edges? Sec. 4, Alg. 2 and App. C.2 read as if bin t's own edges are used. If so, the state would already encode the edges it is meant to predict (e.g., through destination degrees), inflating the reported MRRs.
  2. Why is Reddit MRR not reported for TGAT and DyGFormer, given that both were run on Reddit for Table 2?
  3. How is the persistence heuristic defined, and why is it absent from Table 1? Why does it outperform GLF on Reddit, and why does TGN score so far below it (0.548 vs ≈0.755)?
  4. What motivates using the full model as the default, given that the ablation in Table 3 favours using either residual alone?
  5. As written, Theorem 1 covers only TV, whose feasible set {‖µ − µ_{t−1}‖ ≤ 0} (Prop. 2, Eq. 3) is the single point µ_{t−1}. How is R_{r,t}, the residual penalised in Eq. (4), defined, and does it include a margin?
  6. Eliminating the flow in Eq. (4) gives a penalty W^2/(2τ^3) rather than the JKO penalty W^2/(2τ): the constraint scales the flow by τ, while the cost divides the flow energy by 2τ. Is this a typo? If not, the τ-dependent results in Sec. 5 describe a different step.

Experiments that could change my assessment:

  1. Results for the following, on one shared set of destination-only negatives (e.g., the protocols of the Temporal Graph Benchmark, TGB (Huang et al., 2023), or DyGLib (Yu et al., 2023)):
    • GLF scored with each term of Eq. (5) alone: static embeddings only (α = 0) and belief only (β = 0);
    • persistence, popularity and EdgeBank (Poursafaei et al., 2022) baselines;
    • baselines whose performance matches published numbers.

Future work (does not affect my score):

  1. A case study showing that the diagnostics explain a prediction.
Reviewer_2L1ROpenReview ↗
Rating
2
Confidence
2
Informativeness
2
Presentation
1
Soundness
2
Read review
Paper summary

This paper reformulates a temporal graph snapshot transition as a globally constrained transport problem. The states are defined as a probability distribution over all nodes, and is updated with a JKO/PDHG solve on a learned edge geometry on the current edge set. On benchmarks including Wiki, Reddit and LastFM, it outperforms or being competitive compared with other attention-based SoTAs. It trains faster than attention-based baselines.

Critical strengths

The idea seems novel; it formulates state transition as an explicitly solved constrained transport problem.

Empirical results are solid. Evaluated on Wikipedia, Reddit, and LastFM benchmarks, against SoTA methods TGN, TGAT, and DyGFormer, GLF is competitive with TGN on Reddit and LastFM. However it falls below other baselines on different benchmarks. Sufficient experimental details are provided.

Critical weaknesses

It seems to be a conceptual limitation to use node-wise distribution only for state representation, whereas edge-wise distribution is discarded after each snapshot.

The edge geometry is restricted on present edges which requires a lot of iterations to learn the right geometry across all pairs of nodes. Modelling all node pairs directly would resolve this but is computationally infeasible. This dilemma is never acknowledged.

The method loses to baselines on different benchmarks and not sufficient explanation/discussion is provided.

The number of PDHG solver iteration is crucial to learn the right distribution, but currently these critical hyperparameters are only briefly mentioned in Table 6 (\mu=20, admm=4, does this mean a total of 80 iterations?). More thorough discussion of the choice and how it affects modeling power is necessary.

Only training time on Wiki is reported.

Questions for authors

See weakness.

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

Related papers

Discussion (0)

Sign in to comment.