- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper presents a Quotient-Residual decoupling of recurrent memory for memory-based Continuous-Time Dynamic Graph (CTDG) models. It proposes assigning a low-dimensional private residual memory to each individual node while storing a high-dimensional quotient memory on supernodes shared across clusters.
Using this design, the authors introduce the QRTN-M architecture. They further propose two transfer variants—QRTN-X and QRTN-X-Gated—designed to evaluate parameter transferability and the effect of initializing original-node states with coarsened quotient memory.
The paper demonstrates that QRTN-M achieves persistent state compression throughout training and deployment while maintaining predictive performance close to full-memory baselines like TGN.
Critical strengths
S1. Decoupled memory: The authors present a novel memory decoupling method that reduces the memory footprint of CTDG models. Instead of maintaining a full high-dimensional memory vector for each individual node, the model factorizes memory into a shared high-dimensional quotient state () and a low-dimensional private residual state (). The high-dimensional component is shared among nodes within a supernode cluster, while the private component remains node-specific. This paradigm substantially decreases the persistent memory storage required for node states across the graph. Notably, it retains 99.3% of the full-node AP while eliminating 83.0% of the required persistent storage.
S2. Fine-Tuning-Free Transfer and Diagnostic Insights: The proposed transfer variants, QRTN-X and QRTN-X-Gated, provide valuable insights into the distinct roles that accumulated historical memory and learned temporal operators play in predictive modeling. Specifically, they demonstrate how temporal update operators learned on a smaller, coarsened quotient graph can be transferred to operate directly on the full original graph without replaying training streams or performing original-graph fine-tuning.
Critical weaknesses
W1. Outdated Baselines and Limited Evaluation Metrics: The paper omits critical recent memory-based CTDG baselines, such as CTAN and PINT, leading to an incomplete assessment of QRTN's relative performance on the link-prediction task. Furthermore, hard negative sampling strategies such as historical and inductive negatives are reported exclusively for the Wikipedia dataset. These experiments thus do not provide reliable insights into model's predictive performance.
W2. Omission of Temporal Neighborhood Aggregation: The node embedding generation () omits explicit temporal neighborhood aggregation (e.g., GNN or attention layers over 1-hop dynamic neighbors), relying instead on supernode memories to infer structural and dynamic context. This represents a substantial shift in the memory-based CTDG paradigm. Consequently, it requires a thorough analysis of how the choice of clustering technique affects the model's ability to capture long-range dependencies. Specifically, whether deriving context from supernodes enhances or impairs this capability compared to gathering context from explicit temporal neighbors. Because the manuscript lacks both an explanation of how these clusters are maintained/updated for new nodes and comparative experiments evaluating "supernode context gathering" versus "temporal neighbor aggregation," a more rigorous study is needed.
(minor) W3. Readability: Typo in Eq. 5: it should be instead of .
Questions for authors
Q1. What is the algorithm or mechanism used for clustering and for assigning new nodes to clusters?
Q2 Why does model performance for QRTN-X and gated increase for while that of QRTN-M decrease as for MOOC.
12 comments
On Weakness 2 and 3
W2. Temporal-neighborhood aggregation and long-range dependencies
We thank the reviewer for this important observation. We agree that QRTN differs from conventional memory-based temporal graph models by not explicitly aggregating one-hop temporal neighbors through attention. Instead, QRTN obtains temporal context through event-driven shared quotient memory and node-specific recurrent residuals.
For each original node , the representation is
P_c m_{\pi(u)}(t) +P_r r_u(t) +P_\phi\phi(\Delta t_u) +P_x x_u \right),$$ where $m_{\pi(u)}(t)$ represents shared quotient memory, $r_u(t)$ is the node-specific residual, and $\phi(\Delta t_u)$ encodes elapsed time. Every observed interaction contributes a temporal message to the corresponding supernode. Consequently, the quotient state accumulates information from the interaction histories of multiple related nodes, providing shared structural and temporal context without explicitly retrieving a temporal neighborhood for each prediction. The two memory components serve complementary purposes. The quotient state captures shared temporal dynamics, while the private residual preserves endpoint-specific interaction history that would otherwise be lost through aggregation. This allows QRTN to retain original-node distinctions while keeping high-dimensional recurrent state at quotient resolution. We do not claim that quotient-based context is equivalent to explicit temporal-neighborhood attention or that it always captures the same structural dependencies. Rather, QRTN investigates whether compressed event-driven temporal context can retain competitive predictive performance with substantially lower persistent-state requirements. To evaluate this design choice, we compare QRTN-M against the official TGN implementation, which explicitly uses temporal-neighborhood attention. | Dataset | Official TGN AP | QRTN-M AP | QRTN-M State Ratio | |:---|---:|---:|---:| | Wikipedia | **0.9787 ± 0.0017** | 0.9741 ± 0.0012 | 0.170 | | Reddit | **0.9788 ± 0.0008** | 0.9698 ± 0.0019 | 0.189 | | MOOC | 0.8946 ± 0.0214 | **0.9207 ± 0.0093** | 0.192 | | LastFM | 0.6561 ± 0.0208 | **0.7693 ± 0.0729** | 0.189 | QRTN-M achieves AP within 0.0046 and 0.0090 of official TGN on Wikipedia and Reddit, respectively, and higher mean AP on MOOC and LastFM, while using only 17.0%–19.2% of the recurrent-state memory. These results indicate that explicit temporal-neighborhood attention is not essential for achieving competitive predictive performance on the evaluated datasets, although it may remain advantageous in settings requiring more detailed neighborhood information. **Long-range temporal dependencies.** We further evaluate QRTN-M on interactions whose endpoints are separated by at least three dynamic hops. On Wikipedia, AP decreases by 0.027 relative to direct-repeat interactions. This result indicates that QRTN-M retains predictive information on interactions beyond direct endpoint repetition, despite not using explicit temporal-neighborhood attention. We will clarify this distinction and the role of quotient-based temporal context in the revised manuscript. ### W3. Correction of Equation 5 We thank the reviewer for identifying the notation error in Equation 5. The sum is over event messages indexed by $j$, with weights $a_j$ for $j \in \mathcal{I}_c(B)$. The revision states the index explicitly. This does not affect the implementation or any reported result.Addressing the Reviewer's Questions
Q1. Clustering mechanism and assignment of unseen nodes
We thank the reviewer for asking clarification of the clustering algorithm and the treatment of nodes that appear after training.
Clustering procedure. QRTN constructs the quotient partition using only the chronological training stream to prevent information leakage. The training interactions are divided into temporal windows, and nodes exhibiting related temporal interaction patterns are grouped using normalized interaction frequency and edge-feature similarity. Candidate clusters obtained across windows are subsequently consolidated until the target number of supernodes is reached, with
For bipartite datasets, a role-preserving step prevents source and destination nodes from being merged into the same supernode. The resulting partition remains fixed throughout validation and test; no held-out interaction, label, or sampled negative is used to reconstruct the partition.
Assignment of unseen nodes. Nodes appearing for the first time during validation or test are assigned causally to existing supernodes. When informative node features are available, the assignment is made to the nearest compatible training-cluster centroid using cosine similarity. When informative features are unavailable, a deterministic hash-based assignment is used. The assignment does not depend on future interactions, and the node's private residual is initialized to zero before its interaction history begins to accumulate.
In QRTN-M, the newly appearing node retains its original identity through its private residual while accessing high-dimensional shared state through the assigned supernode. In contrast, QRTN-X and QRTN-X-Gated instantiate the learned temporal operators directly at original-node resolution after transfer and therefore do not require quotient routing during deployment.
We have clarified the clustering construction, role-preserving partitioning, and causal assignment of unseen nodes in the revised manuscript.
Q2. Different coarsening-ratio trends on MOOC
We thank the reviewer for highlighting the different behavior of QRTN-M and the transfer variants as . We agree that this observation requires clarification because the three operating modes use quotient memory differently.
QRTN-M maintains shared quotient memory throughout training and deployment, whereas QRTN-X and QRTN-X-Gated train temporal operators at quotient resolution and subsequently deploy them at original-node resolution. Consequently, increasing changes the amount of state sharing in QRTN-M but also changes the training-to-deployment resolution mismatch in the transfer variants.
On MOOC, QRTN-M achieves test AP at , decreasing to at . In contrast, QRTN-X improves from to , while QRTN-X-Gated improves from to over the same endpoints.
For QRTN-M, smaller coarsening ratios allow multiple related nodes to contribute messages to a shared high-dimensional state, while their private residuals are updated at original-event resolution. Increasing reduces this sharing, so the quotient channel receives information from fewer nodes while retaining its micro-block update schedule. On a temporally heterogeneous interaction stream such as MOOC, the stronger performance at smaller is consistent with shared-state aggregation providing useful contextual information and a possible regularizing effect.
For QRTN-X and QRTN-X-Gated, increasing brings the quotient-training resolution closer to the original-node resolution used during deployment. This reduces the degree of structural aggregation encountered during training and may reduce the mismatch between learned temporal operators and their deployment setting. QRTN-X-Gated additionally initializes original-node states through a fixed, attenuated lift of learned quotient memory, providing historical-state information without replay or fine-tuning.
These observations are consistent with the different state-ownership and update mechanisms of the operating modes, although they do not establish a universal causal relationship between and predictive performance. In particular, the observed decline of QRTN-M on MOOC should not be interpreted as a general trend across all datasets. We have clarified that the preferred coarsening ratio depends on the operating mode and dataset characteristics.
On Weakness 1
We thank the reviewer for the evaluation and constructive feedback. We appreciate the recognition of our decoupled memory architecture, persistent-state compression, and fine-tuning-free transfer framework. We agree that comparisons with recent temporal graph models, a clearer explanation of temporal-neighborhood information, and further details on clustering and new-node assignment would strengthen the paper. We address these concerns below.
W1. Comparison with recent baselines and hard-negative evaluation
We thank the reviewer for suggesting comparisons with CTAN and PINT. To address this concern, we report results from their official implementations alongside QRTN on Wikipedia, Reddit, and LastFM.
Average Precision (AP, %):
ROC-AUC (%):
These results show that CTAN and PINT achieve better predictive performance in several settings, particularly on LastFM, which is expected because QRTN addresses a different operating constraint: reducing the recurrent-state footprint while preserving original-node temporal link prediction without full-graph recovery training. At r=0.15, QRTN-M uses only 17.0%–18.9% of the full-node recurrent-state memory on these three datasets. QRTN-X and QRTN-X-Gated further reduce quotient-training state to approximately 8.1%–10.3% of the full-node reference, although they restore original-node state at deployment. Notably, QRTN-M remains within 0.37 AUC percentage points of CTAN on Wikipedia and 1.73 points on Reddit despite computational efficiency.
Extension to historical and inductive negatives.
We agree that reporting hard-negative evaluations only on Wikipedia limits the conclusions. We therefore extended the evaluation to Reddit and MOOC. The following table reports test AP over three seeds, comparing QRTN-M against the 172-dimensional full-node control implemented in the same runtime, using identical chronological splits and stored negative samples.
Under inductive negatives, QRTN-M retains 98.8%, 96.7%, and 98.1% of the full-node AP on Wikipedia, Reddit, and MOOC, respectively, while using only 17.0%–19.2% of its recurrent-state memory. Historical negatives reveal larger performance gaps on Reddit and MOOC, indicating that distinguishing previously observed interaction partners remains more challenging under compressed state ownership. These additional experiments provide a more complete assessment of the predictive information retained by QRTN-M under different negative-sampling protocols.