acceptodds
Under review as a conference paper at ICLR 2027

Temporal Sheaf Neural Networks: Coordinate-Consistent Memory for Link Prediction Across Temporal Graphs

Abstract

Temporal link prediction requires persistent memory that incorporates new interactions while retaining useful history. We introduce Temporal Sheaf Neural Networks (TSNN), one memory architecture for homogeneous, knowledge-graph, heterogeneous, and sequential temporal graphs under a single typed event schema. TSNN pairs node memories with evolving orthogonal frames: each event updates the endpoint frames, exact carry-over preserves the represented vectors across that coordinate change, and recurrent updates and sheaf diffusion over the retained history graph then update the content. All queries at a timestamp are scored from one strict-history snapshot before any update is committed. Our analysis identifies how frames can influence predictions of the base scorer: only through coordinate-dependent content updates or anisotropic diffusion. With exact carry, equivariant content updates, and a scalar diffusion gain, its ambient trajectories and scores coincide with those of a matched frame-free model; with a fixed gain and a small step, its diffusion maps are non-expansive in a weighted norm as the graph evolves. Across 21 TGB, TGB 2.0, and TGB-Seq datasets, TSNN exceeds every listed comparator on 18, including all eight TGB-Seq datasets, and improves thgl-forum MRR by 0.1075; the same architecture also has the best mean rank in transductive AP on 13 DGB datasets (1.23 among 13 methods, against 1.96 for TPNet). In matched ablations on five datasets, evolving frames have higher mean MRR than frame-free, fixed-frame, shared-frame, side-state, and FiLM controls, with significant gains of 0.0091–0.0245 over the frame-free model (Welch -test, ).

Primary area:
learning on graphs and other geometries & topologies
Keywords:
temporal graph learning, sheaf neural networks, temporal link prediction, geometric deep learning, dynamic graphs, orthogonal transport, evolving local frames, connection Laplacians, Householder reflections

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 one review, above 0% of the others.
Reviewer_3uEWOpenReview ↗
Rating
1
Confidence
4
Informativeness
1
Presentation
1
Soundness
1
Read review
Paper summary

This paper introduces a new temporal representation learning framework leveraging sheaf neural networks particularly dynamic link prediction task. Specifically, they introduce TSNN unified memory architecture for a homeogenous, heterogenous, KG based datasets. TSNN represent the node memory through a evolving frames that are othogonal. The update writes event information into the frame state, the recurrent update through sheaf diffusion. TSNN is evaluated on wide range of benchmarks with downstream task as temporal link prediction.

Critical strengths

Strengths:

1: A unified temporal memory architecture applicable to homogeneous graphs, heterogeneous graphs, and knowledge graphs.

2: The frame-based memory formulation explicitly separates coordinate changes from content updates, preserving the represented memory through exact carry-over.

3: The empirical evaluation covers a broad range of datasets across multiple temporal graph benchmarks.

Critical weaknesses

Weakness:

W1: Advantage from evolving frames cannot be established clearly from the theoretical analysis provided. Specifically, Proposition 4 shows that the node-factored sheaf Laplacian is orthogonally conjugate to a lifted ordinary graph Laplacian $ L_{\mathcal F}=S^\top(L_G\otimes I_d)S. $ Consequently, the construction has trivial spatial holonomy and does not introduce additional spectral expressivity through its diffusion operator. Moreover, Proposition 12 establishes that the frames disappear from the ambient dynamics under equivariant content updates and scalar gains. Hence it doesn't shed enough focus on why this particular parameterization is preferable to simpler recurrent state or more recent SSM models for CTDGs.

W2: The expressivity result relies on an overly restricted comparator. Although valid under its assumptions, it does not establish an advantage over standard recurrent temporal graph models or auxiliary-state architectures with comparable resources. More importantly, the paper does not characterize the expressive power of its representations relative to the Temporal Weisfeiler–Lehman (TWL) test. Such an analysis would clarify which temporal structures evolving frames can distinguish beyond existing models.

