# Dynamic Embeddings for Interaction Prediction

arXiv: https://arxiv.org/abs/2011.05208 · HTML: https://mlsanity.com/paper/2011.05208/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 Nov 2020.

## Built on by (most cited first, 6 of 6)

- [Parameter-free Dynamic Graph Embedding for Link Prediction](https://mlsanity.com/paper/2210.08189/) (2022)
- [Triple Structural Information Modelling for Accurate, Explainable and Interactive Recommendation](https://mlsanity.com/paper/2304.11528/) (2023)
- [SINCERE: Sequential Interaction Networks representation learning on Co-Evolving RiEmannian manifolds](https://mlsanity.com/paper/2305.03883/) (2023)
- [Dynamic Customer Embeddings for Financial Service Applications](https://mlsanity.com/paper/2106.11880/) (2021)
- [Contrastive Sequential Interaction Network Learning on Co-Evolving Riemannian Spaces](https://mlsanity.com/paper/2401.01243/) (2024)
- [Empowering Few-Shot Recommender Systems with Large Language Models -- Enhanced Representations](https://mlsanity.com/paper/2312.13557/) (2023)

## Abstract (arXiv)

In recommender systems (RSs), predicting the next item that a user interacts with is critical for user retention. While the last decade has seen an explosion of RSs aimed at identifying relevant items that match user preferences, there is still a range of aspects that could be considered to further improve their performance. For example, often RSs are centered around the user, who is modeled using her recent sequence of activities. Recent studies, however, have shown the effectiveness of modeling the mutual interactions between users and items using separate user and item embeddings. Building on the success of these studies, we propose a novel method called DeePRed that addresses some of their limitations. In particular, we avoid recursive and costly interactions between consecutive short-term embeddings by using long-term (stationary) embeddings as a proxy. This enable us to train DeePRed using simple mini-batches without the overhead of specialized mini-batches proposed in previous studies. Moreover, DeePRed's effectiveness comes from the aforementioned design and a multi-way attention mechanism that inspects user-item compatibility. Experiments show that DeePRed outperforms the best state-of-the-art approach by at least 14% on next item prediction task, while gaining more than an order of magnitude speedup over the best performing baselines. Although this study is mainly concerned with temporal interaction networks, we also show the power and flexibility of DeePRed by adapting it to the case of static interaction networks, substituting the short- and long-term aspects with local and global ones.