- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes ATD-DyG, a continuous-time dynamic graph learning framework that aims to address temporal extraction bias and structural noise propagation. The method consists of two main components. First, an adaptive semantic evolution kernel based on a truncated Mittag-Leffler expansion adjusts temporal memory according to semantic similarity, with the goal of preserving long-range but relevant historical interactions while rapidly forgetting semantically inconsistent ones. Second, the paper formulates neighborhood denoising as a sequential subset-selection problem and uses policy-based reinforcement learning to make hard edge-retention decisions. The step-wise reward is defined as the marginal improvement in the log-likelihood of the target link, so that the cumulative reward is aligned with the downstream link-prediction objective. The method is evaluated against 11 CTDG baselines on seven datasets under both transductive and inductive settings, together with robustness, ablation, efficiency, and stability analyses.
Critical strengths
- Coherent problem formulation and method design. The paper provides a clear motivation for coupling temporal modeling with structural denoising. In particular, the adaptive semantic evolution mechanism attempts to distinguish semantic relevance from physical recency, while the subsequent reinforcement-learning module uses the resulting representations as decision priors for hard neighborhood selection. This makes the overall framework conceptually coherent rather than a simple combination of unrelated components.
- Strong empirical coverage and well-motivated reward design. The paper evaluates the proposed model against 11 baselines across seven datasets under both transductive and inductive settings, where ATD-DyG obtains strong average rankings. In addition, defining the reinforcement-learning reward as the marginal improvement in target-link log-likelihood leads to a telescoping cumulative reward that is directly connected to the final prediction objective, which is a meaningful design choice.
Critical weaknesses
- There is a substantial mismatch between the theoretical analysis of the adaptive semantic evolution kernel and its actual implementation. The proposed model uses a finite truncated Mittag-Leffler expansion, and the experiments ultimately adopt K=20 for computational reasons. However, the theoretical argument supporting the transition between exponential forgetting and long-tail power-law memory relies on the limiting behavior of the full Mittag-Leffler function, including the limit as K approaches infinity. Therefore, the current analysis does not establish that the implemented finite-K kernel actually exhibits the asymptotic memory behavior that forms a central motivation of the method. This issue is particularly important because the claimed long-range memory property is one of the main technical justifications for the adaptive evolution module.
- The current empirical analysis does not sufficiently isolate or validate the paper's central design choices. The main RL ablations compare the full method with Select-All, Select-None, and Select-Random variants. These are relatively weak controls and do not establish whether policy-based reinforcement learning is necessary compared with stronger deterministic or differentiable alternatives such as learned gating, threshold-based pruning, or top-k selection. Similarly, replacing the Mittag-Leffler kernel with exponential decay does not disentangle the contribution of fractional memory from the contribution of semantic adaptation of the fractional order. The robustness claim is also broader than the current evidence: controlled structural-noise injection is mainly demonstrated on Enron, despite denoising being a central contribution of the paper. Moreover, the exact construction of the injected structural noise should be described more explicitly to ensure reproducibility.
Questions for authors
- Can the authors provide a theoretical error bound or a finite-K analysis showing that the truncated Mittag-Leffler kernel used in the actual implementation, particularly with K=20, preserves the claimed long-tail memory behavior over the temporal range encountered in the datasets? Without such an analysis, it is unclear whether the asymptotic properties derived for the limiting function apply to the evaluated model.
- Can the authors provide stronger ablations that separately evaluate fixed fractional order versus semantic-adaptive fractional order, and compare the RL-based hard selection mechanism with competitive non-RL pruning strategies such as learned gating, threshold-based selection, or deterministic top-k selection?
- Could the authors clarify the exact structural-noise generation protocol and evaluate robustness on additional datasets or perturbation types? Since robustness and proactive denoising are central claims of the paper, broader controlled evaluation would materially affect my assessment.