W3: The empirical gains do not establish a favorable accuracy-cost trade-off. The framed model stores ((k+1)d) state scalars per node, compared with (d) memory scalars in a frame-free counterpart, and adds frame generation, transport, and carry-over operations. The reported frame-removal ablations show meaningful improvements, but the auxiliary-state controls are not matched in parameters or compute.

W4: The scoring and normalization choices require clearer justification. Equations (2)–(4) combine manually selected scalar features, logarithmic transforms, hard clipping of the distance-scale parameter, clipping of the residual score, and row normalization of frame parameters. These choices are mathematically permissible, but their numerical constants are not derived from the theory. Hard clipping can suppress gradients outside the permitted ranges, while row normalization affects the dynamics of subsequent additive frame updates. Sensitivity analyses and a clear account of how these choices were selected are needed, particularly because the residual scorer is crucial to performance. This choices make me hard to believe the advantages of frames and also mainly this choices kills the expressivity of the model.

W5 : Experiments : Introduction motivates persistent memory and retention of useful history, but the experiments do not directly establish improved long-range dependency modeling. Evaluation on datasets with long histories does not isolate this capability, especially given the strong contribution of pair-history features. Performance stratified by temporal dependency distance and controlled history-truncation experiments would clarify whether evolving frames improve memory retention. Furthermore, evaluation is restricted to link prediction; the inductive results concern links involving new nodes and do not demonstrate applicability to node-level prediction tasks.

Experiements on long range tasks (Like sequence classification typically used in temporal graph community) will be useful.

W6 : Importantly I want to emphasize the paper in current form is not written well.

For instance, The event-indexed state (Ξi)(\Xi^i), the pre-wave snapshot (Ξt−=Ξb(t))(\Xi_t^-=\Xi^{b(t)}), and the node-field notation are introduced densely. Check the notations on degree matrices with and without parametrizations. Similarly, (\dot F) denotes a discrete proposal rather than a derivative, and (\ell) denotes both a logarithmic feature transform and loss quantities.

More importantly, many sentences are incomplete for example as in page 3 (line 155) Only then does it read the new events, TSNN architecture on 34 settings (it should be datasets).

Several dimensions (d_{ctx}) needs to be justified and several symbols needs to be introduced before usage.

I believe the paper requires a complete rewriting for a better readability.

Questions for authors

Please address my weakness.

4 comments
AuthorsOpenReview ↗

Response => what frames add (W1)

Thank you for the detailed review. It led to new experiments and to a rewrite of Sections 2–3.

W1. What do evolving frames add, given Propositions 4 and 12?

We agree with your reading of both propositions. Proposition 4 shows that frames do not act through the spectrum of the diffusion operator. The flat, node-factored construction is inherited from Bundle Neural Networks (Bamberger et al., 2025), as Table 4 states. What TSNN adds is temporal: persistent frames, exact carry-over, coordinate-dependent updates and a frame-dependent diagonal gain.

By Proposition 12, frames cancel when the content update is equivariant and the gain is scalar. A framed variant that meets both conditions reproduces the frame-free accuracies exactly on the sequence task of part 3. TSNN meets neither: its update is not equivariant and its default gain is diagonal, so diffusion itself can depend on the frames (Proposition 13). In that setting the full model exceeds the frame-free model with the same gain on all five datasets and on every one of three new seeds (test MRR, full minus frame-free):

tgbl-wikitkgl-smallpediaYouTubetkgl-polecattkgl-icews
New seeds 2025–2027, paired mean+0.0119+0.0133+0.0109+0.0082+0.0223
Smallest per-seed difference+0.0110+0.0124+0.0096+0.0071+0.0220
Submission (Table 20)+0.0129+0.0132+0.0111+0.0091+0.0245

