Pith. sign in

REVIEW

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 1907.06323 v2 pith:ONVR2R25 submitted 2019-07-15 cs.IR cs.LG

A Novel User Representation Paradigm for Making Personalized Candidate Retrieval

classification cs.IR cs.LG
keywords retrievalcandidatecandidatesframeworkitemsmodelnovelprecision
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Candidate retrieval is a fundamental issue in recommendation system. Given user's recommendation request, relevant candidates need to be retrieved in realtime for subsequent ranking operations. Considering that the retrieval operation is conducted over considerable items, it has to be both precise and scalable so that high-quality candidates can be acquired within tolerable latency. Unfortunately, conventional methods would trade off precision for high running efficiency, which leads to inferior retrieval quality. In contrast, those deep learning-based approaches can be highly accurate in identifying relevant items; yet, they are unsuitable for candidate retrieval due to their inherent limitation on scalability. In this work, a novel framework is proposed to address the above challenges. The underlying intuition is to rely on a well-trained ranking model for the supervision of an efficient retrieval model, such that it will unify the scalability and precision as a whole. We have implemented our conceptual framework and made comprehensive evaluation for it, where promising results are achieved against representative baselines. Our work is undergoing a anonymous review, and it will soon be released after the notification. If you're also interested in this problem, please feel free to contact us.

discussion (0)

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