← Search

Or Feldman

2 accepted papers

2026

FLASH: Flexible Learning of Adaptive Sampling from History in Temporal Graph Neural Networks

IJCAI 2026

Aggregating temporal signals from historic interactions is a key step in future link prediction on dynamic graphs. However, incorporating long histories is resource-intensive. Hence, temporal graph neural networks (TGNNs) often rely on historical neighbors sampling heuristics such as uniform samplin

Cited by 0Scholar ↗
2026

Revisting Node Affinity Prediction In Temporal Graphs

ICLR 2026poster

Node affinity prediction is a common task that is widely used in temporal graph learning with applications in social and financial networks, recommender systems, and more. Recent works have addressed this task by adapting state-of-the-art dynamic link property prediction models to node affinity pre…

Cited by 0Source ↗code ↗Scholar ↗