Against the other frame-free variants it has the higher mean on every dataset where they were run (table in our reply to K48B). Removing exact carry-over costs 0.003–0.020 MRR on four of the five datasets (Table 3).

Simpler recurrent state. We compare with coordinate-free controls that add persistent state.

  • FiLM (Table 3, three seeds) is below the full model on all five datasets, by 0.002–0.052.
  • New: a side state with a norm-preserving update, the closest coordinate-free analogue of an orthogonal frame (test MRR, seed 42):
Modeltgbl-wikitkgl-smallpediaYouTubetkgl-polecat
Full TSNN0.82250.62120.52040.1852
Side state, norm-preserving update0.81340.61430.51760.1843

On this single seed the full model is ahead on all four datasets. The Wiki and Smallpedia margins (0.0091 and 0.0069) exceed seed variation. The YouTube and Polecat margins do not.

  • New: a side state matched in stored state and in parameters, as you ask in W3. It is reported in part 2.

State-space models. Frames are a coordinate layer around the content update. The frame update, exact carry and the strict-history protocol do not depend on the GRU, so a state-space update can replace it. The related-work section will position TSNN against DyG-Mamba (Li et al., 2025), DyGMamba (Ding et al., 2025) and CTDG-SSM (Raghuvanshi et al., 2026) in these terms. Published numbers allow a comparison under the protocol of Table 13 (transductive AP, random negatives, 70/15/15 split; the shared baseline columns agree). On the 12 DGB datasets that DyG-Mamba reports (Li et al., 2025, Table 2), TSNN's AP is higher on all 12, within noise on Can. Parl. and by up to 23 points elsewhere:

AP (%)WikiRedditMOOCLastFMEnronSocial Evo.UCICan. Parl.US Legis.UN TradeUN VoteContact
DyG-Mamba99.0699.2590.1794.2293.2294.7596.7998.3774.1168.5565.6998.37
TSNN99.4199.7299.3894.5197.7396.4597.0698.4287.4691.5582.7199.11

The TSNN runs are those of Table 13, with the inputs of Table 14. The revision adds these numbers to Table 13.

The revision states the temporal nature of the contribution directly after Proposition 4, and the revised introduction says that TSNN uses node-factored maps.

Single-run tables in parts 1–4 come from separate runs, so the full-model value on tgbl-wiki differs slightly between them (0.8225–0.8232; three-seed standard deviation 0.0014).

AuthorsOpenReview ↗

Response => temporal WL and cost (W2, W3)

W2. Restricted comparator; temporal WL.

Theorem 19 demonstrates a mechanism within its stated comparator class: a frame turn moves the carried coordinates off the rest point of a gate that stays closed in shared coordinates, so later states differ. The paper does not claim an expressivity ordering over standard recurrent models (Table 6), and the revision says so next to the theorem.

Relative to temporal WL (Souza et al., 2022) we can state one exact result, which the revision adds. Take the model with a common initial memory and frame for every node, and with pair recency and optional inputs off, on six nodes. Stream A is one wave with arcs i → i+1 (mod 6). Stream B adds the arcs i → i+2. Initial memories, frames and event metadata are identical, and messages and frame proposals are aggregated by mean, so one source and one destination message average to the same value as two of each. Every node receives the same update in both streams. Both retained graphs are regular (the history cap holds every event), so diffusion leaves the uniform state unchanged, and every query receives the same score. Temporal WL separates the two streams in one refinement, since a node has two incident interactions in A and four in B. This is the known limit of mean aggregation (Xu et al., 2019), and it holds only in this anonymous setting. The reference model is outside it: it reads pair recency, and its seeded per-node initial state is fixed for each node and acts as a node identifier (cf. random node initialisation, Abboud et al., 2021), whereas the temporal WL comparison concerns models that do not use node identifiers (Souza et al., 2022). The revised conclusion lists a full temporal WL characterisation of the reference model as an open direction.

