Pith. sign in

REVIEW 1 cited by

Deep Coevolutionary Network: Embedding User and Item Features for Recommendation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1609.03675 v4 pith:TUY5MTFD submitted 2016-09-13 cs.LG cs.IR

classification cs.LGcs.IR
keywords featuresitemuseritemsmodelsuserscaptureinfluence
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recommender systems often use latent features to explain the behaviors of users and capture the properties of items. As users interact with different items over time, user and item features can influence each other, evolve and co-evolve over time. The compatibility of user and item's feature further influence the future interaction between users and items. Recently, point process based models have been proposed in the literature aiming to capture the temporally evolving nature of these latent features. However, these models often make strong parametric assumptions about the evolution process of the user and item latent features, which may not reflect the reality, and has limited power in expressing the complex and nonlinear dynamics underlying these processes. To address these limitations, we propose a novel deep coevolutionary network model (DeepCoevolve), for learning user and item features based on their interaction graph. DeepCoevolve use recurrent neural network (RNN) over evolving networks to define the intensity function in point processes, which allows the model to capture complex mutual influence between users and items, and the feature evolution over time. We also develop an efficient procedure for training the model parameters, and show that the learned models lead to significant improvements in recommendation and activity prediction compared to previous state-of-the-arts parametric models.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Mind the truncation gap: challenges of learning on dynamic graphs with recurrent architectures

    cs.LG 2024-12 accept novelty 6.0 of 10

    Truncated backpropagation through time prevents graph recurrent networks from learning multi-hop temporal dependencies, causing large performance gaps on dynamic graph benchmarks.

Pith tools