Abstract
Many large-scale machine learning problems involve estimating an unknown parameter for each of many items. For example, a key problem in sponsored search is to estimate the click through rate (CTR) of each of billions of query-ad pairs. Most common methods, though, only give a point estimate of each . A posterior distribution for each is usually more useful but harder to get. We present a simple post-processing technique that takes point estimates or scores (from any method) and estimates an approximate posterior for each . We build on the idea of calibration, a common post-processing technique that estimates . Our method, second order calibration, uses empirical Bayes methods to estimate the distribution of and uses the estimated distribution as an approximation to the posterior distribution of . We show that this can yield improved point estimates and useful accuracy estimates. The method scales to large problems - our motivating example is a CTR estimation problem involving tens of billions of query-ad pairs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.