English

Counterfactual Learning from Bandit Feedback under Deterministic Logging: A Case Study in Statistical Machine Translation

Machine Learning 2017-12-15 v3 Computation and Language Machine Learning

Abstract

The goal of counterfactual learning for statistical machine translation (SMT) is to optimize a target SMT system from logged data that consist of user feedback to translations that were predicted by another, historic SMT system. A challenge arises by the fact that risk-averse commercial SMT systems deterministically log the most probable translation. The lack of sufficient exploration of the SMT output space seemingly contradicts the theoretical requirements for counterfactual learning. We show that counterfactual learning from deterministic bandit logs is possible nevertheless by smoothing out deterministic components in learning. This can be achieved by additive and multiplicative control variates that avoid degenerate behavior in empirical risk minimization. Our simulation experiments show improvements of up to 2 BLEU points by counterfactual learning from deterministic bandit feedback.

Keywords

Cite

@article{arxiv.1707.09118,
  title  = {Counterfactual Learning from Bandit Feedback under Deterministic Logging: A Case Study in Statistical Machine Translation},
  author = {Carolin Lawrence and Artem Sokolov and Stefan Riezler},
  journal= {arXiv preprint arXiv:1707.09118},
  year   = {2017}
}

Comments

Conference on Empirical Methods in Natural Language Processing (EMNLP), 2017, Copenhagen, Denmark

R2 v1 2026-06-22T20:59:48.829Z