In a 2-armed-bandit problem, an agent has an opportunity to see n reward for each action. Now the agent should choose actions m times and maximize the expected reward in these m decisions. but it cant see the reward of them. what is the best approach for this?

  • $\begingroup$ Could you clarify - the agent is allowed $n$ time steps where it can see the rewards, followed by $m$ time steps over which it wants to maximise the reward, but gets no further feedback? $\endgroup$ – Neil Slater Nov 23 '20 at 20:51
  • $\begingroup$ Yes, That's right! $\endgroup$ – lighting Nov 24 '20 at 4:14

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.