mlsanityData to 7 Oct 2026

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

arXiv 1707.09118 ↗First posted 28 Jul 2017stat.ML cs.CL cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Jul 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2018: 3; 2019: 0; 2020: 1; 2021: 3; 2022: 1; 2023: 3; 2024: 1; 2025: 0; 2026: 1.

13 papers.

Sort:

By area: