Continuous-Time User Preference Modelling for Temporal Sets Prediction
Not on the map. Why?
Abstract (arXiv)
Given a sequence of sets, where each set has a timestamp and contains an arbitrary number of elements, temporal sets prediction aims to predict the elements in the subsequent set. Previous studies for temporal sets prediction mainly focus on the modelling of elements and implicitly represent each user's preference based on his/her interacted elements. However, user preferences are often continuously evolving and the evolutionary trend cannot be fully captured with the indirect learning paradigm of user preferences. To this end, we propose a continuous-time user preference modelling framework for temporal sets prediction, which explicitly models the evolving preference of each user by maintaining a memory bank to store the states of all the users and elements. Specifically, we first construct a universal sequence by arranging all the user-set interactions in a non-descending temporal order, and then chronologically learn from each user-set interaction. For each interaction, we continuously update the memories of the related user and elements based on their currently encoded messages and past memories. Moreover, we present a personalized user behavior learning module to discover user-specific characteristics based on each user's historical sequence, which aggregates the previously interacted elements from dual perspectives according to the user and elements. Finally, we develop a set-batch algorithm to improve the model efficiency, which can create time-consistent batches in advance and achieve 3.5x and 3.0x speedups in the training and evaluation process on average. Experiments on four real-world datasets demonstrate the superiority of our approach over state-of-the-arts under both transductive and inductive settings. The good interpretability of our method is also shown.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 27 of its 54 references that are in the map. First posted on arXiv 12 Apr 2022.
Builds on
27 of 54 references.
References · 27
- 2017Attention Is All You Needcited by 60,361
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,548
- 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,057
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,908
- 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,169
15 more
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2015Session-based Recommendations with Recurrent Neural Networkscited by 695
- 2019Neural Graph Collaborative Filteringcited by 661
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 544
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
- 2020Inductive Representation Learning on Temporal Graphscited by 462
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 265
- 2019MeLU: Meta-Learned User Preference Estimator for Cold-Start Recommendationcited by 121
- 2021Continuous-Time Sequential Recommendation with Temporal Graph Collaborative Transformercited by 69
- 2019Lifelong Sequential Modeling with Personalized Memorization for User Response Predictioncited by 41
- 2022On the Effectiveness of Sampled Softmax Loss for Item Recommendationcited by 39
- 2020Predicting Temporal Sets with Deep Neural Networkscited by 16
Built on by
Citing papers per year: 2023: 2; 2024: 4; 2025: 1.
7 papers.
- 2023Towards Better Dynamic Graph Learning: New Architecture and Unified Librarycited by 157
- 2024Improving Temporal Link Prediction via Temporal Walk Matrix Projectioncited by 21
- 2024DyG-Mamba: Continuous State Space Modeling on Dynamic Graphscited by 17
- 2024Repeat-Aware Neighbor Sampling for Dynamic Graph Learningcited by 11
- 2023Label Attention Network for Temporal Sets Prediction: You Were Looking at a Wrong Self-Attentioncited by 2
- 2025TAMI: Taming Heterogeneity in Temporal Interactions for Temporal Graph Link Predictioncited by 2
- 2024Set2Seq Transformer: Temporal and Position-Aware Set Representations for Sequential Multiple-Instance Learningcited by 0
- 2025TAMI: Taming Heterogeneity in Temporal Interactions for Temporal Graph Link Prediction23 Oct 2025
- 2024Improving Temporal Link Prediction via Temporal Walk Matrix Projection5 Oct 2024
- 2024DyG-Mamba: Continuous State Space Modeling on Dynamic Graphs13 Aug 2024
- 2024Set2Seq Transformer: Temporal and Position-Aware Set Representations for Sequential Multiple-Instance Learning6 Aug 2024
- 2024Repeat-Aware Neighbor Sampling for Dynamic Graph Learning24 May 2024
- 2023Towards Better Dynamic Graph Learning: New Architecture and Unified Library23 Mar 2023
- 2023Label Attention Network for Temporal Sets Prediction: You Were Looking at a Wrong Self-Attention1 Mar 2023