Second Order Calibration: A Simple Way to Get Approximate Posteriors

preprint2015arXivOpen access

Abstract

Many large-scale machine learning problems involve estimating an unknown parameter θiθ_{i} 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 θiθ_{i}. A posterior distribution for each θiθ_{i} is usually more useful but harder to get. We present a simple post-processing technique that takes point estimates or scores tit_{i} (from any method) and estimates an approximate posterior for each θiθ_{i}. We build on the idea of calibration, a common post-processing technique that estimates E(θi ⁣ ⁣∣ ⁣ ⁣ti)\mathrm{E}\left(θ_{i}\!\!\bigm|\!\! t_{i}\right). Our method, second order calibration, uses empirical Bayes methods to estimate the distribution of θi ⁣ ⁣∣ ⁣ ⁣tiθ_{i}\!\!\bigm|\!\! t_{i} and uses the estimated distribution as an approximation to the posterior distribution of θiθ_{i}. 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.