Learning Dynamic Embeddings from Temporal Interactions
Not on the map. Why?
Abstract (arXiv)
Modeling a sequence of interactions between users and items (e.g., products, posts, or courses) is crucial in domains such as e-commerce, social networking, and education to predict future interactions. Representation learning presents an attractive solution to model the dynamic evolution of user and item properties, where each user/item can be embedded in a euclidean space and its evolution can be modeled by dynamic changes in embedding. However, existing embedding methods either generate static embeddings, treat users and items independently, or are not scalable. Here we present JODIE, a coupled recurrent model to jointly learn the dynamic embeddings of users and items from a sequence of user-item interactions. JODIE has three components. First, the update component updates the user and item embedding from each interaction using their previous embeddings with the two mutually-recursive Recurrent Neural Networks. Second, a novel projection component is trained to forecast the embedding of users at any future time. Finally, the prediction component directly predicts the embedding of the item in a future interaction. For models that learn from a sequence of interactions, traditional training data batching cannot be done due to complex user-user dependencies. Therefore, we present a novel batching algorithm called t-Batch that generates time-consistent batches of training data that can run in parallel, giving massive speed-up. We conduct six experiments on two prediction tasks---future interaction prediction and state change prediction---using four real-world datasets. We show that JODIE outperforms six state-of-the-art algorithms in these tasks by up to 22.4%. Moreover, we show that JODIE is highly scalable and up to 9.2x faster than comparable models. As an additional experiment, we illustrate that JODIE can predict student drop-out from courses five interactions in advance.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Dec 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 3; 2024: 1; 2025: 0; 2026: 1.
10 papers.
- 2023Graph Neural Networks for temporal graphs: State of the art, open challenges, and opportunitiescited by 60
- 2022Encoder-Decoder Architecture for Supervised Dynamic Graph Learning: A Surveycited by 14
- 2023Decoupled Graph Neural Networks for Large Dynamic Graphscited by 14
- 2021Efficient Scaling of Dynamic Graph Neural Networkscited by 11
- 2021Lifelong Learning on Evolving Graphs Under the Constraints of Imbalanced Classes and New Classescited by 11
- 2022Lightweight Compositional Embeddings for Incremental Streaming Recommendationcited by 3
- 2021Learning Student Interest Trajectory for MOOCThread Recommendationcited by 2
- 2024A Temporal Graph Network Framework for Dynamic Recommendationcited by 1
- 2023Towards Temporal Edge Regression: A Case Study on Agriculture Trade Between Nationscited by 0
- 2026Efficient Dynamic Algorithms for Graph Neural Networks with Non-Linear Propagationcited by 0
- 2026Efficient Dynamic Algorithms for Graph Neural Networks with Non-Linear Propagation26 Sep 2026
- 2024A Temporal Graph Network Framework for Dynamic Recommendation24 Mar 2024
- 2023Towards Temporal Edge Regression: A Case Study on Agriculture Trade Between Nations15 Aug 2023
- 2023Decoupled Graph Neural Networks for Large Dynamic Graphs14 May 2023
- 2023Graph Neural Networks for temporal graphs: State of the art, open challenges, and opportunities2 Feb 2023
- 2022Encoder-Decoder Architecture for Supervised Dynamic Graph Learning: A Survey20 Mar 2022
- 2022Lightweight Compositional Embeddings for Incremental Streaming Recommendation4 Feb 2022
- 2021Lifelong Learning on Evolving Graphs Under the Constraints of Imbalanced Classes and New Classes20 Dec 2021
- 2021Efficient Scaling of Dynamic Graph Neural Networks16 Sep 2021
- 2021Learning Student Interest Trajectory for MOOCThread Recommendation10 Jan 2021