Pith. sign in

REVIEW 1 cited by

A Dynamic Meta-Learning Model for Time-Sensitive Cold-Start Recommendations

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 2204.00970 v1 pith:DWOGSBRY submitted 2022-04-03 cs.IR cs.LG

classification cs.IRcs.LG
keywords interactionsmodelrecommendationscold-starttime-sensitiveuseruserscurrent
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present a novel dynamic recommendation model that focuses on users who have interactions in the past but turn relatively inactive recently. Making effective recommendations to these time-sensitive cold-start users is critical to maintain the user base of a recommender system. Due to the sparse recent interactions, it is challenging to capture these users' current preferences precisely. Solely relying on their historical interactions may also lead to outdated recommendations misaligned with their recent interests. The proposed model leverages historical and current user-item interactions and dynamically factorizes a user's (latent) preference into time-specific and time-evolving representations that jointly affect user behaviors. These latent factors further interact with an optimized item embedding to achieve accurate and timely recommendations. Experiments over real-world data help demonstrate the effectiveness of the proposed time-sensitive cold-start recommendation model.

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. Online Item Cold-Start Recommendation with Popularity-Aware Meta-Learning

    cs.IR 2024-11 conditional novelty 6.0 of 10

    PAM uses popularity-based task partitioning in meta-learning, plus data augmentation and self-supervised losses, to improve cold-start item recommendation in online streaming recommenders.

Pith tools