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 contextual linear bandit problems under feature uncertainty, where the features are noisy and have missing entries. To address the challenges posed by this noise, we analyze Bayesian oracles given the observed noisy features. Our Bayesian analysis reveals that the optimal hypothesis can significantly deviate from the underlying realizability function, depending on the noise characteristics. These deviations are highly non-intuitive and do not occur in classical noiseless setups. This implies that classical approaches cannot guarantee a non-trivial regret bound. Therefore, we propose an algorithm that aims to approximate the Bayesian oracle based on the observed information under this model, achieving $\tilde{O}(d\sqrt{T})$ regret bound when there is a large number of arms. We demonstrate the proposed algorithm using synthetic and real-world datasets.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1703.01347")
get_code_for_paper("1703.01347")
have("1703.01347")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1703.01347.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1703.01347)
Connect an agent — have() is free.