W3. Accuracy–cost trade-off; controls not matched in parameters or compute.

Cost on tgbl-wiki in the ablation configuration (d = 128, k = 2):

ModelTrainable parametersStored state per nodeRun timeTest MRR
Full TSNN571,5661,536 B1.47 h0.8229
Frame-free, same diagonal-gain diffusion386,734512 B1.24 h0.8094
Frame-free, no diffusion386,734512 B0.27 h0.8214
  • At the same diffusion setting, frames add 48% parameters and 19% run time (0.23 h), and store (k+1)d instead of d scalars per node, for +0.0135 test MRR here. Most of the run time is the diffusion step.
  • The cheapest variant drops diffusion. On tgbl-wiki it is within 0.0015 of the full model at 0.27 h. On YouTube it is 0.19 MRR lower (reply to K48B). The trade-off depends on the dataset.
  • Widening the full model from d = 128 to d = 192 or 256 does not raise MRR on any of the four datasets tested (Table 19). A frame-free model at width 3d is not among the controls.
  • Matched control: a new side-state arm with the same stored state as the full model and matched parameters (574,638) did not train to a competitive level (test MRR between 0.0155 and 0.4692 on the five datasets). We draw no conclusion from it, or from the side-state arm of Table 3, which behaves the same way.

The revision adds the cost table and writes "same-configuration" for controls that share a configuration but not a parameter count.

AuthorsOpenReview ↗

Response => long-range memory (W5)

W5. Long-range dependency modelling; link prediction only.

We ran the three analyses you ask for.

History truncation (tgbl-wiki, test MRR, complete model). The model's state is rebuilt by replaying only the last N timestamps of history before the test queries.

History replayedAllLast 128 timestampsLast 32 timestamps
Test MRR0.82320.56810.4749

History older than 128 timestamps contributes 0.255 MRR.

Dependency distance (same model), for pairs seen before, by time since their last interaction:

Time since last interactionMost recent quarterMiddle halfOldest quarter
Test MRR0.970.940.84

These two analyses have no frame-free arm and do not separate node memory from the pair-recency table. They show that long history matters. They do not show that frames improve retention.

Sequence classification. We follow the task of Gravina et al. (2024): the model predicts the first node's signal (+1 or −1) from the last node of a temporal path of n nodes, so the signal has to be relayed through node memory along the path. The task has no pair history. Accuracy in % of the best run at each length (chance is 50%):

n357911131520
Full TSNN10010010010098.1596.9766.057.9
Frame-free10010010010096.591.762.251.9
Without node memory50.050.050.050.050.050.050.050.0
  • The task is solved reliably at 3 and 5 nodes: every run reaches 100%.
  • From 7 nodes on, runs differ. The best runs hold up to 13 nodes, and other runs fall to chance.
  • At 15 and 20 nodes the model is near chance.
  • Frames make no difference: the framed and frame-free models behave alike at every length.
  • Without node memory the model is at chance at every length, so the signal is carried by the persistent node memory.
  • A framed variant with an equivariant update and a scalar gain reproduces the frame-free accuracies exactly (difference 0.0 at every length), as Proposition 12 predicts.

The frame claim rests on the controls of parts 1 and 2. All 34 benchmark settings are temporal link prediction, as the title states. Node-level prediction is not evaluated, and the revised conclusion states this scope.

AuthorsOpenReview ↗

Response => constants and presentation (W4, W6)

W4. Scoring and normalisation choices.

Sensitivity on tgbl-wiki (test MRR, single runs):

VariantMRR
Reference (constants as in the paper)0.8231
Residual score: smooth bound instead of hard clip0.8229
Distance scale: smooth bound instead of hard clip0.8221
Row normalisation off0.8215

All three variants are within 0.0016 of the reference, about one seed standard deviation (0.0014 in Table 3). The smooth bounds have a non-zero gradient everywhere, and with them MRR changes by 0.0002 and 0.0010, so the hard clips do not suppress useful gradients.

