paper-with-me

홈 › Papers

Sampling-Bias-Corrected Neural Modeling for Large Corpus Item Recommendations

2019-09-16 · ACM Conference on Recommender Systems 2019 9 · Xinyang Yi, Ji Yang, Lichan Hong, Derek Zhiyuan Cheng, Lukasz Heldt, Aditee Ajit Kumthekar, Zhe Zhao, Li Wei, Ed Chi

Many recommendation systems need to retrieve and score items from a large corpus. A common approach to handle data sparsity and power-law item distribution is to learn item representations from its content features. Apart from many content-aware systems based on matrix factorization, in this paper, we consider a modeling framework with two-tower neural networks where one network called item tower is used to encode a wide variety of item features. Optimizing loss functions calculated from in-batch negatives, which are items sampled in a random batch, is a general recipe of training such two-tower models. However, batch loss is subject to sampling bias which could severely restrict model performance, particularly in the case of power-law distribution. In this work, we present a novel algorithm for estimating item frequency from streaming data. Our main idea is to sketch and estimate item occurrences via gradient descent. Through theoretical analysis and simulations, we show that the proposed algorithm can work without fixed item vocabulary, and is capable of producing unbiased estimation and being adaptive to item distribution change. We then apply the sampling-bias-corrected modeling approach to build a large scale retrieval system called Neural Deep Retrieval (NDR) for YouTube recommendations. The system is deployed to retrieve personalized suggestions from a corpus of tens of millions videos. We demonstrate the effectiveness of sampling bias correction through offline experiments on two real-world datasets. We also conduct live A/B testings to show that the NDR system leads to improved recommendation quality for YouTube.

📄 PDF Abstract BibTeX

Code (2)

caesarjuly/reginx/blob/master/trainer/models/two_tower.py tf
massquantity/LibRecommender tf

Tasks

Recommendation SystemsRetrieval

Similar Papers 제목 키워드 기반

Fundamental Bias in Inverting Random Sampling Matrices with Application to Sub-sampled Newton

2025-02-19 · Chengmei Niu, Zhenyu Liao, Zenan Ling, Michael W. Mahoney

A substantial body of work in machine learning (ML) and randomized numerical linear algebra (RandNLA) has exploited various sorts of random sketching methodologies, including random sampling and random projection, with m…

Distributed OptimizationStochastic Optimization

Bayesian analysis of the prevalence bias: learning and predicting from imbalanced data

2021-07-31 · Loic Le Folgoc, Vasileios Baltatzis, Amir Alansary, Sujal Desai 외

Datasets are rarely a realistic approximation of the target population. Say, prevalence is misrepresented, image quality is above clinical standards, etc. This mismatch is known as sampling bias. Sampling biases are a ma…

Bayesian Sampling Bias Correction: Training with the Right Loss Function

2020-06-24 · L. Le Folgoc, V. Baltatzis, A. Alansary, S. Desai 외

We derive a family of loss functions to train models in the presence of sampling bias. Examples are when the prevalence of a pathology differs from its sampling rate in the training dataset, or when a machine learning pr…

e-SNLI-VE: Corrected Visual-Textual Entailment with Natural Language Explanations

2020-04-07 · Virginie Do, Oana-Maria Camburu, Zeynep Akata, Thomas Lukasiewicz

The recently proposed SNLI-VE corpus for recognising visual-textual entailment is a large, real-world dataset for fine-grained multimodal reasoning. However, the automatic way in which SNLI-VE has been assembled (via com…

Multimodal ReasoningNatural Language Inference

A noise-corrected Langevin algorithm and sampling by half-denoising

2024-10-08 · Aapo Hyvärinen

The Langevin algorithm is a classic method for sampling from a given pdf in a real space. In its basic version, it only requires knowledge of the gradient of the log-density, also called the score function. However, in d…

Denoising