Timeline for What are the major differences between multi-armed bandits and the other well-known algorithms (DQN, A3C, PPO, etc)?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 14, 2021 at 21:02 | comment | added | Kostya | @notaprogrammertoday Can one see linux as a CPU? Your question conflates completely separate concepts. | |
| May 14, 2021 at 19:29 | comment | added | notaprogrammertoday | @Kostya Can we see DQN as a bandit problem? | |
| May 10, 2021 at 21:21 | vote | accept | notaprogrammertoday | ||
| May 10, 2021 at 21:03 | history | edited | Kostya | CC BY-SA 4.0 |
added 1165 characters in body
|
| May 8, 2021 at 1:05 | history | edited | nbro | CC BY-SA 4.0 |
added 4 characters in body
|
| May 7, 2021 at 17:28 | comment | added | Kostya | @NeilSlater I agree that you can go deeper into the usefulness of MABs. But, given that the question conflates RL algorithms with MABs I didn't feel like that this level of discussion would be helpful. | |
| May 7, 2021 at 17:27 | comment | added | notaprogrammertoday | @NeilSlater Are you up to make a full answer? I would be interested in seeing what you have to say on the subject. | |
| May 7, 2021 at 17:22 | comment | added | Neil Slater | I think this answer misses where MABs are different from MDPs in terms of reasons for studying and using them. Whilst MABs can be treated as a strict subset of MDPs, and that is how S&B uses them - as a stepping stone towards learning about RL - there are also approaches and analysis that are used more often with MABs because of what they model. Optimising regret during learning is a good example of this. Not usually of concern in RL (and difficult to define and measure in MDPs), but of great interest in applications of MABs in real-world projects. | |
| May 7, 2021 at 16:38 | history | answered | Kostya | CC BY-SA 4.0 |