We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We propose a new framework for designing estimators for off-policy evaluation in contextual bandits. Our approach is based on the asymptotically optimal doubly robust estimator, but we shrink the importance weights to minimize a bound on the mean squared error, which results in a better bias-variance tradeoff in finite samples. We use this optimization-based framework to obtain three estimators: (a) a weight-clipping estimator, (b) a new weight-shrinkage estimator, and (c) the first shrinkage-based estimator for combinatorial action sets. Extensive experiments in both standard and combinatorial bandit benchmark problems show that our estimators are highly adaptive and typically outperform state-of-the-art methods.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1907.09623")
get_code_for_paper("1907.09623")
have("1907.09623")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1907.09623.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1907.09623)
Connect an agent — have() is free.