Pith. sign in

REVIEW

Alleviating Cold-start Problem in CTR Prediction with A Variational Embedding Learning Framework

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 2201.10980 v1 pith:LUWSN72W submitted 2022-01-17 cs.IR cs.LG

classification cs.IRcs.LG
keywords alleviatingembeddingframeworklearningpriorsproblemvariationalvelf
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a general Variational Embedding Learning Framework (VELF) for alleviating the severe cold-start problem in CTR prediction. VELF addresses the cold start problem via alleviating over-fits caused by data-sparsity in two ways: learning probabilistic embedding, and incorporating trainable and regularized priors which utilize the rich side information of cold start users and advertisements (Ads). The two techniques are naturally integrated into a variational inference framework, forming an end-to-end training process. Abundant empirical tests on benchmark datasets well demonstrate the advantages of our proposed VELF. Besides, extended experiments confirmed that our parameterized and regularized priors provide more generalization capability than traditional fixed priors.

Discussion (0). Sign in to comment.

Pith tools