Implicit feedback (e.g., clicks, dwell times, etc.) is an abundant source of
data in human-interactive systems. While implicit feedback has many advantages
(e.g., it is inexpensive to collect, user centric, and timely), its inherent
biases are a key obstacle to its effective use. For example, position bias in
search rankings strongly influences how many clicks a result receives, so that
directly using click data as a training signal in Learning-to-Rank (LTR)
methods yields sub-optimal results. To overcome this bias problem, we present a
counterfactual inference framework that provides the theoretical basis for
unbiased LTR via Empirical Risk Minimization despite biased data. Using this
framework, we derive a Propensity-Weighted Ranking SVM for discriminative
learning from implicit feedback, where click models take the role of the
propensity estimator. In contrast to most conventional approaches to de-bias
the data using click models, this allows training of ranking functions even in
settings where queries do not repeat. Beyond the theoretical support, we show
empirically that the proposed learning method is highly effective in dealing
with biases, that it is robust to noise and propensity model misspecification,
and that it scales efficiently. We also demonstrate the real-world
applicability of our approach on an operational search engine, where it
substantially improves retrieval performance.

通过对因果推断框架的提出，使用倾向权重排序支持向量机从隐式反馈学习，消除了数据偏差问题，取得了更好的结果。