Raymond Zhang, Richard Combes
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 consider Thompson Sampling (TS) for linear combinatorial semi-bandits and subgaussian rewards. We propose the first known TS whose finite-time regret does not scale exponentially with the dimension of the problem. We further show the "mismatched sampling paradox": A learner who knows the rewards distributions and samples from the correct posterior distribution can perform exponentially worse than a learner who does not know the rewards and simply samples from a well-chosen Gaussian posterior. The code used to generate the experiments is available at https://github.com/RaymZhang/CTS-Mismatched-Paradox
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2410.05441")
get_code_for_paper("2410.05441")
have("2410.05441")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2410.05441.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2410.05441)
Connect an agent — have() is free.