Expressivity. Away from the safeguard branch of Eq. (1), each reflector depends only on the direction of its row. Row normalisation keeps that direction, so it does not change which frames can be represented. It fixes the scale against which later additive increments act. The two clips bound ranges (distance scale between 0.05 and about 20; residual score in [−10, 10]) and leave the function class inside them unchanged. Every arm of the frame comparison uses the same scorer and the same constants.

Why these inputs. Each geometric input of the residual scorer is a function of the ambient vectors alone, which keeps the base scorer frame-invariant (Propositions 9 and 16). The inner product ⟨hu,Qhc⟩\langle h_u, Q h_c \rangle and the squared norms of huh_u and hch_c are the Gram entries of the ambient pair, and they determine every function of the pair that is invariant to a common orthogonal map (Villar et al., 2021). The distance is one such function. The other inputs are elapsed times and relation and type embeddings, and log(1+x) compresses the wide range of the elapsed times. The clips and the floor are numerical safeguards. The same constants are used on every dataset, and none is tuned per dataset.

The revision adds the sensitivity table and one sentence on each constant.

W6. Presentation.

The revision rewrites the notation of Sections 2–3 along your list, so that each symbol is introduced before it is used:

  • State notation. The event-indexed state Ξi\Xi^i, the pre-wave snapshot Ξt−\Xi_t^- and the node-field notation are introduced one per sentence. Blocks C–E use − and + superscripts for pre- and post-wave state throughout.
  • Degree matrices. One sentence states which degree each matrix uses (DiD_i and DGD_G the safeguarded degree, DG0D_G^0 the true degree) and that the gain DθD_\theta is not a degree matrix.
  • The frame proposal F˙\dot F becomes an increment ΔF\Delta F, since it is a discrete update and not a derivative.
  • The symbol ℓ\ell. The feature transform is written log1p(x), ℓ\ell is kept for losses, and the diffusion round gets its own index.
  • The dimension dctxd_{ctx} is explained term by term: two memories (2d), two half-width time encodings (dtimed_{time}), event features (dxd_x), the relation embedding (drd_r) and the two-component role indicator (2), plus two type embeddings on heterogeneous graphs.
  • Line 155. The sentence ran on after a colon and was hard to parse. It is now two sentences.
  • "34 settings". We mean dataset–protocol pairs: DGB Wikipedia and tgbl-wiki share the same underlying data under different protocols. A footnote defines the term.
  • Tables. Decimals and markers are made consistent.

The bibliography gains Abboud et al. (2021), Villar et al. (2021) and Raghuvanshi et al. (2026).

Comments on the paper

6 comments
AuthorsOpenReview ↗

Response => configuration selection (W1, Q1)

Thank you for the careful review.

W1 / Q1. Test-informed configuration selection; what remained untouched.

The Table 3 settings were frozen on 27 July 2026 on all five datasets. The first test evaluation of any Table 3 arm came after that date, so every arm and every dataset was untouched by test data when the settings were fixed. Section 6 and Appendix F.5.2 state this order the wrong way round. We apologise for the error. The test scores of the pair-recency-off cohort quoted there were computed after the choice had been made, and the revision corrects both passages. The benchmark configurations of Tables 1–2 were each selected on validation data and evaluated once per seed.

The choice concerned is whether to enable pair recency (the time since the queried pair last interacted). It is a single scorer input shared by every arm, including the frame-free arm. Its effect is far larger than the frame effect under test (0.01–0.02 MRR): the earlier cohort without it scores 0.45–0.53 MRR on tgbl-wiki and 0.02–0.03 on tkgl-icews, against 0.82 and 0.27 for the Table 3.

We ran the confirmatory cohort you suggest: three new seeds (2025–2027) with the same settings. Test MRR, mean over the three seeds:

