Chicheng Zhang, Akshay Krishnamurthy, Aleksandrs Slivkins, Maryam Majzoubi, Rajan Chari, John Langford
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 create a computationally tractable algorithm for contextual bandits with continuous actions having unknown structure. Our reduction-style algorithm composes with most supervised learning representations. We prove that it works in a general sense and verify the new functionality with large-scale experiments.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.06040")
get_code_for_paper("2006.06040")
have("2006.06040")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.06040.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.06040)
Connect an agent — have() is free.