Explore-Exploit Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "). * <B>Counter-" to "). ** ... * <B>Counter-") |
m (Text replacement - "** ..." to "** …") |
||
| Line 2: | Line 2: | ||
* <B>Context:</B> | * <B>Context:</B> | ||
** It can be implemented by an [[Explore-Exploit System]] (that can solve an [[explore-exploit task]]). | ** It can be implemented by an [[Explore-Exploit System]] (that can solve an [[explore-exploit task]]). | ||
** | ** … | ||
* <B>Counter-Example(s):</B> | * <B>Counter-Example(s):</B> | ||
** a [[Supervised Learning Algorithm]]. | ** a [[Supervised Learning Algorithm]]. | ||
Revision as of 22:09, 1 March 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