pith. sign in

arxiv: 1812.02289 · v1 · pith:XZDWRP24new · submitted 2018-12-06 · 💻 cs.SI · cs.LG· stat.ML

Learning Dynamic Embeddings from Temporal Interactions

classification 💻 cs.SI cs.LGstat.ML
keywords interactionsembeddingjodiedynamicembeddingsitemuserscomponent
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Time2Vec: Learning a Vector Representation of Time

    cs.LG 2019-07 unverdicted novelty 6.0

    Time2Vec learns a vector representation of time that improves model performance when used in place of raw time inputs across various models and problems.

  2. Diachronic Embedding for Temporal Knowledge Graph Completion

    cs.LG 2019-07 unverdicted novelty 6.0

    Proposes a model-agnostic diachronic entity embedding function to extend static KG embedding models for temporal knowledge graph completion, with a proof that the SimplE combination is fully expressive.