Explore-Exploit Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "** ..." to "** …") |
m (Text replacement - ". ---- " to ". ---- ") |
||
| Line 6: | Line 6: | ||
** a [[Supervised Learning Algorithm]]. | ** a [[Supervised Learning Algorithm]]. | ||
* <B>See:</B> [[Reinforcement Learning Algorithm]], [[Multi-Armed Bandit Algorithm]]. | * <B>See:</B> [[Reinforcement Learning Algorithm]], [[Multi-Armed Bandit Algorithm]]. | ||
---- | ---- | ||
---- | ---- | ||
Latest revision as of 04:41, 17 June 2021
An Explore-Exploit Algorithm is an optimization algorithm that includes an exploration algorithm and an exploitation algorithm.
- Context:
- It can be implemented by an Explore-Exploit System (that can solve an explore-exploit task).
- …
- Counter-Example(s):
- See: Reinforcement Learning Algorithm, Multi-Armed Bandit Algorithm.
References
2009
- (Agarwal et al., 2009) ⇒ Deepak Agarwal, Bee-Chung Chen, and Pradheep Elango. (2009). “Explore/Exploit Schemes for Web Content Optimization.” In: Proceedings of the 2009 Ninth IEEE International Conference on Data Mining. ISBN:978-0-7695-3895-2 doi:10.1109/ICDM.2009.52