tgbl-wikitkgl-smallpediaYouTubetkgl-polecattkgl-icews
Full TSNN0.82190.62210.52070.18500.2734
Frame-free, same diagonal gain0.80990.60870.50980.17670.2510
Full − frame-free (paired mean, before rounding)+0.0119+0.0133+0.0109+0.0082+0.0223
Smallest and largest per-seed difference+0.0110, +0.0133+0.0124, +0.0141+0.0096, +0.0123+0.0071, +0.0088+0.0220, +0.0225
Submission (Table 20)+0.0129+0.0132+0.0111+0.0091+0.0245

The difference is positive on every seed of every dataset (15 of 15) and is 90–101% of the submitted value. A two-sided paired t-test on the per-seed differences gives p ≤ 0.0051 on each dataset, and the Welch test used in the paper gives p ≤ 0.0038. Both are below the Bonferroni threshold of 0.01 for five datasets. Per-seed scores are in the comment under the general response, and the revision adds this table. The other frame-free variants (Q2) are in the next comment.

AuthorsOpenReview ↗

Response => frame design and generator learning (W2, Q2)

W2 / Q2. Strongest frame-free alternatives, same selection budget, paired seed differences.

We agree. The revision attributes the result to the frame design and no longer to the training of the frame generator.

The new seeds include the frame-free variants you name. Entries are full minus arm in test MRR (mean of three paired per-seed differences), with the number of seeds on which the full model is ahead in parentheses. Three variants were not run on tkgl-icews.

Armtgbl-wikitkgl-smallpediaYouTubetkgl-polecattkgl-icews
Frame-free, diagonal gain+0.0119 (3/3)+0.0133 (3/3)+0.0109 (3/3)+0.0082 (3/3)+0.0223 (3/3)
Frame-free, scalar gain+0.0032 (3/3)+0.0057 (3/3)+0.0003 (2/3)+0.0007 (2/3)–
Frame-free, identity gain+0.0011 (3/3)+0.0079 (3/3)+0.0041 (3/3)+0.0005 (1/3)–
Frame-free, no diffusion+0.0001 (1/3)+0.0021 (2/3)+0.1916 (3/3)+0.0037 (3/3)–
  • The full model has the higher mean in all 17 comparisons, as in the same 17 comparisons of the submission (Tables 3 and 19).
  • Each variant is behind by at least 0.003 on two or more datasets, and the gaps match the submitted ones. Scalar gain: Wiki +0.0032 (submitted +0.0031), Smallpedia +0.0057 (+0.0069). Identity gain: Smallpedia +0.0079 (+0.0077), YouTube +0.0041 (+0.0034). No diffusion: YouTube +0.19, Polecat +0.0037 (+0.0029).
  • The diagonal-gain arm is the comparison at the same diffusion setting. The other variants are stronger. Against the strongest variant on each dataset (no diffusion on Wiki and Smallpedia, scalar gain on YouTube, identity gain on Polecat) the margin is +0.0001 to +0.0021, which three seeds do not separate. The strongest variant differs by dataset, and the full model uses one diffusion setting on all of them.
  • The revised claim: one framed setting is at or above every frame-free setting in mean on every dataset, with a clear margin at the same diffusion setting.

