mlsanityData to 7 Oct 2026

Evolutionary Multi-Armed Bandits with Genetic Thompson Sampling

arXiv 2205.10113 ↗First posted 26 Apr 2022cs.NE cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

As two popular schools of machine learning, online learning and evolutionary computations have become two important driving forces behind real-world decision making engines for applications in biomedicine, economics, and engineering fields. Although there are prior work that utilizes bandits to improve evolutionary algorithms' optimization process, it remains a field of blank on how evolutionary approach can help improve the sequential decision making tasks of online learning agents such as the multi-armed bandits. In this work, we propose the Genetic Thompson Sampling, a bandit algorithm that keeps a population of agents and update them with genetic principles such as elite selection, crossover and mutations. Empirical results in multi-armed bandit simulation environments and a practical epidemic control problem suggest that by incorporating the genetic algorithm into the bandit algorithm, our method significantly outperforms the baselines in nonstationary settings. Lastly, we introduce EvoBandit, a web-based interactive visualization to guide the readers through the entire learning process and perform lightweight evaluations on the fly. We hope to engage researchers into this growing field of research with this investigation.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 12 of its 40 references that are in the map. First posted on arXiv 26 Apr 2022.

Builds on

12 of 40 references.

References · 12

  1. 2020Cooperative Multi-Agent Bandits with Heavy Tailscited by 31
  2. 2020Kernel Methods for Cooperative Multi-Agent Contextual Banditscited by 21
  3. 2015Multi-armed Bandit Problem with Known Trendcited by 17
  4. 2020Unified Models of Human Behavioral Agents in Bandits, Contextual Bandits and RLcited by 11
  5. 2018The N-Tuple Bandit Evolutionary Algorithm for Game Agent Optimisationcited by 9
  6. 2020Speaker Diarization as a Fully Online Learning Problem in MiniVoxcited by 7
  7. 2020Online Learning in Iterated Prisoner's Dilemma to Mimic Human Behaviorcited by 6
  8. 2020Online Semi-Supervised Learning in Contextual Bandits with Episodic Rewardcited by 5
  9. 2021Optimal Epidemic Control as a Contextual Combinatorial Bandit with Budgetcited by 5
  10. 2016Bandit-Based Random Mutation Hill-Climbingcited by 4
  11. 2017The N-Tuple Bandit Evolutionary Algorithm for Automatic Game Improvementcited by 2
  12. 2018Enhancing Evolutionary Conversion Rate Optimization via Multi-armed Bandit Algorithmscited by 2

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.

2 papers.