We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. We have no repository linked to it either. That is a statement about our graph, not about the paper.
What is the most statistically efficient way to do off-policy evaluation and optimization with batch data from bandit feedback? For log data generated by contextual bandit algorithms, we consider offline estimators for the expected reward from a counterfactual policy. Our estimators are shown to have lowest variance in a wide class of estimators, achieving variance reduction relative to standard estimators. We then apply our estimators to improve advertisement design by a major advertisement company. Consistent with the theoretical result, our estimators allow us to improve on the existing bandit algorithm with more statistical confidence compared to a state-of-the-art benchmark.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1809.03084")
get_code_for_paper("1809.03084")
have("1809.03084")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1809.03084.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1809.03084)
Connect an agent — have() is free.