Same selection budget. In a rerun on seeds 42 and 43 (two of Table 3's seeds), the settings of every arm were selected on validation data in the same way. Full minus arm, mean of the two seeds:

Armtgbl-wikitkgl-smallpediaYouTubetkgl-polecat
Frame-free, diagonal gain+0.0146+0.0143+0.0126+0.0101
Frame-free, scalar gain+0.0035+0.0066+0.0016+0.0008
Frame-free, identity gain+0.0035+0.0083+0.0048+0.0004
Frame-free, no diffusion+0.0009+0.0016+0.2048+0.0025

The difference is positive on both seeds in all 16 cells.

Generator. A generator frozen at initialisation, whose frames still evolve, is slightly ahead of the full model on Wiki, YouTube and icews (by 0.0016–0.0020 on the new seeds, up to 0.0023 in the submission) and level on Polecat. Training it adds +0.0120 on Smallpedia on all three seeds (+0.0091 in the submission). Per-seed scores are in the comment under the general response. The revision replaces "Evolution matters more than learning its generator" with this statement, and Table 3, Block C, will list all frame-free variants with paired per-seed differences.

AuthorsOpenReview ↗

Response => one architecture and optional components (W1, Q1)

Thank you for a precise review.

W1 / Q1. Dataset-specific configuration and optional components; how much remains with a core configuration.

The state-update equations (Blocks C–E) are identical in all 34 settings, and every run contains the base scorer of Block B (Eqs. (2)–(3)). Beyond the event features, the graph family enters only through the relation and type embedding tables and the candidate domain.

The base scorer includes the pair-recency input of Eq. (3), one strict-past scalar per candidate. It is on by default (Section 3.2). Removing it from the frame-free model lowers MRR on three of the four datasets tested, for example from 0.8094 to 0.4170 on tgbl-wiki and from 0.6089 to 0.0132 on tkgl-smallpedia (Table 19). We treat it as part of the model. We write "base scorer" because "TSNN-core" in the paper names the variant without it.

Optional inputs are used on 16 of the 34 settings (Tables 11 and 14): all 13 DGB datasets (EdgeBank count mixing and common-neighbour features on every one; neighbour attention, coordinate differences and the time-encoding input on the subsets listed in Table 14), tgbl-wiki (EdgeBank count mixing, common-neighbour features), tgbl-review (EdgeBank count mixing, coordinate differences) and thgl-software (neighbour attention). The other 18 TGB and TGB-Seq runs use none.

TSNN leads the listed comparators on 18 TGB/TGB-Seq datasets. Of these, 16 never used an optional component, so their improvement remains in full (test MRR from Tables 1–2):

DatasetTSNNBest listed (method)Margin
tkgl-smallpedia0.62420.6136 (EdgeReMIND)+0.0106
tkgl-polecat0.23030.228 (TLogic)+0.0023
tkgl-icews0.28710.2694 (EdgeReMIND)+0.0177
tkgl-wikidata0.65020.6397 (EdgeReMIND)+0.0105
thgl-forum0.83810.7306 (EdgeReMIND)+0.1075
thgl-github0.83360.7842 (EdgeReMIND)+0.0494
thgl-myket0.92190.9056 (EdgeReMIND)+0.0163
tgbl-comment0.92760.9172 (CRAFT)+0.0104
ML-20M0.44380.3663 (SDG)+0.0775
Taobao0.70710.7068 (CRAFT)+0.0003
Yelp0.73850.7269 (CRAFT)+0.0116
GoogleLocal0.66380.6288 (SGNN-HN)+0.0350
Flickr0.69430.6234 (CRAFT)+0.0709
YouTube0.65410.6054 (SDG)+0.0487
Patent0.71380.2460 (JODIE)+0.4678
WikiLink0.76640.7548 (CRAFT)+0.0116

On 13 of them (all but tkgl-polecat, Taobao and Patent) the margin is 0.010–0.108 MRR, against seed standard deviations of at most 0.0025. The tgbl-wiki, tgbl-review and DGB results are reported with the optional inputs of Tables 11 and 14, and we claim them for those configurations only. Without any optional input, TSNN leads on at least 16 of the 21 TGB/TGB-Seq datasets.

Apart from these inputs, datasets differ in their hyperparameters and training configuration (Appendix F.3, Table 11), selected per dataset on validation data, as is usual for the listed comparators.

The revision writes "one core memory update" in the abstract, names the optional inputs in the DGB sentence, adds a table with one row per dataset and one column per optional input, and extends Table 11 to all 21 TGB/TGB-Seq datasets.

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

Related papers

Loading the map…

Discussion (0)

Sign in to comment.