pith. machine review for the scientific record. sign in

arxiv: 1409.8191 · v1 · submitted 2014-09-29 · 💻 cs.NE · cs.LG

Recognition: unknown

A Neural Networks Committee for the Contextual Bandit Problem

Authors on Pith no claims yet
classification 💻 cs.NE cs.LG
keywords rewardsbanditcontextualnetworksneuralproposedstationarityalgorithm
0
0 comments X
read the original abstract

This paper presents a new contextual bandit algorithm, NeuralBandit, which does not need hypothesis on stationarity of contexts and rewards. Several neural networks are trained to modelize the value of rewards knowing the context. Two variants, based on multi-experts approach, are proposed to choose online the parameters of multi-layer perceptrons. The proposed algorithms are successfully tested on a large dataset with and without stationarity of rewards.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.