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 study the stochastic contextual bandit problem, where the reward is generated from an unknown function with additive noise. No assumption is made about the reward function other than boundedness. We propose a new algorithm, NeuralUCB, which leverages the representation power of deep neural networks and uses a neural network-based random feature mapping to construct an upper confidence bound (UCB) of reward for efficient exploration. We prove that, under standard assumptions, NeuralUCB achieves $\tilde O(\sqrt{T})$ regret, where $T$ is the number of rounds. To the best of our knowledge, it is the first neural network-based contextual bandit algorithm with a near-optimal regret guarantee. We also show the algorithm is empirically competitive against representative baselines in a number of benchmarks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1911.04462")
get_code_for_paper("1911.04462")
have("1911.04462")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1911.04462.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1911.04462)
Connect an agent — have() is free.