A Best-of-Both Approach to Improve Match Predictions and Reciprocal Recommendations for Job Search
Shuhei Goda, Yudai Hayashi, Yuta Saito

TL;DR
This paper proposes a novel 'best-of-both' approach for reciprocal recommendations in job search, combining true sparse match labels with dense predictions to improve match quality and personalization.
Contribution
It introduces a meta-model leveraging pseudo-match scores that blend true labels and predictions, enhancing reciprocal recommendation accuracy.
Findings
Outperforms existing methods in offline experiments
Personalized pseudo-match scores improve matching performance
Effectively addresses label sparsity and bias issues
Abstract
Matching users with mutual preferences is a critical aspect of services driven by reciprocal recommendations, such as job search. To produce recommendations in such scenarios, one can predict match probabilities and construct rankings based on these predictions. However, this direct match prediction approach often underperforms due to the extreme sparsity of match labels. Therefore, most existing methods predict preferences separately for each direction (e.g., job seeker to employer and employer to job seeker) and then aggregate the predictions to generate overall matching scores and produce recommendations. However, this typical approach often leads to practical issues, such as biased error propagation between the two models. This paper introduces and demonstrates a novel and practical solution to improve reciprocal recommendations in production by leveraging pseudo-match scores.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConsumer Market Behavior and Pricing · Data Mining Algorithms and Applications · Data Management and Algorithms
