- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes Field Neural Networks (FNNs), which model interaction streams as the evolution of a latent field over a set of entities. Starting from a driven, damped field equation derived from a quadratic Lagrangian density, the authors treat each entity as a location in a discrete field. The continuous field becomes a latent node-state matrix, external forcing becomes an event-derived forcing term weighted by learned pairwise gates, and the spatial Laplacian becomes a graph operator. From this they derive a first-order variant (explicit Euler, diffusion-like) and a second-order variant (with a velocity-like state and a symplectic-Euler-style update, wave-like). Neither the field nor the velocity is supervised directly; all components are trained end to end through a downstream prediction loss. On controlled diffusion and wave simulations over five hidden topologies, FNN achieves lower force-prediction error over 20-step rollouts than GRU, DeepSets, SetTransformer, Hopfield, LNN, and HNN baselines, and the authors further study recovery of the generating topology and coefficients. On nine DyGLib temporal link-prediction benchmarks, FNN is competitive with established temporal graph models on several datasets while using roughly an order of magnitude fewer parameters. Mechanistic ablations show that the contribution of individual components, such as learned coefficients and velocity features, varies across datasets. The authors therefore position field equations as a compact, interpretable inductive bias rather than as physical laws to be recovered.
Critical strengths
-
A clear, well-motivated formulation with interpretable mechanisms. The model is derived cleanly from a quadratic Lagrangian density through the Euler–Lagrange equation to explicit (first-order) and symplectic-Euler-style (second-order) discrete updates. The derivations in Appendices A–C are self-contained and easy to follow. Each coefficient maps onto a distinct mechanism: forcing, damping, restoration, coupling, and inertia. This lets the authors freeze, perturb, or hide individual components, which is a real interpretability advantage over black-box memory modules such as TGN's GRU-based memory.
-
Strong parameter efficiency. On the real-world benchmarks, FNN uses fewer than 100K parameters, roughly an order of magnitude fewer than TGN (~964K). It remains competitive on several datasets (UCI, Flights, Contact, UN Trade) and lies on the accuracy–parameter Pareto frontier (Figs. 5 and A12). This is practically relevant for resource-constrained settings.
-
Careful mechanistic ablations and an honest treatment of identifiability. Tables A3–A7 separate retrained ablations from post-hoc interventions, and "does learning the coefficients matter?" from "does the readout use the velocity state?". The mechanism map in Fig. A13 is genuinely informative: UCI depends on learned coefficients, whereas UN Trade depends on direct velocity access. I also appreciate that Appendix E.1 does not overclaim parameter recovery. The authors openly show that joint optimization converges to compensating, off-target configurations, and that generator values are recovered only under alternating updates with an oracle topology.
Critical weaknesses
1. The synthetic experiments are largely circular, and the baselines are weak.
- The simulator uses exactly the FNN update rules (Eqs. 9 and 13). The pairwise force in Appendix D.1 is precisely a graph-Laplacian term. FNN's advantage is therefore expected by construction. The authors themselves note that FNN becomes a near-perfect predictor when initialized with the true coefficients.
- Most baselines (GRU, DeepSets, SetTransformer, modern Hopfield, LNN, HNN) are not graph or temporal-graph models. More natural competitors are missing, such as GRAND, GraphCON, graph neural ODEs, and TGN. LNN and HNN are frequently "out of range," which raises questions about whether they were tuned fairly.
- There is no test under model misspecification, for example nonlinear dynamics, Kuramoto- or SIR-type spreading, heterogeneous coefficients, or directed coupling. As a result, the synthetic results do little to support the broader claim that field equations are a generally useful inductive bias.
2. The evaluated model departs substantially from the proposed one, and the real-world results are modest.
- The central relational coupling term is never used in the real-world experiments (Secs. F.2–F.3). Only K-hop input propagation is used, and on six of the nine datasets. The uniform-gate ablation (Table A3) further shows that the learned pairwise gates contribute almost nothing. The model actually evaluated is therefore essentially an independent, linear, damped oscillator per node, driven by unit event impulses. This is closer to a decaying per-node activity counter than to a field propagating over relational structure, which undercuts the paper's central narrative.
- Accuracy lags well behind the state of the art on several datasets: Can. Parl. (~78 vs. ~97 AUROC), Enron (~84 vs. ~92), US Legis. (~72 vs. ~83), and UN Vote (~63 vs. ~70).
- The evaluation protocol is incomplete in several ways:
- Only random negative sampling is reported; DyGLib's standard historical and inductive negative sampling are missing, as is the inductive setting.
- The bipartite DyGLib datasets (Wikipedia, Reddit, MOOC, LastFM) are excluded without explanation.
- Baseline numbers are copied from the original paper rather than rerun, while FNN alone is tuned with ASHA.
- Simple or recent strong baselines are missing, including EdgeBank, FreeDyG, DyGMamba, and TPNet.
- The parameter count grows linearly with the number of training edges, since each edge has a gate logit. The "compactness" claim may not hold on large graphs, especially given that these gates turn out to be largely unnecessary.
- The default integration step is fixed at per distinct timestamp, ignoring actual elapsed time. This sits uneasily with the paper's continuous-time, physics-inspired motivation.
3. Numerical inconsistencies and presentation errors undermine confidence in the results.
- The "Learned ω" AP values in Table A5 (Can. Parl. 82.498, UN Trade 64.002, UN Vote 51.428) do not match the full-model AP in Tables A3 and A6 (79.48, 65.84, 59.98).
- Other values also disagree across tables:
- In Table A7, Can. Parl. second-order AP is reported as 79.76 with no SEM, versus 79.48 elsewhere.
- UCI full AP is 91.12 in Table A4 but 91.01 in Table A3.
- Section 3.2 maps retaining the top 5/20/50/100% of interactions to "dense, medium, sparse, and very-sparse" regimes, which is reversed.
- Notation is inconsistent. The main text defines , while Appendix C writes . Appendix B introduces a separate coefficient , and Appendix D.1 sets .
- In the observation-threshold experiment, the threshold changes both the amount of supervision and the definition of a positive label. Part of FNN's rising AUROC in the dense regime reflects the label shifting toward static support edges. Presenting this as robustness to sparse observation is somewhat misleading.
- The text has numerous grammatical errors (e.g., "event-detection performance stabilize," "Results … shows," "for implement methods"). The AI-use statement is also internally inconsistent: it says AI tools were used "to provide feedback," yet lists "provide feedback on research methodology" among the uses that did not occur.
4. There is no Related Work section, and the overall structure is incomplete.
-
The introduction contains only a brief paragraph touching on PINNs, HNNs/LNNs, latent dynamics networks, GRAND, and GraphCON. Several closely related lines of work are neither reviewed nor contrasted with FNN:
- Temporal graph networks (JODIE, DyRep, TGN, TGAT, CAWN, GraphMixer, DyGFormer). These serve as baselines, yet the paper never discusses how FNN's state differs structurally from their memory mechanisms. JODIE's embedding projection and TGN's time-decayed memory are conceptually close to FNN's damped-oscillator state.
- Continuous dynamics on graphs (GRAND, GraphCON, graph neural ODEs/CDEs, GREAD). GraphCON is itself a second-order coupled-oscillator GNN. What FNN adds beyond event-driven forcing is never made clear.
- Point-process and spreading models (e.g., Hawkes-process-based DyRep, classical diffusion and epidemic models). These also model interaction streams through excitation and decay.
- State-space models and linear recurrences (e.g., S4, LRU). The FNN actually evaluated is essentially a per-node linear second-order recurrence, so this connection deserves discussion.
- Field networks and neural fields. Despite being built around the notion of a "field," the paper does not cite or distinguish itself from existing field-based architectures:
- STFNN (Spatio-Temporal Field Neural Networks, Feng et al., IJCAI 2024) models spatio-temporal data such as air quality as a continuous field and learns its gradients for inference. Its name is nearly identical to FNN, and its subject matter (an evolving field) is related. The authors must cite it and clarify the difference; otherwise there is a real risk of naming and novelty confusion.
- Tensor Field Networks (Thomas et al., 2018) and Euclidean Neural Networks / e3nn (Geiger & Smidt, 2022) define E(3)-equivariant tensor fields over point clouds in 3D Euclidean space. Their fields have genuine geometric meaning, whereas the field here is a latent quantity over an abstract set of entities with no underlying geometry. The authors should address what the "field" framing contributes beyond analogy.
- Neural fields / implicit neural representations (e.g., the survey by Xie et al., 2022, Neural Fields in Visual Computing and Beyond). The term "neural field" is already well established in vision and graphics and is easily confused with this work.
- Neural operators and PDE-inspired GNNs (Fourier Neural Operator, Li et al., 2021; DeepONet, Lu et al., 2021; PDE-GCN, Eliasof et al., 2021). These works likewise use PDE structure to design architectures and are directly relevant to the idea of field equations as an inductive bias.
Without this positioning, it is hard to judge the paper's incremental contribution, which reinforces the novelty concern above. I would also encourage the authors to reconsider the name to avoid confusion with STFNN and the neural-fields literature.
-
There is no dedicated conclusion or limitations section. The Discussion serves as a summary, but it never lists limitations such as the unused coupling term in real-world experiments, the transductive-only setting, parameter growth with edge count, and the disregard of elapsed time.
-
Main text and appendix are poorly balanced. The experimental section in the main paper is thin, and many key results appear only in the appendix: training rollout length, observation threshold, parameter recovery, and all real-world mechanistic ablations (Tables A3–A7). The ablations are the sole evidence for the Discussion's central claim about dataset-dependent mechanism use, so readers must dig through the appendix to verify the paper's main conclusions.
Questions for authors
- What happens on real-world data when the explicit coupling term is enabled? If it hurts performance or causes instability, does this suggest the "relational field" component does not actually hold for real interaction data?
- Could you compare against simple baselines with a matched parameter budget, such as per-node exponentially decaying counters, a linear SSM, or EdgeBank? This would clarify whether the gains come from field-equation structure specifically or from any decaying per-node memory.
- How does FNN perform under historical and inductive negative sampling, and in the inductive setting? Why were the bipartite DyGLib datasets and large-scale TGB benchmarks excluded?
- What exactly is included in the reported parameter counts? Does it include the DyGLib projection layer and link decoder? How do memory and parameter count scale with edge count on Reddit- or tgbl-scale graphs?
- In Table A6, hiding velocity drops UN Trade's AUROC to 34.44, well below chance. This looks more like a distribution shift at the decoder input than a measure of reliance. Could you report mean-ablation or a retrained readout instead, along with the analogous intervention on as a control?
- In the synthetic experiments, what does "physical coefficients held fixed at random values" mean for each baseline? Do the baselines have access to the same topology-learning capacity as FNN? Does FNN's advantage persist when the simulator uses dynamics that do not match FNN's structure (nonlinear, heterogeneous, or delayed)?
- Do you constrain , , and during training (e.g., positivity or stability constraints, given that explicit and symplectic Euler schemes have bounded stability regions)? Did you observe any numerical divergence on long real-world sequences?
- Why does the default model ignore elapsed time between events? The elapsed-time variant is mentioned as an ablation, but its results are not reported. How does it perform?
- How does FNN differ conceptually and technically from STFNN, Tensor Field Networks, and e3nn? Given that your field has no underlying geometric domain, what does the field formulation provide beyond a physics-inspired linear recurrence?