- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies how changes in negative sampling distributions affect dynamic graph learning. It proposes AdaDGL, which samples training negatives according to their similarity to the positive destination node. For evaluation, it constructs harder negatives when the target distribution is unknown, or adapts the prediction head when the distribution is known. Experiments across multiple datasets and dynamic graph backbones show improvements under different negative sampling settings.
Critical strengths
-
The paper addresses a practical issue: negative sampling affects both model training and evaluation difficulty. Studying performance across different sampling distributions is useful for assessing robustness.
-
The method can be integrated into existing backbones with few architectural changes. The supplementary comparisons with matched prediction-head adaptation help separate the benefits of sampling from those of additional fine-tuning.
Critical weaknesses
- The method appears to offer limited novelty. Existing methods already use dynamic node embeddings to select hard negatives. AdaDGL mainly changes which node is used to compute similarity and how negatives are sampled, then fine-tunes the prediction head in a standard way. Although the results improve, these changes seem relatively small, and the paper does not clearly show what they add beyond existing hard-negative sampling methods.
- Theorem 4 claims that every node has a chance of being selected as a negative. But randomly choosing candidates does not guarantee this, since SNS keeps only the most similar one. With distinct similarity scores and at least two candidates sampled without replacement, the least similar node can never be selected. The authors should clarify the sampling rule and explain why the claim holds.
- Harder negatives do not necessarily make the evaluation more reliable. A lower AP under SNS shows that the test is harder, but not that it measures model performance more accurately. The authors should explain why choosing negatives similar to the positive destination gives a better evaluation, especially when the target negative distribution is unknown.
Questions for authors
-
What is the main technical advance over existing hard-negative sampling methods such as NHS, and why does it help when the negative sampling distribution changes?
-
Does SNS sample candidates with or without replacement? Under what conditions can every node be selected as a negative, as claimed in Theorem 4?
-
What evidence, beyond a lower AP, supports SNS as a more reliable evaluation method when the target negative distribution is unknown?