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 investigate the feasibility of learning from a mix of both fully-labeled supervised data and contextual bandit data. We specifically consider settings in which the underlying learning signal may be different between these two data sources. Theoretically, we state and prove no-regret algorithms for learning that is robust to misaligned cost distributions between the two sources. Empirically, we evaluate some of these algorithms on a large selection of datasets, showing that our approach is both feasible and helpful in practice.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1901.00301")
get_code_for_paper("1901.00301")
have("1901.00301")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1901.00301.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1901.00301)
Connect an agent — have() is free.